./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-61.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-61.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 952f1621c7899c5ce964b8bd35a2296981cb24cd167b0d1d0e9f7406c8d49f3b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:40:18,620 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:40:18,673 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:40:18,676 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:40:18,677 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:40:18,692 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:40:18,693 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:40:18,693 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:40:18,693 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:40:18,694 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:40:18,694 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:40:18,694 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:40:18,695 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:40:18,695 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:40:18,695 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:40:18,695 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:40:18,696 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:40:18,696 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:40:18,696 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:40:18,696 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:40:18,697 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:40:18,700 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:40:18,700 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:40:18,701 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:40:18,701 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:40:18,701 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:40:18,701 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:40:18,701 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:40:18,702 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:40:18,702 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:40:18,702 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:40:18,702 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:40:18,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:40:18,703 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:40:18,703 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:40:18,703 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:40:18,703 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:40:18,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:40:18,703 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:40:18,704 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:40:18,704 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:40:18,712 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:40:18,712 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-clean/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 -> 952f1621c7899c5ce964b8bd35a2296981cb24cd167b0d1d0e9f7406c8d49f3b [2024-10-11 13:40:18,961 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:40:18,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:40:18,982 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:40:18,983 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:40:18,984 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:40:18,985 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-61.i [2024-10-11 13:40:20,443 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:40:20,651 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:40:20,651 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-61.i [2024-10-11 13:40:20,666 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/dc79b019e/901411b48fda426cbf0b937bf0c01294/FLAG981b6c347 [2024-10-11 13:40:21,009 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/dc79b019e/901411b48fda426cbf0b937bf0c01294 [2024-10-11 13:40:21,013 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:40:21,015 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:40:21,016 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:40:21,016 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:40:21,020 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:40:21,021 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:40:21" (1/1) ... [2024-10-11 13:40:21,021 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2724e57d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:40:21, skipping insertion in model container [2024-10-11 13:40:21,022 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:40:21" (1/1) ... [2024-10-11 13:40:21,046 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:40:21,201 WARN L248 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-61.i[916,929] [2024-10-11 13:40:21,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:40:21,268 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:40:21,286 WARN L248 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-61.i[916,929] [2024-10-11 13:40:21,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:40:21,328 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:40:21,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:40:21 WrapperNode [2024-10-11 13:40:21,329 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:40:21,330 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:40:21,330 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:40:21,330 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:40:21,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:40:21" (1/1) ... [2024-10-11 13:40:21,351 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:40:21" (1/1) ... [2024-10-11 13:40:21,398 INFO L138 Inliner]: procedures = 29, calls = 203, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 560 [2024-10-11 13:40:21,398 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:40:21,399 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:40:21,399 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:40:21,402 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:40:21,412 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:40:21" (1/1) ... [2024-10-11 13:40:21,412 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:40:21" (1/1) ... [2024-10-11 13:40:21,416 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:40:21" (1/1) ... [2024-10-11 13:40:21,439 INFO L175 MemorySlicer]: Split 147 memory accesses to 21 slices as follows [2, 7, 8, 10, 10, 3, 6, 8, 5, 8, 8, 6, 8, 6, 6, 8, 3, 19, 8, 3, 5]. 13 percent of accesses are in the largest equivalence class. The 22 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 23 writes are split as follows [0, 3, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. [2024-10-11 13:40:21,439 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:40:21" (1/1) ... [2024-10-11 13:40:21,439 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:40:21" (1/1) ... [2024-10-11 13:40:21,455 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:40:21" (1/1) ... [2024-10-11 13:40:21,458 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:40:21" (1/1) ... [2024-10-11 13:40:21,470 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:40:21" (1/1) ... [2024-10-11 13:40:21,484 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:40:21" (1/1) ... [2024-10-11 13:40:21,500 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:40:21,500 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:40:21,501 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:40:21,501 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:40:21,501 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:40:21" (1/1) ... [2024-10-11 13:40:21,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:40:21,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:40:21,553 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:40:21,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:40:21,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:40:21,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 13:40:21,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 13:40:21,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-11 13:40:21,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-11 13:40:21,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-11 13:40:21,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-11 13:40:21,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-10-11 13:40:21,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-10-11 13:40:21,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-10-11 13:40:21,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-10-11 13:40:21,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-10-11 13:40:21,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-10-11 13:40:21,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-10-11 13:40:21,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2024-10-11 13:40:21,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2024-10-11 13:40:21,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#15 [2024-10-11 13:40:21,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#16 [2024-10-11 13:40:21,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#17 [2024-10-11 13:40:21,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#18 [2024-10-11 13:40:21,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#19 [2024-10-11 13:40:21,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#20 [2024-10-11 13:40:21,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 13:40:21,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 13:40:21,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 13:40:21,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 13:40:21,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 13:40:21,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 13:40:21,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-11 13:40:21,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-11 13:40:21,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-11 13:40:21,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-11 13:40:21,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-11 13:40:21,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-11 13:40:21,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-11 13:40:21,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-10-11 13:40:21,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-10-11 13:40:21,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-10-11 13:40:21,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2024-10-11 13:40:21,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2024-10-11 13:40:21,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2024-10-11 13:40:21,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2024-10-11 13:40:21,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2024-10-11 13:40:21,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 13:40:21,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 13:40:21,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-11 13:40:21,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-11 13:40:21,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-11 13:40:21,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-11 13:40:21,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-10-11 13:40:21,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-10-11 13:40:21,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-10-11 13:40:21,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-10-11 13:40:21,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-10-11 13:40:21,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-10-11 13:40:21,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-10-11 13:40:21,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2024-10-11 13:40:21,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2024-10-11 13:40:21,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#15 [2024-10-11 13:40:21,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#16 [2024-10-11 13:40:21,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#17 [2024-10-11 13:40:21,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#18 [2024-10-11 13:40:21,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#19 [2024-10-11 13:40:21,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#20 [2024-10-11 13:40:21,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 13:40:21,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 13:40:21,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 13:40:21,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 13:40:21,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 13:40:21,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 13:40:21,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-11 13:40:21,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-11 13:40:21,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-11 13:40:21,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-11 13:40:21,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-11 13:40:21,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-11 13:40:21,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-11 13:40:21,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-10-11 13:40:21,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-10-11 13:40:21,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-10-11 13:40:21,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2024-10-11 13:40:21,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2024-10-11 13:40:21,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2024-10-11 13:40:21,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2024-10-11 13:40:21,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2024-10-11 13:40:21,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 13:40:21,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 13:40:21,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-11 13:40:21,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-11 13:40:21,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-11 13:40:21,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-11 13:40:21,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-10-11 13:40:21,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-10-11 13:40:21,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-10-11 13:40:21,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-10-11 13:40:21,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-10-11 13:40:21,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-10-11 13:40:21,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-10-11 13:40:21,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2024-10-11 13:40:21,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2024-10-11 13:40:21,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#15 [2024-10-11 13:40:21,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#16 [2024-10-11 13:40:21,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#17 [2024-10-11 13:40:21,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#18 [2024-10-11 13:40:21,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#19 [2024-10-11 13:40:21,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#20 [2024-10-11 13:40:21,609 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:40:21,609 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:40:21,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:40:21,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 13:40:21,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 13:40:21,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 13:40:21,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 13:40:21,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 13:40:21,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 13:40:21,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 13:40:21,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 13:40:21,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 13:40:21,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-11 13:40:21,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-11 13:40:21,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-11 13:40:21,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-11 13:40:21,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-11 13:40:21,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-11 13:40:21,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-11 13:40:21,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-11 13:40:21,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-11 13:40:21,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-11 13:40:21,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2024-10-11 13:40:21,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:40:21,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:40:21,863 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:40:21,865 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:40:22,438 INFO L? ?]: Removed 104 outVars from TransFormulas that were not future-live. [2024-10-11 13:40:22,439 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:40:22,476 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:40:22,477 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:40:22,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:40:22 BoogieIcfgContainer [2024-10-11 13:40:22,477 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:40:22,480 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:40:22,483 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:40:22,487 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:40:22,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:40:21" (1/3) ... [2024-10-11 13:40:22,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13adb36c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:40:22, skipping insertion in model container [2024-10-11 13:40:22,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:40:21" (2/3) ... [2024-10-11 13:40:22,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13adb36c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:40:22, skipping insertion in model container [2024-10-11 13:40:22,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:40:22" (3/3) ... [2024-10-11 13:40:22,492 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-61.i [2024-10-11 13:40:22,510 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:40:22,511 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:40:22,571 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:40:22,577 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;@5c6c74c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:40:22,577 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:40:22,581 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 85 states have (on average 1.388235294117647) internal successors, (118), 86 states have internal predecessors, (118), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 13:40:22,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-11 13:40:22,594 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:40:22,596 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:40:22,596 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:40:22,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:40:22,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1188613599, now seen corresponding path program 1 times [2024-10-11 13:40:22,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:40:22,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441048904] [2024-10-11 13:40:22,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:40:22,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:40:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:40:23,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:40:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:40:23,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:40:23,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:40:23,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:40:23,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:40:23,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:40:23,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:40:23,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:40:23,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:40:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:40:23,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:40:23,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:40:23,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:40:23,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:40:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:40:23,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:40:23,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:40:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:40:23,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 13:40:23,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:40:23,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 13:40:23,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 13:40:23,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 13:40:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 13:40:23,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:40:23,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441048904] [2024-10-11 13:40:23,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441048904] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:40:23,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:40:23,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:40:23,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281291395] [2024-10-11 13:40:23,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:40:23,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:40:23,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:40:23,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:40:23,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:40:23,342 INFO L87 Difference]: Start difference. First operand has 113 states, 85 states have (on average 1.388235294117647) internal successors, (118), 86 states have internal predecessors, (118), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 13:40:23,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:40:23,398 INFO L93 Difference]: Finished difference Result 223 states and 359 transitions. [2024-10-11 13:40:23,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:40:23,407 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 185 [2024-10-11 13:40:23,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:40:23,417 INFO L225 Difference]: With dead ends: 223 [2024-10-11 13:40:23,417 INFO L226 Difference]: Without dead ends: 111 [2024-10-11 13:40:23,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:40:23,425 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:40:23,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:40:23,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-11 13:40:23,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-10-11 13:40:23,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 84 states have (on average 1.3452380952380953) internal successors, (113), 84 states have internal predecessors, (113), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 13:40:23,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 163 transitions. [2024-10-11 13:40:23,471 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 163 transitions. Word has length 185 [2024-10-11 13:40:23,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:40:23,472 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 163 transitions. [2024-10-11 13:40:23,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 13:40:23,472 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 163 transitions. [2024-10-11 13:40:23,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-11 13:40:23,476 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:40:23,476 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:40:23,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:40:23,477 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:40:23,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:40:23,477 INFO L85 PathProgramCache]: Analyzing trace with hash -724607923, now seen corresponding path program 1 times [2024-10-11 13:40:23,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:40:23,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393076485] [2024-10-11 13:40:23,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:40:23,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:40:23,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:40:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:40:23,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:40:23,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:40:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:40:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:40:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:40:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:40:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:40:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:40:23,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:40:23,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:40:23,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:40:23,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:40:23,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:40:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:40:23,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:40:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:40:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:40:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:40:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 13:40:23,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:40:23,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 13:40:23,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 13:40:23,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 13:40:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:23,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 13:40:23,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:40:23,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393076485] [2024-10-11 13:40:23,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393076485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:40:23,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:40:23,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:40:23,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876495724] [2024-10-11 13:40:23,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:40:23,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:40:23,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:40:23,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:40:23,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:40:23,980 INFO L87 Difference]: Start difference. First operand 111 states and 163 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 13:40:24,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:40:24,037 INFO L93 Difference]: Finished difference Result 224 states and 329 transitions. [2024-10-11 13:40:24,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:40:24,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 185 [2024-10-11 13:40:24,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:40:24,040 INFO L225 Difference]: With dead ends: 224 [2024-10-11 13:40:24,040 INFO L226 Difference]: Without dead ends: 114 [2024-10-11 13:40:24,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:40:24,044 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 1 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:40:24,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 461 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:40:24,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-11 13:40:24,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-10-11 13:40:24,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 13:40:24,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 165 transitions. [2024-10-11 13:40:24,058 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 165 transitions. Word has length 185 [2024-10-11 13:40:24,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:40:24,061 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 165 transitions. [2024-10-11 13:40:24,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 13:40:24,062 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 165 transitions. [2024-10-11 13:40:24,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-11 13:40:24,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:40:24,064 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:40:24,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:40:24,064 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:40:24,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:40:24,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1533954549, now seen corresponding path program 1 times [2024-10-11 13:40:24,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:40:24,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229425746] [2024-10-11 13:40:24,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:40:24,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:40:24,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:40:24,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:40:24,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:40:24,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:40:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:40:24,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:40:24,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:40:24,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:40:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:40:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:40:24,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:40:24,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:40:24,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:40:24,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:40:24,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:40:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:40:24,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:40:24,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:40:24,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:40:24,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:40:24,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 13:40:24,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:40:24,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 13:40:24,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 13:40:24,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 13:40:24,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 13:40:24,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:40:24,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229425746] [2024-10-11 13:40:24,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229425746] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:40:24,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:40:24,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:40:24,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965749996] [2024-10-11 13:40:24,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:40:24,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:40:24,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:40:24,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:40:24,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:40:24,366 INFO L87 Difference]: Start difference. First operand 113 states and 165 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 13:40:24,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:40:24,413 INFO L93 Difference]: Finished difference Result 228 states and 333 transitions. [2024-10-11 13:40:24,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:40:24,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 185 [2024-10-11 13:40:24,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:40:24,416 INFO L225 Difference]: With dead ends: 228 [2024-10-11 13:40:24,419 INFO L226 Difference]: Without dead ends: 116 [2024-10-11 13:40:24,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:40:24,420 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:40:24,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 465 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:40:24,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-11 13:40:24,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2024-10-11 13:40:24,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 88 states have internal predecessors, (117), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 13:40:24,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 167 transitions. [2024-10-11 13:40:24,435 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 167 transitions. Word has length 185 [2024-10-11 13:40:24,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:40:24,436 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 167 transitions. [2024-10-11 13:40:24,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 13:40:24,436 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 167 transitions. [2024-10-11 13:40:24,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-11 13:40:24,438 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:40:24,438 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:40:24,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 13:40:24,438 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:40:24,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:40:24,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1533894967, now seen corresponding path program 1 times [2024-10-11 13:40:24,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:40:24,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257336021] [2024-10-11 13:40:24,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:40:24,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:40:24,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:40:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:40:24,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:40:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:40:24,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:40:24,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:40:24,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:40:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:40:24,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:40:24,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:40:24,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:40:24,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:40:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:40:24,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:40:24,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:40:24,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:40:24,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:40:24,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:40:24,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:40:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:40:24,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 13:40:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:40:24,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 13:40:24,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 13:40:24,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 13:40:24,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:24,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 13:40:24,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:40:24,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257336021] [2024-10-11 13:40:24,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257336021] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:40:24,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:40:24,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:40:24,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426454720] [2024-10-11 13:40:24,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:40:24,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:40:24,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:40:24,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:40:24,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:40:24,926 INFO L87 Difference]: Start difference. First operand 115 states and 167 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 13:40:25,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:40:25,028 INFO L93 Difference]: Finished difference Result 293 states and 423 transitions. [2024-10-11 13:40:25,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:40:25,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 185 [2024-10-11 13:40:25,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:40:25,032 INFO L225 Difference]: With dead ends: 293 [2024-10-11 13:40:25,034 INFO L226 Difference]: Without dead ends: 179 [2024-10-11 13:40:25,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:40:25,036 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 84 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:40:25,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 587 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:40:25,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-10-11 13:40:25,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2024-10-11 13:40:25,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 144 states have (on average 1.3611111111111112) internal successors, (196), 145 states have internal predecessors, (196), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 13:40:25,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 254 transitions. [2024-10-11 13:40:25,061 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 254 transitions. Word has length 185 [2024-10-11 13:40:25,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:40:25,061 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 254 transitions. [2024-10-11 13:40:25,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 13:40:25,062 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 254 transitions. [2024-10-11 13:40:25,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-11 13:40:25,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:40:25,065 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:40:25,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 13:40:25,066 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:40:25,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:40:25,067 INFO L85 PathProgramCache]: Analyzing trace with hash -2043368057, now seen corresponding path program 1 times [2024-10-11 13:40:25,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:40:25,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762647669] [2024-10-11 13:40:25,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:40:25,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:40:25,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:26,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:40:26,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:26,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:40:26,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:26,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:40:26,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:26,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:40:26,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:26,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:40:26,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:26,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:40:26,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:26,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:40:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:26,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:40:26,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:26,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:40:26,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:26,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:40:26,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:26,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:40:26,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:26,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:40:26,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:26,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:40:26,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:26,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:40:26,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:26,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:40:26,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:26,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:40:26,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:26,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:40:26,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:26,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:40:26,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:26,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:40:26,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:26,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:40:26,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:26,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 13:40:26,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:26,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:40:26,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:26,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 13:40:26,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:26,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 13:40:26,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:26,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 13:40:26,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:26,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 13:40:26,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:40:26,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762647669] [2024-10-11 13:40:26,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762647669] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:40:26,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:40:26,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 13:40:26,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67162525] [2024-10-11 13:40:26,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:40:26,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 13:40:26,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:40:26,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 13:40:26,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:40:26,257 INFO L87 Difference]: Start difference. First operand 176 states and 254 transitions. Second operand has 10 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 4 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 4 states have call successors, (25) [2024-10-11 13:40:26,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:40:26,651 INFO L93 Difference]: Finished difference Result 457 states and 654 transitions. [2024-10-11 13:40:26,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:40:26,652 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 4 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 4 states have call successors, (25) Word has length 185 [2024-10-11 13:40:26,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:40:26,655 INFO L225 Difference]: With dead ends: 457 [2024-10-11 13:40:26,657 INFO L226 Difference]: Without dead ends: 282 [2024-10-11 13:40:26,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-10-11 13:40:26,660 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 279 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:40:26,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 846 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:40:26,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-10-11 13:40:26,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 278. [2024-10-11 13:40:26,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 240 states have (on average 1.375) internal successors, (330), 243 states have internal predecessors, (330), 33 states have call successors, (33), 4 states have call predecessors, (33), 4 states have return successors, (33), 30 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-11 13:40:26,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 396 transitions. [2024-10-11 13:40:26,705 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 396 transitions. Word has length 185 [2024-10-11 13:40:26,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:40:26,705 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 396 transitions. [2024-10-11 13:40:26,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 4 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 4 states have call successors, (25) [2024-10-11 13:40:26,706 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 396 transitions. [2024-10-11 13:40:26,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-11 13:40:26,707 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:40:26,707 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:40:26,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 13:40:26,707 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:40:26,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:40:26,708 INFO L85 PathProgramCache]: Analyzing trace with hash 663251337, now seen corresponding path program 1 times [2024-10-11 13:40:26,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:40:26,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928632672] [2024-10-11 13:40:26,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:40:26,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:40:26,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:27,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:40:27,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:27,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:40:27,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:27,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:40:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:27,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:40:27,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:27,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:40:27,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:27,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:40:27,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:27,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:40:27,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:27,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:40:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:27,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:40:27,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:27,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:40:27,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:27,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:40:27,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:27,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:40:27,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:27,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:40:27,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:27,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:40:27,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:27,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:40:27,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:27,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:40:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:27,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:40:27,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:27,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:40:27,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:27,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:40:27,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:27,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:40:27,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:27,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 13:40:27,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:27,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:40:27,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:27,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 13:40:27,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:27,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 13:40:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:27,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 13:40:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:27,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 12 proven. 60 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-11 13:40:27,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:40:27,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928632672] [2024-10-11 13:40:27,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928632672] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:40:27,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749980507] [2024-10-11 13:40:27,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:40:27,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:40:27,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:40:27,377 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:40:27,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 13:40:27,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:27,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-11 13:40:27,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:40:27,788 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 [2024-10-11 13:40:28,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-10-11 13:40:28,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-11 13:40:28,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2024-10-11 13:40:28,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 21 proven. 327 refuted. 0 times theorem prover too weak. 852 trivial. 0 not checked. [2024-10-11 13:40:28,363 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:40:28,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-10-11 13:40:28,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2024-10-11 13:40:28,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 9 proven. 63 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-11 13:40:28,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749980507] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:40:28,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 13:40:28,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 14] total 27 [2024-10-11 13:40:28,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430550642] [2024-10-11 13:40:28,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 13:40:28,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-11 13:40:28,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:40:28,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-11 13:40:28,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=622, Unknown=0, NotChecked=0, Total=702 [2024-10-11 13:40:28,845 INFO L87 Difference]: Start difference. First operand 278 states and 396 transitions. Second operand has 27 states, 23 states have (on average 6.130434782608695) internal successors, (141), 26 states have internal predecessors, (141), 9 states have call successors, (75), 3 states have call predecessors, (75), 5 states have return successors, (75), 6 states have call predecessors, (75), 9 states have call successors, (75) [2024-10-11 13:40:30,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:40:30,906 INFO L93 Difference]: Finished difference Result 544 states and 755 transitions. [2024-10-11 13:40:30,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-10-11 13:40:30,906 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 6.130434782608695) internal successors, (141), 26 states have internal predecessors, (141), 9 states have call successors, (75), 3 states have call predecessors, (75), 5 states have return successors, (75), 6 states have call predecessors, (75), 9 states have call successors, (75) Word has length 185 [2024-10-11 13:40:30,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:40:30,908 INFO L225 Difference]: With dead ends: 544 [2024-10-11 13:40:30,908 INFO L226 Difference]: Without dead ends: 267 [2024-10-11 13:40:30,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 405 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=697, Invalid=3725, Unknown=0, NotChecked=0, Total=4422 [2024-10-11 13:40:30,911 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 759 mSDsluCounter, 1912 mSDsCounter, 0 mSdLazyCounter, 1430 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 2088 SdHoareTripleChecker+Invalid, 1624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 1430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 13:40:30,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 2088 Invalid, 1624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 1430 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 13:40:30,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-10-11 13:40:30,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 180. [2024-10-11 13:40:30,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 148 states have (on average 1.3445945945945945) internal successors, (199), 149 states have internal predecessors, (199), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 13:40:30,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 253 transitions. [2024-10-11 13:40:30,930 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 253 transitions. Word has length 185 [2024-10-11 13:40:30,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:40:30,930 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 253 transitions. [2024-10-11 13:40:30,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 6.130434782608695) internal successors, (141), 26 states have internal predecessors, (141), 9 states have call successors, (75), 3 states have call predecessors, (75), 5 states have return successors, (75), 6 states have call predecessors, (75), 9 states have call successors, (75) [2024-10-11 13:40:30,931 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 253 transitions. [2024-10-11 13:40:30,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-11 13:40:30,932 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:40:30,932 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:40:30,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 13:40:31,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:40:31,136 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:40:31,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:40:31,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1939604976, now seen corresponding path program 1 times [2024-10-11 13:40:31,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:40:31,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154673227] [2024-10-11 13:40:31,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:40:31,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:40:31,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:40:31,263 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 13:40:31,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:40:31,487 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 13:40:31,487 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 13:40:31,488 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:40:31,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 13:40:31,492 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:40:31,703 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 13:40:31,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:40:31 BoogieIcfgContainer [2024-10-11 13:40:31,707 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 13:40:31,707 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 13:40:31,707 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 13:40:31,708 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 13:40:31,708 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:40:22" (3/4) ... [2024-10-11 13:40:31,709 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 13:40:31,710 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 13:40:31,711 INFO L158 Benchmark]: Toolchain (without parser) took 10696.71ms. Allocated memory was 134.2MB in the beginning and 390.1MB in the end (delta: 255.9MB). Free memory was 96.8MB in the beginning and 140.5MB in the end (delta: -43.7MB). Peak memory consumption was 212.7MB. Max. memory is 16.1GB. [2024-10-11 13:40:31,711 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 100.7MB. Free memory is still 56.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:40:31,711 INFO L158 Benchmark]: CACSL2BoogieTranslator took 313.40ms. Allocated memory is still 134.2MB. Free memory was 96.4MB in the beginning and 80.4MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 13:40:31,712 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.00ms. Allocated memory is still 134.2MB. Free memory was 80.0MB in the beginning and 75.9MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:40:31,712 INFO L158 Benchmark]: Boogie Preprocessor took 100.92ms. Allocated memory is still 134.2MB. Free memory was 75.9MB in the beginning and 67.9MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 13:40:31,712 INFO L158 Benchmark]: RCFGBuilder took 977.78ms. Allocated memory is still 134.2MB. Free memory was 67.9MB in the beginning and 72.3MB in the end (delta: -4.5MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-10-11 13:40:31,713 INFO L158 Benchmark]: TraceAbstraction took 9226.99ms. Allocated memory was 134.2MB in the beginning and 390.1MB in the end (delta: 255.9MB). Free memory was 71.8MB in the beginning and 140.5MB in the end (delta: -68.7MB). Peak memory consumption was 188.8MB. Max. memory is 16.1GB. [2024-10-11 13:40:31,713 INFO L158 Benchmark]: Witness Printer took 3.17ms. Allocated memory is still 390.1MB. Free memory is still 140.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:40:31,715 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.14ms. Allocated memory is still 100.7MB. Free memory is still 56.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 313.40ms. Allocated memory is still 134.2MB. Free memory was 96.4MB in the beginning and 80.4MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.00ms. Allocated memory is still 134.2MB. Free memory was 80.0MB in the beginning and 75.9MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 100.92ms. Allocated memory is still 134.2MB. Free memory was 75.9MB in the beginning and 67.9MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 977.78ms. Allocated memory is still 134.2MB. Free memory was 67.9MB in the beginning and 72.3MB in the end (delta: -4.5MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 9226.99ms. Allocated memory was 134.2MB in the beginning and 390.1MB in the end (delta: 255.9MB). Free memory was 71.8MB in the beginning and 140.5MB in the end (delta: -68.7MB). Peak memory consumption was 188.8MB. Max. memory is 16.1GB. * Witness Printer took 3.17ms. Allocated memory is still 390.1MB. Free memory is still 140.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 133, overapproximation of someBinaryDOUBLEComparisonOperation at line 86. 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 = 8; [L30] unsigned char var_1_7 = 8; [L31] unsigned char* var_1_7_Pointer = &(var_1_7); [L32] unsigned char var_1_9 = 128; [L32] unsigned char var_1_9 = 128; [L33] unsigned char* var_1_9_Pointer = &(var_1_9); [L34] unsigned char var_1_10 = 64; [L34] unsigned char var_1_10 = 64; [L35] unsigned char* var_1_10_Pointer = &(var_1_10); [L36] unsigned char var_1_11 = 100; [L36] unsigned char var_1_11 = 100; [L37] unsigned char* var_1_11_Pointer = &(var_1_11); [L38] unsigned char var_1_12 = 5; [L38] unsigned char var_1_12 = 5; [L39] unsigned char* var_1_12_Pointer = &(var_1_12); [L40] unsigned char var_1_13 = 100; [L40] unsigned char var_1_13 = 100; [L41] unsigned char* var_1_13_Pointer = &(var_1_13); [L42] unsigned char var_1_14 = 32; [L42] unsigned char var_1_14 = 32; [L43] unsigned char* var_1_14_Pointer = &(var_1_14); [L44] unsigned char var_1_15 = 64; [L44] unsigned char var_1_15 = 64; [L45] unsigned char* var_1_15_Pointer = &(var_1_15); [L46] unsigned char var_1_16 = 50; [L46] unsigned char var_1_16 = 50; [L47] unsigned char* var_1_16_Pointer = &(var_1_16); [L48] unsigned char var_1_17 = 8; [L48] unsigned char var_1_17 = 8; [L49] unsigned char* var_1_17_Pointer = &(var_1_17); [L50] unsigned char var_1_18 = 0; [L50] unsigned char var_1_18 = 0; [L51] unsigned char* var_1_18_Pointer = &(var_1_18); [L52] signed char var_1_19 = 0; [L52] signed char var_1_19 = 0; [L53] signed char* var_1_19_Pointer = &(var_1_19); [L54] float var_1_20 = 255.5; [L54] float var_1_20 = 255.5; [L55] float* var_1_20_Pointer = &(var_1_20); [L56] float var_1_21 = 255.5; [L56] float var_1_21 = 255.5; [L57] float* var_1_21_Pointer = &(var_1_21); [L58] unsigned short int var_1_22 = 64; [L58] unsigned short int var_1_22 = 64; [L59] unsigned short int* var_1_22_Pointer = &(var_1_22); [L60] double var_1_23 = 32.5; [L60] double var_1_23 = 32.5; [L61] double* var_1_23_Pointer = &(var_1_23); [L137] isInitial = 1 [L138] FCALL initially() [L139] COND TRUE 1 [L140] FCALL updateLastVariables() [L141] CALL updateVariables() [L91] var_1_4 = __VERIFIER_nondet_uchar() [L92] EXPR \read(var_1_4) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L92] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L92] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L93] EXPR \read(var_1_4) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L93] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L93] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L94] var_1_5 = __VERIFIER_nondet_uchar() [L95] EXPR \read(var_1_5) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L95] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L95] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L96] EXPR \read(var_1_5) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L96] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L96] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L97] var_1_6 = __VERIFIER_nondet_uchar() [L98] EXPR \read(var_1_6) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L98] CALL assume_abort_if_not(var_1_6 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L98] RET assume_abort_if_not(var_1_6 >= 1) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L99] EXPR \read(var_1_6) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L99] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L99] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L100] var_1_9 = __VERIFIER_nondet_uchar() [L101] EXPR \read(var_1_9) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L101] CALL assume_abort_if_not(var_1_9 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L101] RET assume_abort_if_not(var_1_9 >= 127) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L102] EXPR \read(var_1_9) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L102] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L102] RET assume_abort_if_not(var_1_9 <= 254) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L103] var_1_10 = __VERIFIER_nondet_uchar() [L104] EXPR \read(var_1_10) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L104] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L104] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L105] EXPR \read(var_1_10) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L105] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L105] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L106] var_1_12 = __VERIFIER_nondet_uchar() [L107] EXPR \read(var_1_12) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L107] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L107] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L108] EXPR \read(var_1_12) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L108] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L108] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L109] var_1_13 = __VERIFIER_nondet_uchar() [L110] EXPR \read(var_1_13) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L110] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L110] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L111] EXPR \read(var_1_13) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L111] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L111] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L112] var_1_14 = __VERIFIER_nondet_uchar() [L113] EXPR \read(var_1_14) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L113] CALL assume_abort_if_not(var_1_14 >= 32) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L113] RET assume_abort_if_not(var_1_14 >= 32) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L114] EXPR \read(var_1_14) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L114] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L114] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L115] var_1_15 = __VERIFIER_nondet_uchar() [L116] EXPR \read(var_1_15) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L116] CALL assume_abort_if_not(var_1_15 >= 32) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L116] RET assume_abort_if_not(var_1_15 >= 32) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L117] EXPR \read(var_1_15) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L117] CALL assume_abort_if_not(var_1_15 <= 64) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L117] RET assume_abort_if_not(var_1_15 <= 64) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L118] var_1_16 = __VERIFIER_nondet_uchar() [L119] EXPR \read(var_1_16) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L119] CALL assume_abort_if_not(var_1_16 >= 32) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L119] RET assume_abort_if_not(var_1_16 >= 32) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L120] EXPR \read(var_1_16) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L120] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L120] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L121] var_1_17 = __VERIFIER_nondet_uchar() [L122] EXPR \read(var_1_17) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L122] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L122] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L123] EXPR \read(var_1_17) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L123] CALL assume_abort_if_not(var_1_17 <= 64) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L123] RET assume_abort_if_not(var_1_17 <= 64) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L124] var_1_18 = __VERIFIER_nondet_uchar() [L125] EXPR \read(var_1_18) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L125] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L125] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L126] EXPR \read(var_1_18) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L126] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L126] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L127] var_1_21 = __VERIFIER_nondet_float() [L128] EXPR \read(var_1_21) [L128] EXPR var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L128] EXPR var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F [L128] EXPR \read(var_1_21) [L128] EXPR var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L128] EXPR (var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L128] EXPR (var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L128] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L128] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L141] RET updateVariables() [L142] CALL step() [L65] EXPR \read(*var_1_6_Pointer) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L65] COND TRUE (*(var_1_6_Pointer)) [L66] EXPR \read(*var_1_10_Pointer) [L66] EXPR \read(*var_1_12_Pointer) [L66] EXPR \read(*var_1_13_Pointer) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L66] EXPR (((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))) [L66] EXPR \read(*var_1_12_Pointer) [L66] EXPR (((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L66] (*(var_1_11_Pointer)) = ((*(var_1_10_Pointer)) + (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer)))))) [L70] EXPR \read(*var_1_6_Pointer) [L70] EXPR (*(var_1_6_Pointer)) || (*(var_1_4_Pointer)) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L70] EXPR (*(var_1_6_Pointer)) || (*(var_1_4_Pointer)) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L70] unsigned char stepLocal_0 = (*(var_1_6_Pointer)) || (*(var_1_4_Pointer)); [L71] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L71] COND TRUE (*(var_1_5_Pointer)) || stepLocal_0 [L72] EXPR \read(*var_1_15_Pointer) [L72] (*(var_1_19_Pointer)) = (*(var_1_15_Pointer)) [L74] EXPR \read(*var_1_21_Pointer) [L74] (*(var_1_20_Pointer)) = (*(var_1_21_Pointer)) [L75] EXPR \read(*var_1_18_Pointer) [L75] (*(var_1_22_Pointer)) = (*(var_1_18_Pointer)) [L76] (*(var_1_23_Pointer)) = 0.010000000000000009 [L77] EXPR \read(*var_1_20_Pointer) [L77] EXPR \read(*var_1_20_Pointer) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L77] COND FALSE !((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) [L80] EXPR \read(*var_1_20_Pointer) [L80] EXPR \read(*var_1_20_Pointer) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L80] COND TRUE (*(var_1_20_Pointer)) >= (*(var_1_20_Pointer)) [L81] EXPR \read(*var_1_5_Pointer) [L81] (*(var_1_1_Pointer)) = (*(var_1_5_Pointer)) [L86] EXPR \read(*var_1_23_Pointer) [L86] EXPR \read(*var_1_20_Pointer) [L86] EXPR \read(*var_1_20_Pointer) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L86] EXPR (((*(var_1_20_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_20_Pointer))) : ((*(var_1_20_Pointer))) [L86] EXPR \read(*var_1_20_Pointer) [L86] EXPR (((*(var_1_20_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_20_Pointer))) : ((*(var_1_20_Pointer))) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L86] COND TRUE (*(var_1_23_Pointer)) < (((((*(var_1_20_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_20_Pointer))) : ((*(var_1_20_Pointer))))) [L87] EXPR \read(*var_1_9_Pointer) [L87] EXPR \read(*var_1_10_Pointer) [L87] (*(var_1_7_Pointer)) = ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))) [L142] RET step() [L143] CALL, EXPR property() [L133] EXPR \read(*var_1_20_Pointer) [L133] EXPR \read(*var_1_20_Pointer) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L133] EXPR ((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) [L133] EXPR \read(*var_1_20_Pointer) [L133] EXPR \read(*var_1_20_Pointer) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L133] EXPR ((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) [L133] EXPR \read(*var_1_1_Pointer) [L133] EXPR \read(*var_1_6_Pointer) [L133] EXPR ((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L133] EXPR ((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L133] EXPR (((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))))) && (((*(var_1_23_Pointer)) < (((((*(var_1_20_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_20_Pointer))) : ((*(var_1_20_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : 1) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L133] EXPR (((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))))) && (((*(var_1_23_Pointer)) < (((((*(var_1_20_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_20_Pointer))) : ((*(var_1_20_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : 1) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L133] EXPR ((((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))))) && (((*(var_1_23_Pointer)) < (((((*(var_1_20_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_20_Pointer))) : ((*(var_1_20_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : 1)) && ((*(var_1_6_Pointer)) ? ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_10_Pointer)) + (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((unsigned char) (((64 + (*(var_1_14_Pointer))) + ((*(var_1_15_Pointer)) + (*(var_1_16_Pointer)))) - ((*(var_1_17_Pointer)) + (*(var_1_18_Pointer))))))) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L133] EXPR ((((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))))) && (((*(var_1_23_Pointer)) < (((((*(var_1_20_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_20_Pointer))) : ((*(var_1_20_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : 1)) && ((*(var_1_6_Pointer)) ? ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_10_Pointer)) + (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((unsigned char) (((64 + (*(var_1_14_Pointer))) + ((*(var_1_15_Pointer)) + (*(var_1_16_Pointer)))) - ((*(var_1_17_Pointer)) + (*(var_1_18_Pointer))))))) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L133] EXPR (((((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))))) && (((*(var_1_23_Pointer)) < (((((*(var_1_20_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_20_Pointer))) : ((*(var_1_20_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : 1)) && ((*(var_1_6_Pointer)) ? ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_10_Pointer)) + (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((unsigned char) (((64 + (*(var_1_14_Pointer))) + ((*(var_1_15_Pointer)) + (*(var_1_16_Pointer)))) - ((*(var_1_17_Pointer)) + (*(var_1_18_Pointer)))))))) && (((*(var_1_5_Pointer)) || ((*(var_1_6_Pointer)) || (*(var_1_4_Pointer)))) ? ((*(var_1_19_Pointer)) == ((signed char) (*(var_1_15_Pointer)))) : 1) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L133] EXPR (((((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))))) && (((*(var_1_23_Pointer)) < (((((*(var_1_20_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_20_Pointer))) : ((*(var_1_20_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : 1)) && ((*(var_1_6_Pointer)) ? ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_10_Pointer)) + (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((unsigned char) (((64 + (*(var_1_14_Pointer))) + ((*(var_1_15_Pointer)) + (*(var_1_16_Pointer)))) - ((*(var_1_17_Pointer)) + (*(var_1_18_Pointer)))))))) && (((*(var_1_5_Pointer)) || ((*(var_1_6_Pointer)) || (*(var_1_4_Pointer)))) ? ((*(var_1_19_Pointer)) == ((signed char) (*(var_1_15_Pointer)))) : 1) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L133] EXPR ((((((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))))) && (((*(var_1_23_Pointer)) < (((((*(var_1_20_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_20_Pointer))) : ((*(var_1_20_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : 1)) && ((*(var_1_6_Pointer)) ? ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_10_Pointer)) + (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((unsigned char) (((64 + (*(var_1_14_Pointer))) + ((*(var_1_15_Pointer)) + (*(var_1_16_Pointer)))) - ((*(var_1_17_Pointer)) + (*(var_1_18_Pointer)))))))) && (((*(var_1_5_Pointer)) || ((*(var_1_6_Pointer)) || (*(var_1_4_Pointer)))) ? ((*(var_1_19_Pointer)) == ((signed char) (*(var_1_15_Pointer)))) : 1)) && ((*(var_1_20_Pointer)) == ((float) (*(var_1_21_Pointer)))) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L133] EXPR ((((((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))))) && (((*(var_1_23_Pointer)) < (((((*(var_1_20_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_20_Pointer))) : ((*(var_1_20_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : 1)) && ((*(var_1_6_Pointer)) ? ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_10_Pointer)) + (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((unsigned char) (((64 + (*(var_1_14_Pointer))) + ((*(var_1_15_Pointer)) + (*(var_1_16_Pointer)))) - ((*(var_1_17_Pointer)) + (*(var_1_18_Pointer)))))))) && (((*(var_1_5_Pointer)) || ((*(var_1_6_Pointer)) || (*(var_1_4_Pointer)))) ? ((*(var_1_19_Pointer)) == ((signed char) (*(var_1_15_Pointer)))) : 1)) && ((*(var_1_20_Pointer)) == ((float) (*(var_1_21_Pointer)))) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L133] EXPR (((((((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))))) && (((*(var_1_23_Pointer)) < (((((*(var_1_20_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_20_Pointer))) : ((*(var_1_20_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : 1)) && ((*(var_1_6_Pointer)) ? ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_10_Pointer)) + (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((unsigned char) (((64 + (*(var_1_14_Pointer))) + ((*(var_1_15_Pointer)) + (*(var_1_16_Pointer)))) - ((*(var_1_17_Pointer)) + (*(var_1_18_Pointer)))))))) && (((*(var_1_5_Pointer)) || ((*(var_1_6_Pointer)) || (*(var_1_4_Pointer)))) ? ((*(var_1_19_Pointer)) == ((signed char) (*(var_1_15_Pointer)))) : 1)) && ((*(var_1_20_Pointer)) == ((float) (*(var_1_21_Pointer))))) && ((*(var_1_22_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer)))) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L133] EXPR (((((((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))))) && (((*(var_1_23_Pointer)) < (((((*(var_1_20_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_20_Pointer))) : ((*(var_1_20_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : 1)) && ((*(var_1_6_Pointer)) ? ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_10_Pointer)) + (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((unsigned char) (((64 + (*(var_1_14_Pointer))) + ((*(var_1_15_Pointer)) + (*(var_1_16_Pointer)))) - ((*(var_1_17_Pointer)) + (*(var_1_18_Pointer)))))))) && (((*(var_1_5_Pointer)) || ((*(var_1_6_Pointer)) || (*(var_1_4_Pointer)))) ? ((*(var_1_19_Pointer)) == ((signed char) (*(var_1_15_Pointer)))) : 1)) && ((*(var_1_20_Pointer)) == ((float) (*(var_1_21_Pointer))))) && ((*(var_1_22_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer)))) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L133] EXPR ((((((((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))))) && (((*(var_1_23_Pointer)) < (((((*(var_1_20_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_20_Pointer))) : ((*(var_1_20_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : 1)) && ((*(var_1_6_Pointer)) ? ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_10_Pointer)) + (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((unsigned char) (((64 + (*(var_1_14_Pointer))) + ((*(var_1_15_Pointer)) + (*(var_1_16_Pointer)))) - ((*(var_1_17_Pointer)) + (*(var_1_18_Pointer)))))))) && (((*(var_1_5_Pointer)) || ((*(var_1_6_Pointer)) || (*(var_1_4_Pointer)))) ? ((*(var_1_19_Pointer)) == ((signed char) (*(var_1_15_Pointer)))) : 1)) && ((*(var_1_20_Pointer)) == ((float) (*(var_1_21_Pointer))))) && ((*(var_1_22_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer))))) && ((*(var_1_23_Pointer)) == ((double) 0.010000000000000009)) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L133] EXPR ((((((((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))))) && (((*(var_1_23_Pointer)) < (((((*(var_1_20_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_20_Pointer))) : ((*(var_1_20_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : 1)) && ((*(var_1_6_Pointer)) ? ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_10_Pointer)) + (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((unsigned char) (((64 + (*(var_1_14_Pointer))) + ((*(var_1_15_Pointer)) + (*(var_1_16_Pointer)))) - ((*(var_1_17_Pointer)) + (*(var_1_18_Pointer)))))))) && (((*(var_1_5_Pointer)) || ((*(var_1_6_Pointer)) || (*(var_1_4_Pointer)))) ? ((*(var_1_19_Pointer)) == ((signed char) (*(var_1_15_Pointer)))) : 1)) && ((*(var_1_20_Pointer)) == ((float) (*(var_1_21_Pointer))))) && ((*(var_1_22_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer))))) && ((*(var_1_23_Pointer)) == ((double) 0.010000000000000009)) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L133-L134] return ((((((((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))))) && (((*(var_1_23_Pointer)) < (((((*(var_1_20_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_20_Pointer))) : ((*(var_1_20_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : 1)) && ((*(var_1_6_Pointer)) ? ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_10_Pointer)) + (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((unsigned char) (((64 + (*(var_1_14_Pointer))) + ((*(var_1_15_Pointer)) + (*(var_1_16_Pointer)))) - ((*(var_1_17_Pointer)) + (*(var_1_18_Pointer)))))))) && (((*(var_1_5_Pointer)) || ((*(var_1_6_Pointer)) || (*(var_1_4_Pointer)))) ? ((*(var_1_19_Pointer)) == ((signed char) (*(var_1_15_Pointer)))) : 1)) && ((*(var_1_20_Pointer)) == ((float) (*(var_1_21_Pointer))))) && ((*(var_1_22_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer))))) && ((*(var_1_23_Pointer)) == ((double) 0.010000000000000009)) ; [L143] RET, EXPR property() [L143] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] [L19] reach_error() VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23: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_9={9:0}, var_1_9_Pointer={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 113 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.9s, OverallIterations: 7, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1124 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1124 mSDsluCounter, 4606 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3665 mSDsCounter, 206 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1834 IncrementalHoareTripleChecker+Invalid, 2040 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 206 mSolverCounterUnsat, 941 mSDtfsCounter, 1834 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 782 GetRequests, 693 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 854 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=278occurred in iteration=5, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 96 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 1482 NumberOfCodeBlocks, 1482 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1472 ConstructedInterpolants, 0 QuantifiedInterpolants, 4961 SizeOfPredicates, 17 NumberOfNonLiveVariables, 818 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 9150/9600 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 13:40:31,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-61.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 952f1621c7899c5ce964b8bd35a2296981cb24cd167b0d1d0e9f7406c8d49f3b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:40:33,909 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:40:33,976 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 13:40:33,980 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:40:33,980 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:40:34,003 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:40:34,006 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:40:34,006 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:40:34,007 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:40:34,010 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:40:34,010 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:40:34,010 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:40:34,011 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:40:34,011 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:40:34,011 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:40:34,011 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:40:34,011 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:40:34,012 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:40:34,012 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:40:34,012 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:40:34,012 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:40:34,013 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:40:34,014 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:40:34,014 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 13:40:34,014 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 13:40:34,014 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:40:34,014 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 13:40:34,014 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:40:34,014 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:40:34,014 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:40:34,015 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:40:34,015 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:40:34,015 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:40:34,015 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:40:34,015 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:40:34,015 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:40:34,016 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:40:34,016 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:40:34,016 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 13:40:34,016 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 13:40:34,016 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:40:34,018 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:40:34,018 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:40:34,018 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:40:34,018 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 13:40:34,018 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-clean/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 -> 952f1621c7899c5ce964b8bd35a2296981cb24cd167b0d1d0e9f7406c8d49f3b [2024-10-11 13:40:34,391 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:40:34,415 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:40:34,417 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:40:34,418 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:40:34,419 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:40:34,421 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-61.i [2024-10-11 13:40:35,913 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:40:36,098 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:40:36,099 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-61.i [2024-10-11 13:40:36,127 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0a0cff406/f7a23022fa4d415dba209d84ce54ba42/FLAGbf50a2432 [2024-10-11 13:40:36,141 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0a0cff406/f7a23022fa4d415dba209d84ce54ba42 [2024-10-11 13:40:36,143 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:40:36,144 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:40:36,145 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:40:36,149 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:40:36,154 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:40:36,158 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:40:36" (1/1) ... [2024-10-11 13:40:36,159 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3af6c135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:40:36, skipping insertion in model container [2024-10-11 13:40:36,159 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:40:36" (1/1) ... [2024-10-11 13:40:36,184 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:40:36,335 WARN L248 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-61.i[916,929] [2024-10-11 13:40:36,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:40:36,410 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:40:36,422 WARN L248 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-61.i[916,929] [2024-10-11 13:40:36,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:40:36,485 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:40:36,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:40:36 WrapperNode [2024-10-11 13:40:36,485 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:40:36,486 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:40:36,486 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:40:36,487 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:40:36,492 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:40:36" (1/1) ... [2024-10-11 13:40:36,512 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:40:36" (1/1) ... [2024-10-11 13:40:36,561 INFO L138 Inliner]: procedures = 36, calls = 203, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 560 [2024-10-11 13:40:36,562 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:40:36,563 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:40:36,564 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:40:36,564 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:40:36,572 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:40:36" (1/1) ... [2024-10-11 13:40:36,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:40:36" (1/1) ... [2024-10-11 13:40:36,580 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:40:36" (1/1) ... [2024-10-11 13:40:36,628 INFO L175 MemorySlicer]: Split 147 memory accesses to 21 slices as follows [2, 7, 8, 10, 10, 3, 6, 8, 5, 8, 8, 6, 8, 6, 6, 8, 3, 19, 8, 3, 5]. 13 percent of accesses are in the largest equivalence class. The 22 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 23 writes are split as follows [0, 3, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. [2024-10-11 13:40:36,628 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:40:36" (1/1) ... [2024-10-11 13:40:36,628 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:40:36" (1/1) ... [2024-10-11 13:40:36,662 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:40:36" (1/1) ... [2024-10-11 13:40:36,669 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:40:36" (1/1) ... [2024-10-11 13:40:36,685 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:40:36" (1/1) ... [2024-10-11 13:40:36,692 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:40:36" (1/1) ... [2024-10-11 13:40:36,705 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:40:36,708 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:40:36,708 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:40:36,709 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:40:36,709 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:40:36" (1/1) ... [2024-10-11 13:40:36,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:40:36,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:40:36,737 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:40:36,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:40:36,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:40:36,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-11 13:40:36,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-11 13:40:36,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-10-11 13:40:36,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-10-11 13:40:36,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-10-11 13:40:36,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-10-11 13:40:36,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-10-11 13:40:36,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2024-10-11 13:40:36,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2024-10-11 13:40:36,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2024-10-11 13:40:36,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#10 [2024-10-11 13:40:36,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#11 [2024-10-11 13:40:36,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#12 [2024-10-11 13:40:36,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#13 [2024-10-11 13:40:36,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#14 [2024-10-11 13:40:36,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#15 [2024-10-11 13:40:36,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#16 [2024-10-11 13:40:36,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#17 [2024-10-11 13:40:36,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#18 [2024-10-11 13:40:36,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#19 [2024-10-11 13:40:36,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#20 [2024-10-11 13:40:36,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-11 13:40:36,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-11 13:40:36,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-10-11 13:40:36,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-10-11 13:40:36,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-10-11 13:40:36,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-10-11 13:40:36,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-10-11 13:40:36,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2024-10-11 13:40:36,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2024-10-11 13:40:36,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2024-10-11 13:40:36,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#10 [2024-10-11 13:40:36,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#11 [2024-10-11 13:40:36,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#12 [2024-10-11 13:40:36,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#13 [2024-10-11 13:40:36,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#14 [2024-10-11 13:40:36,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#15 [2024-10-11 13:40:36,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#16 [2024-10-11 13:40:36,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#17 [2024-10-11 13:40:36,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#18 [2024-10-11 13:40:36,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#19 [2024-10-11 13:40:36,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#20 [2024-10-11 13:40:36,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 13:40:36,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 13:40:36,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 13:40:36,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-11 13:40:36,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-11 13:40:36,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-11 13:40:36,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-10-11 13:40:36,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-10-11 13:40:36,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-10-11 13:40:36,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-10-11 13:40:36,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-10-11 13:40:36,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-10-11 13:40:36,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-10-11 13:40:36,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2024-10-11 13:40:36,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2024-10-11 13:40:36,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#15 [2024-10-11 13:40:36,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#16 [2024-10-11 13:40:36,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#17 [2024-10-11 13:40:36,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#18 [2024-10-11 13:40:36,791 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#19 [2024-10-11 13:40:36,791 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#20 [2024-10-11 13:40:36,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-11 13:40:36,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-11 13:40:36,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-11 13:40:36,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-11 13:40:36,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-11 13:40:36,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-10-11 13:40:36,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-10-11 13:40:36,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-10-11 13:40:36,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-10-11 13:40:36,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-10-11 13:40:36,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-10-11 13:40:36,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2024-10-11 13:40:36,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2024-10-11 13:40:36,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2024-10-11 13:40:36,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#14 [2024-10-11 13:40:36,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#15 [2024-10-11 13:40:36,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#16 [2024-10-11 13:40:36,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#17 [2024-10-11 13:40:36,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#18 [2024-10-11 13:40:36,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#19 [2024-10-11 13:40:36,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#20 [2024-10-11 13:40:36,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 13:40:36,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 13:40:36,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 13:40:36,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-11 13:40:36,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-11 13:40:36,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-11 13:40:36,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-10-11 13:40:36,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-10-11 13:40:36,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-10-11 13:40:36,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-10-11 13:40:36,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-10-11 13:40:36,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-10-11 13:40:36,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-10-11 13:40:36,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2024-10-11 13:40:36,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2024-10-11 13:40:36,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#15 [2024-10-11 13:40:36,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#16 [2024-10-11 13:40:36,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#17 [2024-10-11 13:40:36,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#18 [2024-10-11 13:40:36,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#19 [2024-10-11 13:40:36,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#20 [2024-10-11 13:40:36,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-11 13:40:36,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-11 13:40:36,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-11 13:40:36,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-11 13:40:36,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-11 13:40:36,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-10-11 13:40:36,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-10-11 13:40:36,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-10-11 13:40:36,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2024-10-11 13:40:36,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2024-10-11 13:40:36,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2024-10-11 13:40:36,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2024-10-11 13:40:36,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2024-10-11 13:40:36,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#13 [2024-10-11 13:40:36,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#14 [2024-10-11 13:40:36,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#15 [2024-10-11 13:40:36,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#16 [2024-10-11 13:40:36,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#17 [2024-10-11 13:40:36,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#18 [2024-10-11 13:40:36,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#19 [2024-10-11 13:40:36,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#20 [2024-10-11 13:40:36,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-11 13:40:36,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-11 13:40:36,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-10-11 13:40:36,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-10-11 13:40:36,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-10-11 13:40:36,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-10-11 13:40:36,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-10-11 13:40:36,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2024-10-11 13:40:36,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2024-10-11 13:40:36,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2024-10-11 13:40:36,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#10 [2024-10-11 13:40:36,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#11 [2024-10-11 13:40:36,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#12 [2024-10-11 13:40:36,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#13 [2024-10-11 13:40:36,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#14 [2024-10-11 13:40:36,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#15 [2024-10-11 13:40:36,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#16 [2024-10-11 13:40:36,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#17 [2024-10-11 13:40:36,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#18 [2024-10-11 13:40:36,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#19 [2024-10-11 13:40:36,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#20 [2024-10-11 13:40:36,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-11 13:40:36,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-11 13:40:36,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-11 13:40:36,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-11 13:40:36,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-11 13:40:36,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-10-11 13:40:36,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-10-11 13:40:36,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-10-11 13:40:36,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2024-10-11 13:40:36,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2024-10-11 13:40:36,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2024-10-11 13:40:36,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2024-10-11 13:40:36,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2024-10-11 13:40:36,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#13 [2024-10-11 13:40:36,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#14 [2024-10-11 13:40:36,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#15 [2024-10-11 13:40:36,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#16 [2024-10-11 13:40:36,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#17 [2024-10-11 13:40:36,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#18 [2024-10-11 13:40:36,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#19 [2024-10-11 13:40:36,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#20 [2024-10-11 13:40:36,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-11 13:40:36,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-11 13:40:36,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-11 13:40:36,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-11 13:40:36,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-11 13:40:36,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-10-11 13:40:36,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-10-11 13:40:36,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-10-11 13:40:36,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2024-10-11 13:40:36,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2024-10-11 13:40:36,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2024-10-11 13:40:36,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2024-10-11 13:40:36,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2024-10-11 13:40:36,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#13 [2024-10-11 13:40:36,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#14 [2024-10-11 13:40:36,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#15 [2024-10-11 13:40:36,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#16 [2024-10-11 13:40:36,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#17 [2024-10-11 13:40:36,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#18 [2024-10-11 13:40:36,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#19 [2024-10-11 13:40:36,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#20 [2024-10-11 13:40:36,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-11 13:40:36,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-11 13:40:36,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-11 13:40:36,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-11 13:40:36,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-11 13:40:36,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-10-11 13:40:36,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-10-11 13:40:36,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-10-11 13:40:36,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2024-10-11 13:40:36,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2024-10-11 13:40:36,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2024-10-11 13:40:36,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2024-10-11 13:40:36,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2024-10-11 13:40:36,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#13 [2024-10-11 13:40:36,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#14 [2024-10-11 13:40:36,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#15 [2024-10-11 13:40:36,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#16 [2024-10-11 13:40:36,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#17 [2024-10-11 13:40:36,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#18 [2024-10-11 13:40:36,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#19 [2024-10-11 13:40:36,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#20 [2024-10-11 13:40:36,811 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:40:36,811 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:40:36,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:40:36,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:40:36,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-11 13:40:36,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-11 13:40:36,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-11 13:40:36,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-11 13:40:36,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-11 13:40:36,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-11 13:40:36,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-10-11 13:40:36,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-10-11 13:40:36,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-10-11 13:40:36,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-10-11 13:40:36,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-10-11 13:40:36,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-10-11 13:40:36,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-10-11 13:40:36,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2024-10-11 13:40:36,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2024-10-11 13:40:36,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#15 [2024-10-11 13:40:36,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#16 [2024-10-11 13:40:36,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#17 [2024-10-11 13:40:36,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#18 [2024-10-11 13:40:36,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#19 [2024-10-11 13:40:36,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#20 [2024-10-11 13:40:36,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-11 13:40:36,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-11 13:40:36,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-11 13:40:36,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-11 13:40:36,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-11 13:40:36,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-10-11 13:40:36,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-10-11 13:40:36,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-10-11 13:40:36,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2024-10-11 13:40:36,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2024-10-11 13:40:36,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2024-10-11 13:40:36,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2024-10-11 13:40:36,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2024-10-11 13:40:36,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#13 [2024-10-11 13:40:36,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#14 [2024-10-11 13:40:36,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#15 [2024-10-11 13:40:36,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#16 [2024-10-11 13:40:36,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#17 [2024-10-11 13:40:36,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#18 [2024-10-11 13:40:36,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#19 [2024-10-11 13:40:36,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#20 [2024-10-11 13:40:37,059 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:40:37,061 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:40:37,838 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2024-10-11 13:40:37,838 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:40:37,910 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:40:37,910 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:40:37,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:40:37 BoogieIcfgContainer [2024-10-11 13:40:37,914 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:40:37,916 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:40:37,916 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:40:37,923 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:40:37,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:40:36" (1/3) ... [2024-10-11 13:40:37,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f511a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:40:37, skipping insertion in model container [2024-10-11 13:40:37,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:40:36" (2/3) ... [2024-10-11 13:40:37,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f511a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:40:37, skipping insertion in model container [2024-10-11 13:40:37,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:40:37" (3/3) ... [2024-10-11 13:40:37,925 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-61.i [2024-10-11 13:40:37,955 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:40:37,956 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:40:38,000 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:40:38,005 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;@11951359, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:40:38,005 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:40:38,008 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 85 states have (on average 1.388235294117647) internal successors, (118), 86 states have internal predecessors, (118), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 13:40:38,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-11 13:40:38,019 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:40:38,020 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:40:38,020 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:40:38,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:40:38,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1188613599, now seen corresponding path program 1 times [2024-10-11 13:40:38,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:40:38,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1624646908] [2024-10-11 13:40:38,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:40:38,036 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 [2024-10-11 13:40:38,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:40:38,038 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-10-11 13:40:38,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-10-11 13:40:38,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:38,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 13:40:38,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:40:38,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 428 proven. 0 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2024-10-11 13:40:38,470 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:40:38,471 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:40:38,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1624646908] [2024-10-11 13:40:38,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1624646908] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:40:38,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:40:38,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:40:38,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218095666] [2024-10-11 13:40:38,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:40:38,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:40:38,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:40:38,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:40:38,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:40:38,507 INFO L87 Difference]: Start difference. First operand has 113 states, 85 states have (on average 1.388235294117647) internal successors, (118), 86 states have internal predecessors, (118), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 13:40:38,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:40:38,563 INFO L93 Difference]: Finished difference Result 223 states and 359 transitions. [2024-10-11 13:40:38,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:40:38,567 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 185 [2024-10-11 13:40:38,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:40:38,575 INFO L225 Difference]: With dead ends: 223 [2024-10-11 13:40:38,575 INFO L226 Difference]: Without dead ends: 111 [2024-10-11 13:40:38,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:40:38,583 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:40:38,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:40:38,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-11 13:40:38,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-10-11 13:40:38,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 84 states have (on average 1.3452380952380953) internal successors, (113), 84 states have internal predecessors, (113), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 13:40:38,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 163 transitions. [2024-10-11 13:40:38,635 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 163 transitions. Word has length 185 [2024-10-11 13:40:38,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:40:38,635 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 163 transitions. [2024-10-11 13:40:38,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 13:40:38,636 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 163 transitions. [2024-10-11 13:40:38,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-11 13:40:38,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:40:38,642 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:40:38,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-10-11 13:40:38,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:40:38,844 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:40:38,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:40:38,845 INFO L85 PathProgramCache]: Analyzing trace with hash -724607923, now seen corresponding path program 1 times [2024-10-11 13:40:38,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:40:38,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [418410661] [2024-10-11 13:40:38,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:40:38,847 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 [2024-10-11 13:40:38,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:40:38,850 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-10-11 13:40:38,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-10-11 13:40:39,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:39,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 13:40:39,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:40:40,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-10-11 13:40:40,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 31 proven. 457 refuted. 0 times theorem prover too weak. 712 trivial. 0 not checked. [2024-10-11 13:40:40,060 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:40:40,507 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-11 13:40:40,507 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 30 treesize of output 25 [2024-10-11 13:40:40,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 27 proven. 114 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2024-10-11 13:40:40,556 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:40:40,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [418410661] [2024-10-11 13:40:40,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [418410661] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:40:40,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:40:40,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2024-10-11 13:40:40,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626909899] [2024-10-11 13:40:40,557 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:40:40,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 13:40:40,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:40:40,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 13:40:40,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2024-10-11 13:40:40,560 INFO L87 Difference]: Start difference. First operand 111 states and 163 transitions. Second operand has 21 states, 17 states have (on average 6.294117647058823) internal successors, (107), 19 states have internal predecessors, (107), 7 states have call successors, (50), 4 states have call predecessors, (50), 7 states have return successors, (50), 5 states have call predecessors, (50), 7 states have call successors, (50) [2024-10-11 13:40:41,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:40:41,544 INFO L93 Difference]: Finished difference Result 242 states and 348 transitions. [2024-10-11 13:40:41,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 13:40:41,548 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 6.294117647058823) internal successors, (107), 19 states have internal predecessors, (107), 7 states have call successors, (50), 4 states have call predecessors, (50), 7 states have return successors, (50), 5 states have call predecessors, (50), 7 states have call successors, (50) Word has length 185 [2024-10-11 13:40:41,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:40:41,550 INFO L225 Difference]: With dead ends: 242 [2024-10-11 13:40:41,550 INFO L226 Difference]: Without dead ends: 132 [2024-10-11 13:40:41,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 349 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2024-10-11 13:40:41,552 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 196 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 13:40:41,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 1025 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 13:40:41,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-11 13:40:41,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 127. [2024-10-11 13:40:41,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 94 states have (on average 1.297872340425532) internal successors, (122), 95 states have internal predecessors, (122), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 13:40:41,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 180 transitions. [2024-10-11 13:40:41,585 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 180 transitions. Word has length 185 [2024-10-11 13:40:41,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:40:41,586 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 180 transitions. [2024-10-11 13:40:41,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 6.294117647058823) internal successors, (107), 19 states have internal predecessors, (107), 7 states have call successors, (50), 4 states have call predecessors, (50), 7 states have return successors, (50), 5 states have call predecessors, (50), 7 states have call successors, (50) [2024-10-11 13:40:41,586 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 180 transitions. [2024-10-11 13:40:41,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-11 13:40:41,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:40:41,589 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:40:41,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-10-11 13:40:41,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:40:41,789 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:40:41,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:40:41,790 INFO L85 PathProgramCache]: Analyzing trace with hash 458029970, now seen corresponding path program 1 times [2024-10-11 13:40:41,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:40:41,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1341235626] [2024-10-11 13:40:41,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:40:41,790 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 [2024-10-11 13:40:41,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:40:41,793 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-10-11 13:40:41,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-10-11 13:40:42,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:42,153 INFO L255 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 13:40:42,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:40:42,490 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 [2024-10-11 13:40:42,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 63 treesize of output 47 [2024-10-11 13:40:42,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2024-10-11 13:40:42,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 21 proven. 327 refuted. 0 times theorem prover too weak. 852 trivial. 0 not checked. [2024-10-11 13:40:42,582 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:40:42,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 13:40:42,766 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:40:42,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1341235626] [2024-10-11 13:40:42,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1341235626] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:40:42,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:40:42,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 14 [2024-10-11 13:40:42,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049996940] [2024-10-11 13:40:42,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:40:42,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:40:42,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:40:42,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:40:42,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-10-11 13:40:42,775 INFO L87 Difference]: Start difference. First operand 127 states and 180 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 13:40:43,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:40:43,034 INFO L93 Difference]: Finished difference Result 299 states and 420 transitions. [2024-10-11 13:40:43,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:40:43,034 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 187 [2024-10-11 13:40:43,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:40:43,037 INFO L225 Difference]: With dead ends: 299 [2024-10-11 13:40:43,037 INFO L226 Difference]: Without dead ends: 181 [2024-10-11 13:40:43,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2024-10-11 13:40:43,038 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 63 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:40:43,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 735 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:40:43,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-11 13:40:43,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 178. [2024-10-11 13:40:43,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 141 states have (on average 1.3333333333333333) internal successors, (188), 143 states have internal predecessors, (188), 31 states have call successors, (31), 5 states have call predecessors, (31), 5 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 13:40:43,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 250 transitions. [2024-10-11 13:40:43,053 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 250 transitions. Word has length 187 [2024-10-11 13:40:43,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:40:43,054 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 250 transitions. [2024-10-11 13:40:43,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 13:40:43,054 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 250 transitions. [2024-10-11 13:40:43,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-11 13:40:43,059 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:40:43,059 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:40:43,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-10-11 13:40:43,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:40:43,264 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:40:43,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:40:43,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1130317932, now seen corresponding path program 1 times [2024-10-11 13:40:43,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:40:43,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [347191155] [2024-10-11 13:40:43,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:40:43,265 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 [2024-10-11 13:40:43,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:40:43,272 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-10-11 13:40:43,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-10-11 13:40:43,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:43,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-11 13:40:43,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:40:45,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-10-11 13:40:45,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-11 13:40:45,570 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 50 treesize of output 38 [2024-10-11 13:40:45,576 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 55 treesize of output 39 [2024-10-11 13:40:45,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 23 proven. 481 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2024-10-11 13:40:45,763 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:40:46,373 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:40:46,376 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 39 treesize of output 38 [2024-10-11 13:40:46,740 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:40:46,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [347191155] [2024-10-11 13:40:46,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [347191155] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:40:46,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [788777176] [2024-10-11 13:40:46,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:40:46,740 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 13:40:46,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 13:40:46,746 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 13:40:46,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-10-11 13:40:47,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:47,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 13:40:47,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:40:47,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 13:40:47,258 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:40:47,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [788777176] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:40:47,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:40:47,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [23] total 24 [2024-10-11 13:40:47,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169628573] [2024-10-11 13:40:47,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:40:47,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:40:47,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:40:47,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:40:47,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1013, Unknown=0, NotChecked=0, Total=1190 [2024-10-11 13:40:47,260 INFO L87 Difference]: Start difference. First operand 178 states and 250 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 13:40:47,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:40:47,329 INFO L93 Difference]: Finished difference Result 357 states and 504 transitions. [2024-10-11 13:40:47,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:40:47,329 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 187 [2024-10-11 13:40:47,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:40:47,331 INFO L225 Difference]: With dead ends: 357 [2024-10-11 13:40:47,331 INFO L226 Difference]: Without dead ends: 192 [2024-10-11 13:40:47,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 502 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=177, Invalid=1013, Unknown=0, NotChecked=0, Total=1190 [2024-10-11 13:40:47,332 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 1 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:40:47,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 742 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:40:47,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-10-11 13:40:47,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 190. [2024-10-11 13:40:47,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 153 states have (on average 1.3071895424836601) internal successors, (200), 155 states have internal predecessors, (200), 31 states have call successors, (31), 5 states have call predecessors, (31), 5 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 13:40:47,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 262 transitions. [2024-10-11 13:40:47,349 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 262 transitions. Word has length 187 [2024-10-11 13:40:47,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:40:47,350 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 262 transitions. [2024-10-11 13:40:47,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 13:40:47,350 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 262 transitions. [2024-10-11 13:40:47,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-11 13:40:47,351 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:40:47,351 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:40:47,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-10-11 13:40:47,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-11 13:40:47,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:40:47,756 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:40:47,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:40:47,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1939664558, now seen corresponding path program 1 times [2024-10-11 13:40:47,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:40:47,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [505786019] [2024-10-11 13:40:47,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:40:47,757 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 [2024-10-11 13:40:47,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:40:47,759 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-10-11 13:40:47,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-10-11 13:40:48,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:48,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-11 13:40:48,146 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:40:49,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-10-11 13:40:49,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-11 13:40:49,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 38 [2024-10-11 13:40:49,647 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 55 treesize of output 39 [2024-10-11 13:40:49,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 23 proven. 481 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2024-10-11 13:40:49,833 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:40:50,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:40:50,526 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 39 treesize of output 38 [2024-10-11 13:40:50,731 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:40:50,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [505786019] [2024-10-11 13:40:50,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [505786019] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:40:50,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1707240484] [2024-10-11 13:40:50,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:40:50,731 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 13:40:50,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 13:40:50,734 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 13:40:50,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-10-11 13:40:51,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:51,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 13:40:51,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:40:51,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 13:40:51,228 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:40:51,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1707240484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:40:51,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:40:51,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [25] total 26 [2024-10-11 13:40:51,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227302244] [2024-10-11 13:40:51,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:40:51,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:40:51,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:40:51,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:40:51,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1151, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 13:40:51,231 INFO L87 Difference]: Start difference. First operand 190 states and 262 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 13:40:51,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:40:51,339 INFO L93 Difference]: Finished difference Result 377 states and 522 transitions. [2024-10-11 13:40:51,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 13:40:51,339 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 187 [2024-10-11 13:40:51,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:40:51,341 INFO L225 Difference]: With dead ends: 377 [2024-10-11 13:40:51,341 INFO L226 Difference]: Without dead ends: 200 [2024-10-11 13:40:51,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 500 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=181, Invalid=1151, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 13:40:51,344 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:40:51,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1019 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:40:51,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-10-11 13:40:51,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 198. [2024-10-11 13:40:51,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 161 states have (on average 1.2919254658385093) internal successors, (208), 163 states have internal predecessors, (208), 31 states have call successors, (31), 5 states have call predecessors, (31), 5 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 13:40:51,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 270 transitions. [2024-10-11 13:40:51,373 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 270 transitions. Word has length 187 [2024-10-11 13:40:51,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:40:51,373 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 270 transitions. [2024-10-11 13:40:51,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 13:40:51,373 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 270 transitions. [2024-10-11 13:40:51,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-11 13:40:51,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:40:51,375 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:40:51,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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)] Forceful destruction successful, exit code 0 [2024-10-11 13:40:51,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2024-10-11 13:40:51,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 13:40:51,776 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:40:51,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:40:51,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1939604976, now seen corresponding path program 1 times [2024-10-11 13:40:51,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:40:51,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1954391410] [2024-10-11 13:40:51,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:40:51,777 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 [2024-10-11 13:40:51,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:40:51,783 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-10-11 13:40:51,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-10-11 13:40:52,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:52,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 13:40:52,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:40:53,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 52 [2024-10-11 13:40:53,231 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 [2024-10-11 13:40:53,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 13:40:53,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2024-10-11 13:40:53,339 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:40:53,340 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 64 treesize of output 24 [2024-10-11 13:40:53,405 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 25 [2024-10-11 13:40:53,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 13:40:53,501 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:41:00,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:41:00,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1954391410] [2024-10-11 13:41:00,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1954391410] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:41:00,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1814304378] [2024-10-11 13:41:00,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:41:00,623 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 13:41:00,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 13:41:00,625 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 13:41:00,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-10-11 13:41:01,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:01,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 13:41:01,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:41:01,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2024-10-11 13:41:01,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 13:41:01,932 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:41:01,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1814304378] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:41:01,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:41:01,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2024-10-11 13:41:01,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424234165] [2024-10-11 13:41:01,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:41:01,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:41:01,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:41:01,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:41:01,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-10-11 13:41:01,934 INFO L87 Difference]: Start difference. First operand 198 states and 270 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 13:41:02,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:41:02,113 INFO L93 Difference]: Finished difference Result 381 states and 521 transitions. [2024-10-11 13:41:02,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:41:02,114 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 187 [2024-10-11 13:41:02,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:41:02,117 INFO L225 Difference]: With dead ends: 381 [2024-10-11 13:41:02,117 INFO L226 Difference]: Without dead ends: 196 [2024-10-11 13:41:02,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-10-11 13:41:02,118 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:41:02,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 441 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:41:02,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-10-11 13:41:02,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2024-10-11 13:41:02,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 159 states have (on average 1.270440251572327) internal successors, (202), 161 states have internal predecessors, (202), 31 states have call successors, (31), 5 states have call predecessors, (31), 5 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 13:41:02,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 264 transitions. [2024-10-11 13:41:02,128 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 264 transitions. Word has length 187 [2024-10-11 13:41:02,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:41:02,128 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 264 transitions. [2024-10-11 13:41:02,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 13:41:02,128 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 264 transitions. [2024-10-11 13:41:02,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-11 13:41:02,130 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:41:02,130 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:41:02,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2024-10-11 13:41:02,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-10-11 13:41:02,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:41:02,533 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:41:02,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:41:02,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1516903150, now seen corresponding path program 1 times [2024-10-11 13:41:02,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:41:02,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [356995962] [2024-10-11 13:41:02,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:41:02,534 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 [2024-10-11 13:41:02,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:41:02,536 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-10-11 13:41:02,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-10-11 13:41:02,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:02,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 13:41:02,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:41:04,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 52 [2024-10-11 13:41:04,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 13:41:04,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2024-10-11 13:41:04,043 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 [2024-10-11 13:41:04,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:41:04,134 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 64 treesize of output 24 [2024-10-11 13:41:04,213 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 25 [2024-10-11 13:41:04,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 13:41:04,313 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:41:12,743 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:41:12,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [356995962] [2024-10-11 13:41:12,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [356995962] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:41:12,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [136238536] [2024-10-11 13:41:12,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:41:12,743 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 13:41:12,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 13:41:12,745 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 13:41:12,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2024-10-11 13:41:13,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:13,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 13:41:13,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:41:14,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 82 treesize of output 34 [2024-10-11 13:41:14,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 13:41:14,410 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:41:14,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [136238536] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:41:14,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:41:14,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2024-10-11 13:41:14,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950801548] [2024-10-11 13:41:14,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:41:14,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:41:14,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:41:14,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:41:14,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2024-10-11 13:41:14,411 INFO L87 Difference]: Start difference. First operand 196 states and 264 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 13:41:15,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:41:15,020 INFO L93 Difference]: Finished difference Result 452 states and 610 transitions. [2024-10-11 13:41:15,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:41:15,021 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 187 [2024-10-11 13:41:15,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:41:15,022 INFO L225 Difference]: With dead ends: 452 [2024-10-11 13:41:15,022 INFO L226 Difference]: Without dead ends: 269 [2024-10-11 13:41:15,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2024-10-11 13:41:15,024 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 147 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:41:15,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 512 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:41:15,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-10-11 13:41:15,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 258. [2024-10-11 13:41:15,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 195 states have (on average 1.2307692307692308) internal successors, (240), 197 states have internal predecessors, (240), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 13:41:15,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 348 transitions. [2024-10-11 13:41:15,038 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 348 transitions. Word has length 187 [2024-10-11 13:41:15,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:41:15,038 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 348 transitions. [2024-10-11 13:41:15,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 13:41:15,039 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 348 transitions. [2024-10-11 13:41:15,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-11 13:41:15,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:41:15,040 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:41:15,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2024-10-11 13:41:15,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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)] Forceful destruction successful, exit code 0 [2024-10-11 13:41:15,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:41:15,445 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:41:15,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:41:15,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1460116249, now seen corresponding path program 1 times [2024-10-11 13:41:15,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:41:15,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1934673807] [2024-10-11 13:41:15,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:41:15,446 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 [2024-10-11 13:41:15,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:41:15,447 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-10-11 13:41:15,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-10-11 13:41:15,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:15,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 13:41:15,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:41:16,077 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 [2024-10-11 13:41:16,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 23 proven. 165 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 13:41:16,088 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:41:16,354 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-11 13:41:16,354 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 [2024-10-11 13:41:16,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 3 proven. 69 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-11 13:41:16,370 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:41:16,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1934673807] [2024-10-11 13:41:16,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1934673807] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:41:16,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:41:16,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2024-10-11 13:41:16,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425714024] [2024-10-11 13:41:16,371 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:41:16,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 13:41:16,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:41:16,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 13:41:16,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:41:16,372 INFO L87 Difference]: Start difference. First operand 258 states and 348 transitions. Second operand has 11 states, 9 states have (on average 8.666666666666666) internal successors, (78), 11 states have internal predecessors, (78), 4 states have call successors, (50), 3 states have call predecessors, (50), 5 states have return successors, (50), 2 states have call predecessors, (50), 4 states have call successors, (50) [2024-10-11 13:41:16,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:41:16,816 INFO L93 Difference]: Finished difference Result 519 states and 695 transitions. [2024-10-11 13:41:16,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 13:41:16,817 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 8.666666666666666) internal successors, (78), 11 states have internal predecessors, (78), 4 states have call successors, (50), 3 states have call predecessors, (50), 5 states have return successors, (50), 2 states have call predecessors, (50), 4 states have call successors, (50) Word has length 187 [2024-10-11 13:41:16,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:41:16,819 INFO L225 Difference]: With dead ends: 519 [2024-10-11 13:41:16,819 INFO L226 Difference]: Without dead ends: 274 [2024-10-11 13:41:16,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 363 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2024-10-11 13:41:16,820 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 221 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:41:16,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 525 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:41:16,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-10-11 13:41:16,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 262. [2024-10-11 13:41:16,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 198 states have (on average 1.2171717171717171) internal successors, (241), 200 states have internal predecessors, (241), 54 states have call successors, (54), 9 states have call predecessors, (54), 9 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 13:41:16,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 349 transitions. [2024-10-11 13:41:16,844 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 349 transitions. Word has length 187 [2024-10-11 13:41:16,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:41:16,845 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 349 transitions. [2024-10-11 13:41:16,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 8.666666666666666) internal successors, (78), 11 states have internal predecessors, (78), 4 states have call successors, (50), 3 states have call predecessors, (50), 5 states have return successors, (50), 2 states have call predecessors, (50), 4 states have call successors, (50) [2024-10-11 13:41:16,845 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 349 transitions. [2024-10-11 13:41:16,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-11 13:41:16,846 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:41:16,846 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:41:16,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-10-11 13:41:17,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:41:17,047 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:41:17,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:41:17,048 INFO L85 PathProgramCache]: Analyzing trace with hash -128231653, now seen corresponding path program 1 times [2024-10-11 13:41:17,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:41:17,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [114039626] [2024-10-11 13:41:17,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:41:17,048 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 [2024-10-11 13:41:17,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:41:17,050 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-10-11 13:41:17,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-10-11 13:41:17,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:17,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 13:41:17,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:41:17,813 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 [2024-10-11 13:41:17,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2024-10-11 13:41:17,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2024-10-11 13:41:17,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 21 proven. 327 refuted. 0 times theorem prover too weak. 852 trivial. 0 not checked. [2024-10-11 13:41:17,918 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:41:18,625 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-11 13:41:18,625 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 30 treesize of output 25 [2024-10-11 13:41:18,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 9 proven. 63 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-11 13:41:18,662 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:41:18,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [114039626] [2024-10-11 13:41:18,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [114039626] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:41:18,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:41:18,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2024-10-11 13:41:18,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228326747] [2024-10-11 13:41:18,663 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:41:18,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 13:41:18,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:41:18,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 13:41:18,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2024-10-11 13:41:18,664 INFO L87 Difference]: Start difference. First operand 262 states and 349 transitions. Second operand has 20 states, 18 states have (on average 6.722222222222222) internal successors, (121), 20 states have internal predecessors, (121), 5 states have call successors, (50), 3 states have call predecessors, (50), 5 states have return successors, (50), 3 states have call predecessors, (50), 5 states have call successors, (50) [2024-10-11 13:41:19,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:41:19,675 INFO L93 Difference]: Finished difference Result 539 states and 706 transitions. [2024-10-11 13:41:19,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 13:41:19,675 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 6.722222222222222) internal successors, (121), 20 states have internal predecessors, (121), 5 states have call successors, (50), 3 states have call predecessors, (50), 5 states have return successors, (50), 3 states have call predecessors, (50), 5 states have call successors, (50) Word has length 187 [2024-10-11 13:41:19,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:41:19,677 INFO L225 Difference]: With dead ends: 539 [2024-10-11 13:41:19,677 INFO L226 Difference]: Without dead ends: 290 [2024-10-11 13:41:19,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=266, Invalid=1066, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 13:41:19,679 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 260 mSDsluCounter, 1109 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:41:19,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 1239 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 13:41:19,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-10-11 13:41:19,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 146. [2024-10-11 13:41:19,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 115 states have (on average 1.2260869565217392) internal successors, (141), 115 states have internal predecessors, (141), 25 states have call successors, (25), 5 states have call predecessors, (25), 5 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 13:41:19,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 191 transitions. [2024-10-11 13:41:19,691 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 191 transitions. Word has length 187 [2024-10-11 13:41:19,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:41:19,692 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 191 transitions. [2024-10-11 13:41:19,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 6.722222222222222) internal successors, (121), 20 states have internal predecessors, (121), 5 states have call successors, (50), 3 states have call predecessors, (50), 5 states have return successors, (50), 3 states have call predecessors, (50), 5 states have call successors, (50) [2024-10-11 13:41:19,692 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 191 transitions. [2024-10-11 13:41:19,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-11 13:41:19,693 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:41:19,693 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:41:19,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-10-11 13:41:19,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:41:19,898 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:41:19,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:41:19,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1733993582, now seen corresponding path program 1 times [2024-10-11 13:41:19,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:41:19,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [292913010] [2024-10-11 13:41:19,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:41:19,899 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 [2024-10-11 13:41:19,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:41:19,902 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-10-11 13:41:19,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-10-11 13:41:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:20,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 13:41:20,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:41:21,409 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 21 treesize of output 10 [2024-10-11 13:41:21,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 52 [2024-10-11 13:41:21,430 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 [2024-10-11 13:41:21,530 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:41:21,530 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 56 treesize of output 20 [2024-10-11 13:41:21,601 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 25 [2024-10-11 13:41:21,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 13:41:21,706 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:41:29,789 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:41:29,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [292913010] [2024-10-11 13:41:29,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [292913010] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:41:29,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [522821359] [2024-10-11 13:41:29,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:41:29,790 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 13:41:29,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 13:41:29,792 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 13:41:29,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2024-10-11 13:41:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:30,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 13:41:30,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:41:31,083 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 83 treesize of output 35 [2024-10-11 13:41:31,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 13:41:31,399 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:41:31,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [522821359] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:41:31,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:41:31,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2024-10-11 13:41:31,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181117197] [2024-10-11 13:41:31,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:41:31,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:41:31,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:41:31,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:41:31,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2024-10-11 13:41:31,401 INFO L87 Difference]: Start difference. First operand 146 states and 191 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 13:41:31,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:41:31,972 INFO L93 Difference]: Finished difference Result 410 states and 538 transitions. [2024-10-11 13:41:31,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:41:31,973 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 187 [2024-10-11 13:41:31,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:41:31,974 INFO L225 Difference]: With dead ends: 410 [2024-10-11 13:41:31,974 INFO L226 Difference]: Without dead ends: 265 [2024-10-11 13:41:31,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-10-11 13:41:31,975 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 146 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:41:31,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 891 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:41:31,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-10-11 13:41:31,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 146. [2024-10-11 13:41:31,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 115 states have (on average 1.2173913043478262) internal successors, (140), 115 states have internal predecessors, (140), 25 states have call successors, (25), 5 states have call predecessors, (25), 5 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 13:41:31,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 190 transitions. [2024-10-11 13:41:31,987 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 190 transitions. Word has length 187 [2024-10-11 13:41:31,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:41:31,987 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 190 transitions. [2024-10-11 13:41:31,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 13:41:31,988 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 190 transitions. [2024-10-11 13:41:31,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-11 13:41:31,989 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:41:31,989 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:41:31,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-11 13:41:32,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Forceful destruction successful, exit code 0 [2024-10-11 13:41:32,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 13:41:32,391 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:41:32,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:41:32,391 INFO L85 PathProgramCache]: Analyzing trace with hash 972625812, now seen corresponding path program 1 times [2024-10-11 13:41:32,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:41:32,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [722622517] [2024-10-11 13:41:32,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:41:32,392 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 [2024-10-11 13:41:32,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:41:32,394 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-10-11 13:41:32,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-10-11 13:41:32,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:32,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 13:41:32,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:41:33,410 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 [2024-10-11 13:41:33,479 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 [2024-10-11 13:41:33,482 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 [2024-10-11 13:41:33,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 31 proven. 457 refuted. 0 times theorem prover too weak. 712 trivial. 0 not checked. [2024-10-11 13:41:33,525 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:41:33,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 13:41:33,679 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:41:33,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [722622517] [2024-10-11 13:41:33,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [722622517] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:41:33,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:41:33,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 19 [2024-10-11 13:41:33,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738373064] [2024-10-11 13:41:33,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:41:33,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:41:33,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:41:33,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:41:33,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2024-10-11 13:41:33,681 INFO L87 Difference]: Start difference. First operand 146 states and 190 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 13:41:33,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:41:33,828 INFO L93 Difference]: Finished difference Result 345 states and 448 transitions. [2024-10-11 13:41:33,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:41:33,828 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 187 [2024-10-11 13:41:33,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:41:33,830 INFO L225 Difference]: With dead ends: 345 [2024-10-11 13:41:33,830 INFO L226 Difference]: Without dead ends: 200 [2024-10-11 13:41:33,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2024-10-11 13:41:33,831 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 65 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:41:33,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 843 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:41:33,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-10-11 13:41:33,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 145. [2024-10-11 13:41:33,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 114 states have (on average 1.219298245614035) internal successors, (139), 114 states have internal predecessors, (139), 25 states have call successors, (25), 5 states have call predecessors, (25), 5 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 13:41:33,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 189 transitions. [2024-10-11 13:41:33,842 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 189 transitions. Word has length 187 [2024-10-11 13:41:33,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:41:33,842 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 189 transitions. [2024-10-11 13:41:33,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 13:41:33,842 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 189 transitions. [2024-10-11 13:41:33,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-11 13:41:33,843 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:41:33,843 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:41:33,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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)] Forceful destruction successful, exit code 0 [2024-10-11 13:41:34,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:41:34,048 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:41:34,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:41:34,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1933669987, now seen corresponding path program 1 times [2024-10-11 13:41:34,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:41:34,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1311892124] [2024-10-11 13:41:34,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:41:34,049 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 [2024-10-11 13:41:34,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:41:34,054 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-10-11 13:41:34,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-10-11 13:41:34,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:34,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 13:41:34,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:41:35,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 52 [2024-10-11 13:41:35,567 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 [2024-10-11 13:41:35,572 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 21 treesize of output 10 [2024-10-11 13:41:35,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:41:35,682 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 56 treesize of output 20 [2024-10-11 13:41:35,769 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 25 [2024-10-11 13:41:35,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 13:41:35,867 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:41:44,433 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:41:44,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1311892124] [2024-10-11 13:41:44,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1311892124] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:41:44,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1795636695] [2024-10-11 13:41:44,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:41:44,433 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 13:41:44,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 13:41:44,435 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 13:41:44,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2024-10-11 13:41:45,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:45,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 13:41:45,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:41:45,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2024-10-11 13:41:45,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 13:41:45,851 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:41:45,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1795636695] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:41:45,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:41:45,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2024-10-11 13:41:45,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590175759] [2024-10-11 13:41:45,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:41:45,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:41:45,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:41:45,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:41:45,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-10-11 13:41:45,852 INFO L87 Difference]: Start difference. First operand 145 states and 189 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 13:41:45,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:41:45,946 INFO L93 Difference]: Finished difference Result 281 states and 368 transitions. [2024-10-11 13:41:45,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:41:45,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 187 [2024-10-11 13:41:45,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:41:45,947 INFO L225 Difference]: With dead ends: 281 [2024-10-11 13:41:45,947 INFO L226 Difference]: Without dead ends: 137 [2024-10-11 13:41:45,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-10-11 13:41:45,948 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:41:45,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 429 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:41:45,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-11 13:41:45,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-10-11 13:41:45,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 106 states have (on average 1.2075471698113207) internal successors, (128), 106 states have internal predecessors, (128), 25 states have call successors, (25), 5 states have call predecessors, (25), 5 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 13:41:45,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 178 transitions. [2024-10-11 13:41:45,959 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 178 transitions. Word has length 187 [2024-10-11 13:41:45,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:41:45,960 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 178 transitions. [2024-10-11 13:41:45,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 13:41:45,960 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 178 transitions. [2024-10-11 13:41:45,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-11 13:41:45,961 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:41:45,961 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:41:45,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Ended with exit code 0 [2024-10-11 13:41:46,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-10-11 13:41:46,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,18 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:41:46,362 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:41:46,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:41:46,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1758200407, now seen corresponding path program 1 times [2024-10-11 13:41:46,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:41:46,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1722661516] [2024-10-11 13:41:46,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:41:46,363 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 [2024-10-11 13:41:46,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:41:46,366 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-10-11 13:41:46,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-10-11 13:41:46,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:46,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 13:41:46,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:41:46,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2024-10-11 13:41:46,919 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 87 treesize of output 75 [2024-10-11 13:41:46,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 63 [2024-10-11 13:41:46,923 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 51 [2024-10-11 13:41:46,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 456 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2024-10-11 13:41:46,952 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:41:47,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2024-10-11 13:41:47,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 13:41:47,090 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:41:47,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1722661516] [2024-10-11 13:41:47,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1722661516] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:41:47,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:41:47,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2024-10-11 13:41:47,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048733700] [2024-10-11 13:41:47,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:41:47,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:41:47,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:41:47,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:41:47,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:41:47,091 INFO L87 Difference]: Start difference. First operand 137 states and 178 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 13:41:47,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:41:47,530 INFO L93 Difference]: Finished difference Result 347 states and 444 transitions. [2024-10-11 13:41:47,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:41:47,530 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2024-10-11 13:41:47,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:41:47,532 INFO L225 Difference]: With dead ends: 347 [2024-10-11 13:41:47,532 INFO L226 Difference]: Without dead ends: 211 [2024-10-11 13:41:47,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:41:47,532 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 59 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:41:47,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 830 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:41:47,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-10-11 13:41:47,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 151. [2024-10-11 13:41:47,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 120 states have (on average 1.2) internal successors, (144), 120 states have internal predecessors, (144), 25 states have call successors, (25), 5 states have call predecessors, (25), 5 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 13:41:47,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 194 transitions. [2024-10-11 13:41:47,544 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 194 transitions. Word has length 190 [2024-10-11 13:41:47,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:41:47,545 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 194 transitions. [2024-10-11 13:41:47,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 13:41:47,545 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 194 transitions. [2024-10-11 13:41:47,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-11 13:41:47,546 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:41:47,546 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:41:47,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-10-11 13:41:47,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:41:47,749 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:41:47,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:41:47,750 INFO L85 PathProgramCache]: Analyzing trace with hash -47237927, now seen corresponding path program 1 times [2024-10-11 13:41:47,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:41:47,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [782222287] [2024-10-11 13:41:47,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:41:47,750 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 [2024-10-11 13:41:47,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:41:47,752 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-10-11 13:41:47,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-10-11 13:41:48,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:48,093 INFO L255 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 13:41:48,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:41:49,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 52 [2024-10-11 13:41:49,266 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 21 treesize of output 10 [2024-10-11 13:41:49,272 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 [2024-10-11 13:41:49,496 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:41:49,497 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 56 treesize of output 20 [2024-10-11 13:41:49,575 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 25 [2024-10-11 13:41:49,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 13:41:49,721 INFO L311 TraceCheckSpWp]: Computing backward predicates...