./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-99.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-99.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 133276d09bc7c3b73c8695fd51c915a857a4b525f277730197e5bde79d3ce970 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:44:24,677 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:44:24,729 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:44:24,734 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:44:24,734 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:44:24,756 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:44:24,758 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:44:24,758 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:44:24,759 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:44:24,759 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:44:24,760 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:44:24,760 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:44:24,761 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:44:24,761 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:44:24,762 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:44:24,763 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:44:24,763 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:44:24,763 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:44:24,763 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:44:24,763 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:44:24,764 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:44:24,766 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:44:24,766 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:44:24,767 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:44:24,767 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:44:24,767 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:44:24,767 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:44:24,767 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:44:24,767 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:44:24,768 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:44:24,768 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:44:24,769 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:44:24,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:44:24,769 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:44:24,769 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:44:24,770 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:44:24,770 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:44:24,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:44:24,770 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:44:24,770 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:44:24,770 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:44:24,771 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:44:24,771 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 -> 133276d09bc7c3b73c8695fd51c915a857a4b525f277730197e5bde79d3ce970 [2024-10-11 13:44:24,958 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:44:24,978 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:44:24,980 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:44:24,983 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:44:24,983 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:44:24,984 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-99.i [2024-10-11 13:44:26,188 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:44:26,342 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:44:26,342 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-99.i [2024-10-11 13:44:26,350 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4371f19f1/51241fb94d2c49188164f90c189d67d9/FLAG7e3a83266 [2024-10-11 13:44:26,738 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4371f19f1/51241fb94d2c49188164f90c189d67d9 [2024-10-11 13:44:26,740 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:44:26,741 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:44:26,741 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:44:26,742 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:44:26,746 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:44:26,746 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:44:26" (1/1) ... [2024-10-11 13:44:26,747 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@87f6a25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:26, skipping insertion in model container [2024-10-11 13:44:26,747 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:44:26" (1/1) ... [2024-10-11 13:44:26,770 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:44:26,888 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-99.i[916,929] [2024-10-11 13:44:26,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:44:26,943 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:44:26,951 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-99.i[916,929] [2024-10-11 13:44:26,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:44:26,994 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:44:26,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:26 WrapperNode [2024-10-11 13:44:26,995 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:44:26,996 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:44:26,996 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:44:26,996 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:44:27,000 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:44:26" (1/1) ... [2024-10-11 13:44:27,010 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:44:26" (1/1) ... [2024-10-11 13:44:27,042 INFO L138 Inliner]: procedures = 29, calls = 197, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 593 [2024-10-11 13:44:27,042 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:44:27,043 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:44:27,043 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:44:27,043 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:44:27,051 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:26" (1/1) ... [2024-10-11 13:44:27,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:26" (1/1) ... [2024-10-11 13:44:27,056 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:26" (1/1) ... [2024-10-11 13:44:27,076 INFO L175 MemorySlicer]: Split 152 memory accesses to 16 slices as follows [2, 7, 14, 12, 12, 10, 6, 10, 12, 8, 5, 10, 16, 7, 11, 10]. 11 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 19 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 3, 1, 1]. [2024-10-11 13:44:27,076 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:26" (1/1) ... [2024-10-11 13:44:27,076 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:26" (1/1) ... [2024-10-11 13:44:27,109 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:26" (1/1) ... [2024-10-11 13:44:27,113 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:26" (1/1) ... [2024-10-11 13:44:27,116 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:26" (1/1) ... [2024-10-11 13:44:27,124 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:26" (1/1) ... [2024-10-11 13:44:27,130 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:44:27,131 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:44:27,131 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:44:27,131 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:44:27,131 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:26" (1/1) ... [2024-10-11 13:44:27,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:44:27,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:44:27,169 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:44:27,171 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:44:27,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:44:27,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 13:44:27,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 13:44:27,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 13:44:27,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 13:44:27,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 13:44:27,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 13:44:27,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-11 13:44:27,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-11 13:44:27,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-11 13:44:27,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-11 13:44:27,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-11 13:44:27,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-11 13:44:27,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-11 13:44:27,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-10-11 13:44:27,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-10-11 13:44:27,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-10-11 13:44:27,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 13:44:27,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 13:44:27,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-11 13:44:27,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-11 13:44:27,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-11 13:44:27,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-11 13:44:27,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-10-11 13:44:27,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-10-11 13:44:27,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-10-11 13:44:27,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-10-11 13:44:27,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-10-11 13:44:27,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-10-11 13:44:27,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-10-11 13:44:27,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2024-10-11 13:44:27,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2024-10-11 13:44:27,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#15 [2024-10-11 13:44:27,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 13:44:27,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 13:44:27,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-11 13:44:27,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-11 13:44:27,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-11 13:44:27,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-11 13:44:27,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-10-11 13:44:27,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-10-11 13:44:27,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-10-11 13:44:27,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-10-11 13:44:27,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-10-11 13:44:27,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-10-11 13:44:27,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-10-11 13:44:27,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2024-10-11 13:44:27,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2024-10-11 13:44:27,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#15 [2024-10-11 13:44:27,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 13:44:27,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 13:44:27,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 13:44:27,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 13:44:27,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 13:44:27,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 13:44:27,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-11 13:44:27,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-11 13:44:27,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-11 13:44:27,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-11 13:44:27,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-11 13:44:27,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-11 13:44:27,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-11 13:44:27,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-10-11 13:44:27,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-10-11 13:44:27,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-10-11 13:44:27,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 13:44:27,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 13:44:27,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-11 13:44:27,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-11 13:44:27,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-11 13:44:27,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-11 13:44:27,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-10-11 13:44:27,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-10-11 13:44:27,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-10-11 13:44:27,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-10-11 13:44:27,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-10-11 13:44:27,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-10-11 13:44:27,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-10-11 13:44:27,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2024-10-11 13:44:27,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2024-10-11 13:44:27,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#15 [2024-10-11 13:44:27,227 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:44:27,227 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:44:27,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:44:27,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 13:44:27,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 13:44:27,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 13:44:27,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 13:44:27,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 13:44:27,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 13:44:27,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 13:44:27,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 13:44:27,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 13:44:27,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-11 13:44:27,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-11 13:44:27,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-11 13:44:27,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-11 13:44:27,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-11 13:44:27,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-11 13:44:27,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:44:27,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:44:27,411 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:44:27,412 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:44:27,842 INFO L? ?]: Removed 157 outVars from TransFormulas that were not future-live. [2024-10-11 13:44:27,842 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:44:27,873 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:44:27,873 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:44:27,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:44:27 BoogieIcfgContainer [2024-10-11 13:44:27,874 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:44:27,875 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:44:27,875 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:44:27,878 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:44:27,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:44:26" (1/3) ... [2024-10-11 13:44:27,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2872bcda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:44:27, skipping insertion in model container [2024-10-11 13:44:27,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:26" (2/3) ... [2024-10-11 13:44:27,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2872bcda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:44:27, skipping insertion in model container [2024-10-11 13:44:27,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:44:27" (3/3) ... [2024-10-11 13:44:27,880 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-99.i [2024-10-11 13:44:27,892 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:44:27,892 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:44:27,941 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:44:27,946 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;@b13fb6d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:44:27,946 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:44:27,949 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 96 states have (on average 1.4479166666666667) internal successors, (139), 97 states have internal predecessors, (139), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 13:44:27,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 13:44:27,958 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:27,958 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:27,959 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:27,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:27,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1878662179, now seen corresponding path program 1 times [2024-10-11 13:44:27,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:44:27,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272275085] [2024-10-11 13:44:27,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:27,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:44:28,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:28,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:44:28,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:28,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:44:28,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:28,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:44:28,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:28,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:44:28,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:28,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:44:28,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:28,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:44:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:28,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:44:28,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:28,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:44:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:28,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:44:28,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:28,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:44:28,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:28,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:44:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:28,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:44:28,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:28,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:44:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:28,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:44:28,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:28,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:44:28,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:28,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:44:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:28,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:44:28,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:28,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 13:44:28,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:28,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:44:28,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:28,375 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 13:44:28,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:44:28,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272275085] [2024-10-11 13:44:28,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272275085] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:44:28,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:44:28,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:44:28,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186534838] [2024-10-11 13:44:28,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:44:28,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:44:28,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:44:28,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:44:28,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:44:28,418 INFO L87 Difference]: Start difference. First operand has 118 states, 96 states have (on average 1.4479166666666667) internal successors, (139), 97 states have internal predecessors, (139), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 13:44:28,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:44:28,461 INFO L93 Difference]: Finished difference Result 233 states and 371 transitions. [2024-10-11 13:44:28,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:44:28,464 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 151 [2024-10-11 13:44:28,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:44:28,472 INFO L225 Difference]: With dead ends: 233 [2024-10-11 13:44:28,472 INFO L226 Difference]: Without dead ends: 116 [2024-10-11 13:44:28,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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:44:28,479 INFO L432 NwaCegarLoop]: 168 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, 168 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:44:28,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:44:28,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-11 13:44:28,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-10-11 13:44:28,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 95 states have (on average 1.4105263157894736) internal successors, (134), 95 states have internal predecessors, (134), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 13:44:28,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 172 transitions. [2024-10-11 13:44:28,513 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 172 transitions. Word has length 151 [2024-10-11 13:44:28,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:44:28,513 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 172 transitions. [2024-10-11 13:44:28,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 13:44:28,514 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 172 transitions. [2024-10-11 13:44:28,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 13:44:28,517 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:28,517 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:28,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:44:28,517 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:28,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:28,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1581907829, now seen corresponding path program 1 times [2024-10-11 13:44:28,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:44:28,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438886636] [2024-10-11 13:44:28,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:28,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:44:28,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:28,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:44:28,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:28,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:44:28,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:28,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:44:28,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:28,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:44:28,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:28,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:44:28,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:28,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:44:28,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:28,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:44:28,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:28,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:44:28,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:28,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:44:28,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:28,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:44:28,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:28,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:44:28,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:28,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:44:28,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:28,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:44:28,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:28,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:44:28,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:28,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:44:28,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:28,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:44:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:28,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:44:28,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:28,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 13:44:28,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:28,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:44:28,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:28,845 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 13:44:28,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:44:28,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438886636] [2024-10-11 13:44:28,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438886636] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:44:28,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:44:28,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:44:28,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709230067] [2024-10-11 13:44:28,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:44:28,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:44:28,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:44:28,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:44:28,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:44:28,848 INFO L87 Difference]: Start difference. First operand 116 states and 172 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 13:44:28,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:44:28,902 INFO L93 Difference]: Finished difference Result 233 states and 346 transitions. [2024-10-11 13:44:28,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:44:28,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 151 [2024-10-11 13:44:28,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:44:28,904 INFO L225 Difference]: With dead ends: 233 [2024-10-11 13:44:28,904 INFO L226 Difference]: Without dead ends: 118 [2024-10-11 13:44:28,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 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:44:28,905 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:44:28,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 491 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:44:28,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-11 13:44:28,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-10-11 13:44:28,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 97 states have (on average 1.402061855670103) internal successors, (136), 97 states have internal predecessors, (136), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 13:44:28,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 174 transitions. [2024-10-11 13:44:28,914 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 174 transitions. Word has length 151 [2024-10-11 13:44:28,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:44:28,915 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 174 transitions. [2024-10-11 13:44:28,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 13:44:28,915 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 174 transitions. [2024-10-11 13:44:28,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 13:44:28,917 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:28,917 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:28,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:44:28,917 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:28,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:28,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1512259955, now seen corresponding path program 1 times [2024-10-11 13:44:28,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:44:28,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792938552] [2024-10-11 13:44:28,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:28,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:44:29,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:44:29,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:44:29,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:44:29,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:44:29,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:44:29,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:44:29,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:44:29,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:44:29,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:44:29,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:44:29,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:44:29,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:44:29,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:44:29,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:44:29,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:44:29,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:44:29,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:44:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 13:44:29,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:44:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,287 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 13:44:29,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:44:29,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792938552] [2024-10-11 13:44:29,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792938552] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:44:29,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:44:29,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:44:29,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999409718] [2024-10-11 13:44:29,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:44:29,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:44:29,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:44:29,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:44:29,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:44:29,290 INFO L87 Difference]: Start difference. First operand 118 states and 174 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 13:44:29,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:44:29,404 INFO L93 Difference]: Finished difference Result 270 states and 397 transitions. [2024-10-11 13:44:29,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:44:29,406 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-10-11 13:44:29,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:44:29,408 INFO L225 Difference]: With dead ends: 270 [2024-10-11 13:44:29,408 INFO L226 Difference]: Without dead ends: 153 [2024-10-11 13:44:29,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 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:44:29,409 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 48 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:44:29,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 617 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:44:29,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-10-11 13:44:29,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 129. [2024-10-11 13:44:29,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 108 states have (on average 1.4074074074074074) internal successors, (152), 108 states have internal predecessors, (152), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 13:44:29,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 190 transitions. [2024-10-11 13:44:29,425 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 190 transitions. Word has length 151 [2024-10-11 13:44:29,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:44:29,426 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 190 transitions. [2024-10-11 13:44:29,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 13:44:29,426 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 190 transitions. [2024-10-11 13:44:29,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 13:44:29,431 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:29,431 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:29,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 13:44:29,432 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:29,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:29,432 INFO L85 PathProgramCache]: Analyzing trace with hash -610609268, now seen corresponding path program 1 times [2024-10-11 13:44:29,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:44:29,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126008213] [2024-10-11 13:44:29,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:29,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:44:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:44:29,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:44:29,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:44:29,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:44:29,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:44:29,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:44:29,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:44:29,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:44:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:44:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:44:29,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:44:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:44:29,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:44:29,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:44:29,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:44:29,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:44:29,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:44:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 13:44:29,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:44:29,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,632 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 13:44:29,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:44:29,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126008213] [2024-10-11 13:44:29,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126008213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:44:29,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:44:29,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:44:29,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766461097] [2024-10-11 13:44:29,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:44:29,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:44:29,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:44:29,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:44:29,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:44:29,635 INFO L87 Difference]: Start difference. First operand 129 states and 190 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 13:44:29,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:44:29,670 INFO L93 Difference]: Finished difference Result 260 states and 383 transitions. [2024-10-11 13:44:29,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:44:29,671 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-10-11 13:44:29,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:44:29,672 INFO L225 Difference]: With dead ends: 260 [2024-10-11 13:44:29,672 INFO L226 Difference]: Without dead ends: 132 [2024-10-11 13:44:29,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:44:29,673 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:44:29,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 651 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:44:29,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-11 13:44:29,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-10-11 13:44:29,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 111 states have (on average 1.3963963963963963) internal successors, (155), 111 states have internal predecessors, (155), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 13:44:29,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 193 transitions. [2024-10-11 13:44:29,679 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 193 transitions. Word has length 151 [2024-10-11 13:44:29,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:44:29,680 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 193 transitions. [2024-10-11 13:44:29,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 13:44:29,680 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 193 transitions. [2024-10-11 13:44:29,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 13:44:29,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:29,681 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:29,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 13:44:29,682 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:29,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:29,682 INFO L85 PathProgramCache]: Analyzing trace with hash -823042281, now seen corresponding path program 1 times [2024-10-11 13:44:29,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:44:29,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187480227] [2024-10-11 13:44:29,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:29,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:44:29,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 13:44:29,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2042414706] [2024-10-11 13:44:29,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:29,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:44:29,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:44:29,787 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:44:29,788 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:44:30,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:44:30,207 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 13:44:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:44:30,585 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 13:44:30,586 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 13:44:30,586 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:44:30,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 13:44:30,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:44:30,791 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-11 13:44:30,947 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 13:44:30,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:44:30 BoogieIcfgContainer [2024-10-11 13:44:30,949 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 13:44:30,950 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 13:44:30,950 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 13:44:30,950 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 13:44:30,950 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:44:27" (3/4) ... [2024-10-11 13:44:30,951 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 13:44:30,952 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 13:44:30,953 INFO L158 Benchmark]: Toolchain (without parser) took 4212.03ms. Allocated memory was 167.8MB in the beginning and 224.4MB in the end (delta: 56.6MB). Free memory was 98.0MB in the beginning and 70.2MB in the end (delta: 27.8MB). Peak memory consumption was 86.5MB. Max. memory is 16.1GB. [2024-10-11 13:44:30,953 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 167.8MB. Free memory is still 128.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:44:30,954 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.71ms. Allocated memory is still 167.8MB. Free memory was 97.8MB in the beginning and 81.9MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 13:44:30,954 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.57ms. Allocated memory is still 167.8MB. Free memory was 81.9MB in the beginning and 78.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:44:30,954 INFO L158 Benchmark]: Boogie Preprocessor took 87.32ms. Allocated memory is still 167.8MB. Free memory was 78.2MB in the beginning and 135.9MB in the end (delta: -57.7MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. [2024-10-11 13:44:30,955 INFO L158 Benchmark]: RCFGBuilder took 743.50ms. Allocated memory is still 167.8MB. Free memory was 135.9MB in the beginning and 82.5MB in the end (delta: 53.4MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-10-11 13:44:30,957 INFO L158 Benchmark]: TraceAbstraction took 3074.07ms. Allocated memory was 167.8MB in the beginning and 224.4MB in the end (delta: 56.6MB). Free memory was 81.4MB in the beginning and 70.2MB in the end (delta: 11.2MB). Peak memory consumption was 66.6MB. Max. memory is 16.1GB. [2024-10-11 13:44:30,957 INFO L158 Benchmark]: Witness Printer took 2.56ms. Allocated memory is still 224.4MB. Free memory is still 70.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:44:30,958 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.13ms. Allocated memory is still 167.8MB. Free memory is still 128.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 253.71ms. Allocated memory is still 167.8MB. Free memory was 97.8MB in the beginning and 81.9MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.57ms. Allocated memory is still 167.8MB. Free memory was 81.9MB in the beginning and 78.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.32ms. Allocated memory is still 167.8MB. Free memory was 78.2MB in the beginning and 135.9MB in the end (delta: -57.7MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. * RCFGBuilder took 743.50ms. Allocated memory is still 167.8MB. Free memory was 135.9MB in the beginning and 82.5MB in the end (delta: 53.4MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3074.07ms. Allocated memory was 167.8MB in the beginning and 224.4MB in the end (delta: 56.6MB). Free memory was 81.4MB in the beginning and 70.2MB in the end (delta: 11.2MB). Peak memory consumption was 66.6MB. Max. memory is 16.1GB. * Witness Printer took 2.56ms. Allocated memory is still 224.4MB. Free memory is still 70.2MB. 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 115, overapproximation of someBinaryArithmeticFLOAToperation at line 57. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 255.5; [L22] float var_1_1 = 255.5; [L23] float* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_2 = 16; [L24] unsigned char var_1_2 = 16; [L25] unsigned char* var_1_2_Pointer = &(var_1_2); [L26] float var_1_4 = 1000000000000000.6; [L26] float var_1_4 = 1000000000000000.6; [L27] float* var_1_4_Pointer = &(var_1_4); [L28] float var_1_5 = 500.5; [L28] float var_1_5 = 500.5; [L29] float* var_1_5_Pointer = &(var_1_5); [L30] float var_1_6 = 99999999999.5; [L30] float var_1_6 = 99999999999.5; [L31] float* var_1_6_Pointer = &(var_1_6); [L32] unsigned char var_1_7 = 1; [L32] unsigned char var_1_7 = 1; [L33] unsigned char* var_1_7_Pointer = &(var_1_7); [L34] float var_1_8 = 127.25; [L34] float var_1_8 = 127.25; [L35] float* var_1_8_Pointer = &(var_1_8); [L36] float var_1_9 = 4.8; [L36] float var_1_9 = 4.8; [L37] float* var_1_9_Pointer = &(var_1_9); [L38] float var_1_10 = 0.4; [L38] float var_1_10 = 0.4; [L39] float* var_1_10_Pointer = &(var_1_10); [L40] signed long int var_1_11 = 0; [L40] signed long int var_1_11 = 0; [L41] signed long int* var_1_11_Pointer = &(var_1_11); [L42] signed long int var_1_12 = 256; [L42] signed long int var_1_12 = 256; [L43] signed long int* var_1_12_Pointer = &(var_1_12); [L44] signed long int var_1_13 = 25; [L44] signed long int var_1_13 = 25; [L45] signed long int* var_1_13_Pointer = &(var_1_13); [L46] signed long int var_1_14 = -5; [L46] signed long int var_1_14 = -5; [L47] signed long int* var_1_14_Pointer = &(var_1_14); [L48] signed short int var_1_15 = 2; [L48] signed short int var_1_15 = 2; [L49] signed short int* var_1_15_Pointer = &(var_1_15); [L50] signed long int var_1_16 = -50; [L50] signed long int var_1_16 = -50; [L51] signed long int* var_1_16_Pointer = &(var_1_16); [L119] isInitial = 1 [L120] FCALL initially() [L121] COND TRUE 1 [L122] FCALL updateLastVariables() [L123] CALL updateVariables() [L80] var_1_2 = __VERIFIER_nondet_uchar() [L81] EXPR \read(var_1_2) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L81] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L81] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L82] EXPR \read(var_1_2) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L82] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L82] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L83] var_1_4 = __VERIFIER_nondet_float() [L84] EXPR \read(var_1_4) [L84] EXPR var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L84] EXPR var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F [L84] EXPR \read(var_1_4) [L84] EXPR var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L84] EXPR (var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L84] EXPR (var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L84] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L84] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L85] var_1_5 = __VERIFIER_nondet_float() [L86] EXPR \read(var_1_5) [L86] EXPR var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L86] EXPR var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F [L86] EXPR \read(var_1_5) [L86] EXPR var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L86] EXPR (var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L86] EXPR (var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L86] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L86] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L87] var_1_6 = __VERIFIER_nondet_float() [L88] EXPR \read(var_1_6) [L88] EXPR var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L88] EXPR var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F [L88] EXPR \read(var_1_6) [L88] EXPR var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L88] EXPR (var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L88] EXPR (var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L88] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L88] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L89] var_1_7 = __VERIFIER_nondet_uchar() [L90] EXPR \read(var_1_7) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L90] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L90] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L91] EXPR \read(var_1_7) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L91] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L91] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L92] var_1_8 = __VERIFIER_nondet_float() [L93] EXPR \read(var_1_8) [L93] EXPR var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L93] EXPR var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F [L93] EXPR \read(var_1_8) [L93] EXPR var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L93] EXPR (var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L93] EXPR (var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L93] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L93] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L94] var_1_9 = __VERIFIER_nondet_float() [L95] EXPR \read(var_1_9) [L95] EXPR var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L95] EXPR var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F [L95] EXPR \read(var_1_9) [L95] EXPR var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L95] EXPR (var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L95] EXPR (var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L95] CALL assume_abort_if_not((var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L95] RET assume_abort_if_not((var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L96] var_1_10 = __VERIFIER_nondet_float() [L97] EXPR \read(var_1_10) [L97] EXPR var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L97] EXPR var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F [L97] EXPR \read(var_1_10) [L97] EXPR var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L97] EXPR (var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L97] EXPR (var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L97] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L97] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L98] var_1_12 = __VERIFIER_nondet_long() [L99] EXPR \read(var_1_12) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L99] CALL assume_abort_if_not(var_1_12 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L99] RET assume_abort_if_not(var_1_12 >= -1) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L100] EXPR \read(var_1_12) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L100] CALL assume_abort_if_not(var_1_12 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L100] RET assume_abort_if_not(var_1_12 <= 2147483646) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L101] var_1_13 = __VERIFIER_nondet_long() [L102] EXPR \read(var_1_13) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L103] EXPR \read(var_1_13) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L103] CALL assume_abort_if_not(var_1_13 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L103] RET assume_abort_if_not(var_1_13 <= 2147483646) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L104] var_1_15 = __VERIFIER_nondet_short() [L105] EXPR \read(var_1_15) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L105] CALL assume_abort_if_not(var_1_15 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L105] RET assume_abort_if_not(var_1_15 >= -32768) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L106] EXPR \read(var_1_15) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L106] CALL assume_abort_if_not(var_1_15 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L106] RET assume_abort_if_not(var_1_15 <= 32767) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L107] EXPR \read(var_1_15) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L107] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L107] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L108] var_1_16 = __VERIFIER_nondet_long() [L109] EXPR \read(var_1_16) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L109] CALL assume_abort_if_not(var_1_16 >= -1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L109] RET assume_abort_if_not(var_1_16 >= -1073741823) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L110] EXPR \read(var_1_16) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L110] CALL assume_abort_if_not(var_1_16 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L110] RET assume_abort_if_not(var_1_16 <= 1073741823) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L123] RET updateVariables() [L124] CALL step() [L55] signed long int stepLocal_0 = (((8) < 0 ) ? -(8) : (8)); [L56] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L56] COND TRUE (((((200) < (128)) ? (200) : (128))) - (*(var_1_2_Pointer))) > stepLocal_0 [L57] EXPR \read(*var_1_4_Pointer) [L57] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L57] EXPR (((*(var_1_4_Pointer))) < ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer))) [L57] EXPR \read(*var_1_4_Pointer) [L57] EXPR (((*(var_1_4_Pointer))) < ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L57] EXPR \read(*var_1_6_Pointer) [L57] (*(var_1_1_Pointer)) = ((((((*(var_1_4_Pointer))) < ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer))))) - (*(var_1_6_Pointer))) [L63] EXPR \read(*var_1_5_Pointer) [L63] EXPR \read(*var_1_6_Pointer) [L63] EXPR \read(*var_1_1_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L63] COND FALSE !(((*(var_1_5_Pointer)) + (*(var_1_6_Pointer))) == (*(var_1_1_Pointer))) [L66] EXPR \read(*var_1_13_Pointer) [L66] (*(var_1_11_Pointer)) = (*(var_1_13_Pointer)) [L68] EXPR \read(*var_1_12_Pointer) [L68] EXPR \read(*var_1_15_Pointer) [L68] signed long int stepLocal_1 = (*(var_1_12_Pointer)) % (*(var_1_15_Pointer)); [L69] EXPR \read(*var_1_9_Pointer) [L69] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L69] COND TRUE (*(var_1_9_Pointer)) == (*(var_1_4_Pointer)) [L70] EXPR \read(*var_1_13_Pointer) [L70] (*(var_1_14_Pointer)) = (*(var_1_13_Pointer)) [L124] RET step() [L125] CALL, EXPR property() [L115] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L115] EXPR ((((((200) < (128)) ? (200) : (128))) - (*(var_1_2_Pointer))) > ((((8) < 0 ) ? -(8) : (8)))) ? ((*(var_1_1_Pointer)) == ((float) ((((((*(var_1_4_Pointer))) < ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer))))) - (*(var_1_6_Pointer))))) : ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) ((((((*(var_1_8_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))))) : 1) [L115] EXPR \read(*var_1_1_Pointer) [L115] EXPR \read(*var_1_4_Pointer) [L115] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L115] EXPR (((*(var_1_4_Pointer))) < ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer))) [L115] EXPR \read(*var_1_4_Pointer) [L115] EXPR (((*(var_1_4_Pointer))) < ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L115] EXPR \read(*var_1_6_Pointer) [L115] EXPR ((((((200) < (128)) ? (200) : (128))) - (*(var_1_2_Pointer))) > ((((8) < 0 ) ? -(8) : (8)))) ? ((*(var_1_1_Pointer)) == ((float) ((((((*(var_1_4_Pointer))) < ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer))))) - (*(var_1_6_Pointer))))) : ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) ((((((*(var_1_8_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))))) : 1) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L115] EXPR (((((((200) < (128)) ? (200) : (128))) - (*(var_1_2_Pointer))) > ((((8) < 0 ) ? -(8) : (8)))) ? ((*(var_1_1_Pointer)) == ((float) ((((((*(var_1_4_Pointer))) < ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer))))) - (*(var_1_6_Pointer))))) : ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) ((((((*(var_1_8_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))))) : 1)) && ((((*(var_1_5_Pointer)) + (*(var_1_6_Pointer))) == (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed long int) ((((((*(var_1_2_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_12_Pointer))))) - (*(var_1_13_Pointer))))) : ((*(var_1_11_Pointer)) == ((signed long int) (*(var_1_13_Pointer))))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L115] EXPR (((((((200) < (128)) ? (200) : (128))) - (*(var_1_2_Pointer))) > ((((8) < 0 ) ? -(8) : (8)))) ? ((*(var_1_1_Pointer)) == ((float) ((((((*(var_1_4_Pointer))) < ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer))))) - (*(var_1_6_Pointer))))) : ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) ((((((*(var_1_8_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))))) : 1)) && ((((*(var_1_5_Pointer)) + (*(var_1_6_Pointer))) == (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed long int) ((((((*(var_1_2_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_12_Pointer))))) - (*(var_1_13_Pointer))))) : ((*(var_1_11_Pointer)) == ((signed long int) (*(var_1_13_Pointer))))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L115] EXPR ((((((((200) < (128)) ? (200) : (128))) - (*(var_1_2_Pointer))) > ((((8) < 0 ) ? -(8) : (8)))) ? ((*(var_1_1_Pointer)) == ((float) ((((((*(var_1_4_Pointer))) < ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer))))) - (*(var_1_6_Pointer))))) : ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) ((((((*(var_1_8_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))))) : 1)) && ((((*(var_1_5_Pointer)) + (*(var_1_6_Pointer))) == (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed long int) ((((((*(var_1_2_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_12_Pointer))))) - (*(var_1_13_Pointer))))) : ((*(var_1_11_Pointer)) == ((signed long int) (*(var_1_13_Pointer)))))) && (((*(var_1_9_Pointer)) == (*(var_1_4_Pointer))) ? ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_13_Pointer)))) : ((((*(var_1_12_Pointer)) % (*(var_1_15_Pointer))) != (*(var_1_13_Pointer))) ? ((*(var_1_14_Pointer)) == ((signed long int) (((((((*(var_1_15_Pointer)) + (*(var_1_2_Pointer))) + (*(var_1_16_Pointer)))) > ((*(var_1_13_Pointer)))) ? ((((*(var_1_15_Pointer)) + (*(var_1_2_Pointer))) + (*(var_1_16_Pointer)))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_16_Pointer)))))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L115] EXPR ((((((((200) < (128)) ? (200) : (128))) - (*(var_1_2_Pointer))) > ((((8) < 0 ) ? -(8) : (8)))) ? ((*(var_1_1_Pointer)) == ((float) ((((((*(var_1_4_Pointer))) < ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer))))) - (*(var_1_6_Pointer))))) : ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) ((((((*(var_1_8_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))))) : 1)) && ((((*(var_1_5_Pointer)) + (*(var_1_6_Pointer))) == (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed long int) ((((((*(var_1_2_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_12_Pointer))))) - (*(var_1_13_Pointer))))) : ((*(var_1_11_Pointer)) == ((signed long int) (*(var_1_13_Pointer)))))) && (((*(var_1_9_Pointer)) == (*(var_1_4_Pointer))) ? ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_13_Pointer)))) : ((((*(var_1_12_Pointer)) % (*(var_1_15_Pointer))) != (*(var_1_13_Pointer))) ? ((*(var_1_14_Pointer)) == ((signed long int) (((((((*(var_1_15_Pointer)) + (*(var_1_2_Pointer))) + (*(var_1_16_Pointer)))) > ((*(var_1_13_Pointer)))) ? ((((*(var_1_15_Pointer)) + (*(var_1_2_Pointer))) + (*(var_1_16_Pointer)))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_16_Pointer)))))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L115-L116] return ((((((((200) < (128)) ? (200) : (128))) - (*(var_1_2_Pointer))) > ((((8) < 0 ) ? -(8) : (8)))) ? ((*(var_1_1_Pointer)) == ((float) ((((((*(var_1_4_Pointer))) < ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer))))) - (*(var_1_6_Pointer))))) : ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) ((((((*(var_1_8_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))))) : 1)) && ((((*(var_1_5_Pointer)) + (*(var_1_6_Pointer))) == (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed long int) ((((((*(var_1_2_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_12_Pointer))))) - (*(var_1_13_Pointer))))) : ((*(var_1_11_Pointer)) == ((signed long int) (*(var_1_13_Pointer)))))) && (((*(var_1_9_Pointer)) == (*(var_1_4_Pointer))) ? ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_13_Pointer)))) : ((((*(var_1_12_Pointer)) % (*(var_1_15_Pointer))) != (*(var_1_13_Pointer))) ? ((*(var_1_14_Pointer)) == ((signed long int) (((((((*(var_1_15_Pointer)) + (*(var_1_2_Pointer))) + (*(var_1_16_Pointer)))) > ((*(var_1_13_Pointer)))) ? ((((*(var_1_15_Pointer)) + (*(var_1_2_Pointer))) + (*(var_1_16_Pointer)))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_16_Pointer)))))) ; [L125] RET, EXPR property() [L125] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L19] reach_error() VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 118 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 5, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 48 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 48 mSDsluCounter, 1927 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1272 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 132 IncrementalHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 655 mSDtfsCounter, 132 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 189 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=4, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 24 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 908 NumberOfCodeBlocks, 908 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 600 ConstructedInterpolants, 0 QuantifiedInterpolants, 734 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 2736/2736 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:44:30,989 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-99.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 133276d09bc7c3b73c8695fd51c915a857a4b525f277730197e5bde79d3ce970 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:44:32,731 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:44:32,790 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:44:32,799 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:44:32,800 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:44:32,824 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:44:32,826 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:44:32,826 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:44:32,827 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:44:32,829 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:44:32,829 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:44:32,830 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:44:32,830 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:44:32,830 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:44:32,830 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:44:32,831 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:44:32,831 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:44:32,831 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:44:32,831 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:44:32,831 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:44:32,831 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:44:32,832 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:44:32,833 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:44:32,833 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 13:44:32,833 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 13:44:32,833 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:44:32,833 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 13:44:32,833 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:44:32,833 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:44:32,834 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:44:32,834 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:44:32,834 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:44:32,834 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:44:32,834 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:44:32,834 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:44:32,835 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:44:32,835 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:44:32,835 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:44:32,835 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 13:44:32,835 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 13:44:32,835 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:44:32,838 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:44:32,838 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:44:32,838 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:44:32,838 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 13:44:32,838 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 -> 133276d09bc7c3b73c8695fd51c915a857a4b525f277730197e5bde79d3ce970 [2024-10-11 13:44:33,085 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:44:33,100 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:44:33,102 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:44:33,104 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:44:33,105 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:44:33,106 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-99.i [2024-10-11 13:44:34,373 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:44:34,548 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:44:34,548 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-99.i [2024-10-11 13:44:34,556 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/222fa8c52/c30c158d9fe14636820176dc9916a280/FLAGb52ed8897 [2024-10-11 13:44:34,568 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/222fa8c52/c30c158d9fe14636820176dc9916a280 [2024-10-11 13:44:34,570 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:44:34,571 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:44:34,572 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:44:34,572 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:44:34,576 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:44:34,577 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:44:34" (1/1) ... [2024-10-11 13:44:34,577 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3848cbd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:34, skipping insertion in model container [2024-10-11 13:44:34,577 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:44:34" (1/1) ... [2024-10-11 13:44:34,602 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:44:34,741 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-99.i[916,929] [2024-10-11 13:44:34,808 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:44:34,827 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:44:34,860 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-99.i[916,929] [2024-10-11 13:44:34,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:44:34,917 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:44:34,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:34 WrapperNode [2024-10-11 13:44:34,918 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:44:34,919 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:44:34,919 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:44:34,919 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:44:34,924 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:44:34" (1/1) ... [2024-10-11 13:44:34,942 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:44:34" (1/1) ... [2024-10-11 13:44:34,984 INFO L138 Inliner]: procedures = 36, calls = 197, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 589 [2024-10-11 13:44:34,985 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:44:34,985 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:44:34,987 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:44:34,987 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:44:34,996 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:34" (1/1) ... [2024-10-11 13:44:34,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:34" (1/1) ... [2024-10-11 13:44:35,005 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:34" (1/1) ... [2024-10-11 13:44:35,043 INFO L175 MemorySlicer]: Split 152 memory accesses to 16 slices as follows [2, 7, 14, 12, 12, 10, 6, 10, 12, 8, 5, 10, 16, 7, 11, 10]. 11 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 19 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 3, 1, 1]. [2024-10-11 13:44:35,045 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:34" (1/1) ... [2024-10-11 13:44:35,045 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:34" (1/1) ... [2024-10-11 13:44:35,070 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:34" (1/1) ... [2024-10-11 13:44:35,077 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:34" (1/1) ... [2024-10-11 13:44:35,086 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:34" (1/1) ... [2024-10-11 13:44:35,096 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:34" (1/1) ... [2024-10-11 13:44:35,106 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:44:35,110 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:44:35,110 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:44:35,110 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:44:35,111 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:34" (1/1) ... [2024-10-11 13:44:35,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:44:35,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:44:35,138 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:44:35,140 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:44:35,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:44:35,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 13:44:35,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 13:44:35,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 13:44:35,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-11 13:44:35,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-11 13:44:35,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-11 13:44:35,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-10-11 13:44:35,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-10-11 13:44:35,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-10-11 13:44:35,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-10-11 13:44:35,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-10-11 13:44:35,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-10-11 13:44:35,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-10-11 13:44:35,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2024-10-11 13:44:35,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2024-10-11 13:44:35,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#15 [2024-10-11 13:44:35,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-11 13:44:35,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-11 13:44:35,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-11 13:44:35,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-11 13:44:35,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-11 13:44:35,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-10-11 13:44:35,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-10-11 13:44:35,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-10-11 13:44:35,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-10-11 13:44:35,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-10-11 13:44:35,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-10-11 13:44:35,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2024-10-11 13:44:35,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2024-10-11 13:44:35,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2024-10-11 13:44:35,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#14 [2024-10-11 13:44:35,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#15 [2024-10-11 13:44:35,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 13:44:35,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 13:44:35,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 13:44:35,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-11 13:44:35,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-11 13:44:35,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-11 13:44:35,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-10-11 13:44:35,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-10-11 13:44:35,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-10-11 13:44:35,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-10-11 13:44:35,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-10-11 13:44:35,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-10-11 13:44:35,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-10-11 13:44:35,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2024-10-11 13:44:35,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2024-10-11 13:44:35,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#15 [2024-10-11 13:44:35,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-11 13:44:35,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-11 13:44:35,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-11 13:44:35,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-11 13:44:35,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-10-11 13:44:35,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-10-11 13:44:35,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-10-11 13:44:35,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-10-11 13:44:35,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-10-11 13:44:35,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-10-11 13:44:35,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2024-10-11 13:44:35,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2024-10-11 13:44:35,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2024-10-11 13:44:35,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2024-10-11 13:44:35,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#14 [2024-10-11 13:44:35,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#15 [2024-10-11 13:44:35,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-11 13:44:35,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-11 13:44:35,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-11 13:44:35,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-11 13:44:35,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-11 13:44:35,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-10-11 13:44:35,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-10-11 13:44:35,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-10-11 13:44:35,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2024-10-11 13:44:35,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2024-10-11 13:44:35,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2024-10-11 13:44:35,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2024-10-11 13:44:35,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2024-10-11 13:44:35,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#13 [2024-10-11 13:44:35,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#14 [2024-10-11 13:44:35,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#15 [2024-10-11 13:44:35,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 13:44:35,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 13:44:35,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-11 13:44:35,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-11 13:44:35,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-10-11 13:44:35,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-10-11 13:44:35,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-10-11 13:44:35,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-10-11 13:44:35,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-10-11 13:44:35,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-10-11 13:44:35,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2024-10-11 13:44:35,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2024-10-11 13:44:35,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2024-10-11 13:44:35,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2024-10-11 13:44:35,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#14 [2024-10-11 13:44:35,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#15 [2024-10-11 13:44:35,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-11 13:44:35,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-11 13:44:35,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-11 13:44:35,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-11 13:44:35,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-11 13:44:35,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-10-11 13:44:35,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-10-11 13:44:35,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-10-11 13:44:35,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2024-10-11 13:44:35,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2024-10-11 13:44:35,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2024-10-11 13:44:35,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2024-10-11 13:44:35,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2024-10-11 13:44:35,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#13 [2024-10-11 13:44:35,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#14 [2024-10-11 13:44:35,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#15 [2024-10-11 13:44:35,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-11 13:44:35,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-11 13:44:35,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-11 13:44:35,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-11 13:44:35,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-11 13:44:35,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-10-11 13:44:35,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-10-11 13:44:35,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-10-11 13:44:35,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2024-10-11 13:44:35,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2024-10-11 13:44:35,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2024-10-11 13:44:35,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2024-10-11 13:44:35,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2024-10-11 13:44:35,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#13 [2024-10-11 13:44:35,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#14 [2024-10-11 13:44:35,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#15 [2024-10-11 13:44:35,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-11 13:44:35,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-11 13:44:35,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-11 13:44:35,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-11 13:44:35,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-11 13:44:35,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-10-11 13:44:35,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-10-11 13:44:35,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-10-11 13:44:35,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2024-10-11 13:44:35,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2024-10-11 13:44:35,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2024-10-11 13:44:35,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2024-10-11 13:44:35,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2024-10-11 13:44:35,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#13 [2024-10-11 13:44:35,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#14 [2024-10-11 13:44:35,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#15 [2024-10-11 13:44:35,196 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:44:35,196 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:44:35,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:44:35,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:44:35,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-11 13:44:35,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-11 13:44:35,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-11 13:44:35,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-11 13:44:35,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-11 13:44:35,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-11 13:44:35,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-10-11 13:44:35,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-10-11 13:44:35,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-10-11 13:44:35,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-10-11 13:44:35,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-10-11 13:44:35,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-10-11 13:44:35,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-10-11 13:44:35,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2024-10-11 13:44:35,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2024-10-11 13:44:35,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#15 [2024-10-11 13:44:35,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-11 13:44:35,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-11 13:44:35,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-11 13:44:35,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-11 13:44:35,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-11 13:44:35,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-10-11 13:44:35,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-10-11 13:44:35,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-10-11 13:44:35,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2024-10-11 13:44:35,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2024-10-11 13:44:35,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2024-10-11 13:44:35,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2024-10-11 13:44:35,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2024-10-11 13:44:35,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#13 [2024-10-11 13:44:35,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#14 [2024-10-11 13:44:35,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#15 [2024-10-11 13:44:35,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 13:44:35,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 13:44:35,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-11 13:44:35,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-11 13:44:35,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-10-11 13:44:35,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-10-11 13:44:35,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-10-11 13:44:35,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-10-11 13:44:35,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-10-11 13:44:35,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2024-10-11 13:44:35,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2024-10-11 13:44:35,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2024-10-11 13:44:35,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2024-10-11 13:44:35,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2024-10-11 13:44:35,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#14 [2024-10-11 13:44:35,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#15 [2024-10-11 13:44:35,446 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:44:35,447 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:44:36,228 INFO L? ?]: Removed 159 outVars from TransFormulas that were not future-live. [2024-10-11 13:44:36,229 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:44:36,267 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:44:36,267 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:44:36,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:44:36 BoogieIcfgContainer [2024-10-11 13:44:36,267 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:44:36,269 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:44:36,269 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:44:36,272 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:44:36,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:44:34" (1/3) ... [2024-10-11 13:44:36,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@540eced9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:44:36, skipping insertion in model container [2024-10-11 13:44:36,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:34" (2/3) ... [2024-10-11 13:44:36,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@540eced9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:44:36, skipping insertion in model container [2024-10-11 13:44:36,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:44:36" (3/3) ... [2024-10-11 13:44:36,275 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-99.i [2024-10-11 13:44:36,287 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:44:36,287 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:44:36,351 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:44:36,356 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;@43217f15, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:44:36,356 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:44:36,360 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 96 states have (on average 1.4479166666666667) internal successors, (139), 97 states have internal predecessors, (139), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 13:44:36,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 13:44:36,374 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:36,374 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:36,374 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:36,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:36,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1878662179, now seen corresponding path program 1 times [2024-10-11 13:44:36,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:44:36,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1992285769] [2024-10-11 13:44:36,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:36,394 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:44:36,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:44:36,399 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:44:36,400 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:44:36,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:36,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 13:44:36,849 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:44:36,883 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2024-10-11 13:44:36,883 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:44:36,883 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:44:36,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1992285769] [2024-10-11 13:44:36,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1992285769] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:44:36,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:44:36,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:44:36,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414191473] [2024-10-11 13:44:36,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:44:36,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:44:36,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:44:36,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:44:36,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:44:36,918 INFO L87 Difference]: Start difference. First operand has 118 states, 96 states have (on average 1.4479166666666667) internal successors, (139), 97 states have internal predecessors, (139), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) 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, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 13:44:36,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:44:36,958 INFO L93 Difference]: Finished difference Result 233 states and 371 transitions. [2024-10-11 13:44:36,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:44:36,960 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, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 151 [2024-10-11 13:44:36,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:44:36,970 INFO L225 Difference]: With dead ends: 233 [2024-10-11 13:44:36,971 INFO L226 Difference]: Without dead ends: 116 [2024-10-11 13:44:36,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 150 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:44:36,975 INFO L432 NwaCegarLoop]: 168 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, 168 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:44:36,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:44:36,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-11 13:44:37,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-10-11 13:44:37,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 95 states have (on average 1.4105263157894736) internal successors, (134), 95 states have internal predecessors, (134), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 13:44:37,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 172 transitions. [2024-10-11 13:44:37,018 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 172 transitions. Word has length 151 [2024-10-11 13:44:37,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:44:37,018 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 172 transitions. [2024-10-11 13:44:37,018 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, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 13:44:37,019 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 172 transitions. [2024-10-11 13:44:37,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 13:44:37,027 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:37,027 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:37,052 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 (2)] Forceful destruction successful, exit code 0 [2024-10-11 13:44:37,228 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:44:37,228 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:37,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:37,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1581907829, now seen corresponding path program 1 times [2024-10-11 13:44:37,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:44:37,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1636060512] [2024-10-11 13:44:37,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:37,230 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:44:37,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:44:37,232 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:44:37,233 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:44:37,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:37,624 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 13:44:37,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:44:37,665 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2024-10-11 13:44:37,665 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:44:37,665 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:44:37,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1636060512] [2024-10-11 13:44:37,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1636060512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:44:37,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:44:37,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:44:37,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675389559] [2024-10-11 13:44:37,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:44:37,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:44:37,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:44:37,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:44:37,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:44:37,668 INFO L87 Difference]: Start difference. First operand 116 states and 172 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 13:44:37,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:44:37,712 INFO L93 Difference]: Finished difference Result 233 states and 346 transitions. [2024-10-11 13:44:37,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:44:37,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 151 [2024-10-11 13:44:37,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:44:37,713 INFO L225 Difference]: With dead ends: 233 [2024-10-11 13:44:37,713 INFO L226 Difference]: Without dead ends: 118 [2024-10-11 13:44:37,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 148 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:44:37,715 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:44:37,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 491 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:44:37,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-11 13:44:37,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-10-11 13:44:37,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 97 states have (on average 1.402061855670103) internal successors, (136), 97 states have internal predecessors, (136), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 13:44:37,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 174 transitions. [2024-10-11 13:44:37,724 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 174 transitions. Word has length 151 [2024-10-11 13:44:37,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:44:37,725 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 174 transitions. [2024-10-11 13:44:37,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 13:44:37,725 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 174 transitions. [2024-10-11 13:44:37,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 13:44:37,726 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:37,727 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:37,739 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 (3)] Forceful destruction successful, exit code 0 [2024-10-11 13:44:37,930 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:44:37,931 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:37,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:37,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1512259955, now seen corresponding path program 1 times [2024-10-11 13:44:37,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:44:37,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [818486098] [2024-10-11 13:44:37,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:37,932 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:44:37,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:44:37,934 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:44:37,935 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:44:38,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:38,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 13:44:38,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:44:38,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-10-11 13:44:38,754 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 17 proven. 123 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:44:38,754 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:44:38,923 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 13:44:38,924 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:44:38,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [818486098] [2024-10-11 13:44:38,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [818486098] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:44:38,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:44:38,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2024-10-11 13:44:38,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752175958] [2024-10-11 13:44:38,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:44:38,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:44:38,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:44:38,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:44:38,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:44:38,926 INFO L87 Difference]: Start difference. First operand 118 states and 174 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 13:44:39,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:44:39,234 INFO L93 Difference]: Finished difference Result 270 states and 397 transitions. [2024-10-11 13:44:39,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:44:39,235 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-10-11 13:44:39,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:44:39,236 INFO L225 Difference]: With dead ends: 270 [2024-10-11 13:44:39,237 INFO L226 Difference]: Without dead ends: 153 [2024-10-11 13:44:39,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-10-11 13:44:39,238 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 96 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:44:39,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 462 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:44:39,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-10-11 13:44:39,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 129. [2024-10-11 13:44:39,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 108 states have (on average 1.4074074074074074) internal successors, (152), 108 states have internal predecessors, (152), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 13:44:39,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 190 transitions. [2024-10-11 13:44:39,246 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 190 transitions. Word has length 151 [2024-10-11 13:44:39,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:44:39,246 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 190 transitions. [2024-10-11 13:44:39,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 13:44:39,246 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 190 transitions. [2024-10-11 13:44:39,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 13:44:39,251 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:39,251 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:39,265 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:44:39,451 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:44:39,452 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:39,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:39,452 INFO L85 PathProgramCache]: Analyzing trace with hash -610609268, now seen corresponding path program 1 times [2024-10-11 13:44:39,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:44:39,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1546940005] [2024-10-11 13:44:39,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:39,453 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:44:39,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:44:39,455 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:44:39,456 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:44:39,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:39,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 13:44:39,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:44:39,842 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 13:44:39,842 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:44:39,842 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:44:39,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1546940005] [2024-10-11 13:44:39,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1546940005] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:44:39,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:44:39,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:44:39,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332770334] [2024-10-11 13:44:39,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:44:39,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:44:39,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:44:39,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:44:39,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:44:39,844 INFO L87 Difference]: Start difference. First operand 129 states and 190 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 13:44:39,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:44:39,964 INFO L93 Difference]: Finished difference Result 260 states and 383 transitions. [2024-10-11 13:44:39,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:44:39,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-10-11 13:44:39,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:44:39,966 INFO L225 Difference]: With dead ends: 260 [2024-10-11 13:44:39,966 INFO L226 Difference]: Without dead ends: 132 [2024-10-11 13:44:39,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:44:39,967 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:44:39,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 651 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:44:39,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-11 13:44:39,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-10-11 13:44:39,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 111 states have (on average 1.3963963963963963) internal successors, (155), 111 states have internal predecessors, (155), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 13:44:39,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 193 transitions. [2024-10-11 13:44:39,977 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 193 transitions. Word has length 151 [2024-10-11 13:44:39,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:44:39,978 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 193 transitions. [2024-10-11 13:44:39,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 13:44:39,978 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 193 transitions. [2024-10-11 13:44:39,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 13:44:39,979 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:39,979 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:39,992 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:44:40,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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:44:40,180 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:40,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:40,180 INFO L85 PathProgramCache]: Analyzing trace with hash -823042281, now seen corresponding path program 1 times [2024-10-11 13:44:40,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:44:40,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1781493138] [2024-10-11 13:44:40,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:40,181 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:44:40,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:44:40,183 INFO L229 MonitoredProcess]: Starting monitored process 6 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:44:40,184 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 (6)] Waiting until timeout for monitored process [2024-10-11 13:44:40,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:40,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 13:44:40,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:44:40,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 41 [2024-10-11 13:44:40,656 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2024-10-11 13:44:40,656 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:44:40,656 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:44:40,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1781493138] [2024-10-11 13:44:40,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1781493138] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:44:40,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:44:40,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:44:40,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659399610] [2024-10-11 13:44:40,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:44:40,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:44:40,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:44:40,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:44:40,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:44:40,658 INFO L87 Difference]: Start difference. First operand 132 states and 193 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 13:44:41,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:44:41,255 INFO L93 Difference]: Finished difference Result 263 states and 385 transitions. [2024-10-11 13:44:41,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:44:41,255 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 152 [2024-10-11 13:44:41,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:44:41,256 INFO L225 Difference]: With dead ends: 263 [2024-10-11 13:44:41,256 INFO L226 Difference]: Without dead ends: 132 [2024-10-11 13:44:41,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:44:41,258 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 161 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:44:41,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 494 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 13:44:41,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-11 13:44:41,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2024-10-11 13:44:41,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 109 states have (on average 1.3944954128440368) internal successors, (152), 109 states have internal predecessors, (152), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 13:44:41,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 190 transitions. [2024-10-11 13:44:41,264 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 190 transitions. Word has length 152 [2024-10-11 13:44:41,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:44:41,264 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 190 transitions. [2024-10-11 13:44:41,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 13:44:41,265 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 190 transitions. [2024-10-11 13:44:41,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-11 13:44:41,266 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:41,266 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:41,279 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 (6)] Forceful destruction successful, exit code 0 [2024-10-11 13:44:41,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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:44:41,466 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:41,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:41,467 INFO L85 PathProgramCache]: Analyzing trace with hash 614300239, now seen corresponding path program 1 times [2024-10-11 13:44:41,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:44:41,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1181901917] [2024-10-11 13:44:41,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:41,467 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:44:41,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:44:41,468 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:44:41,469 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:44:41,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:41,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 13:44:41,849 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:44:41,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 40 [2024-10-11 13:44:41,947 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 192 proven. 8 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2024-10-11 13:44:41,948 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:44:42,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 22 [2024-10-11 13:44:42,093 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 6 proven. 48 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-11 13:44:42,094 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:44:42,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1181901917] [2024-10-11 13:44:42,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1181901917] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:44:42,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:44:42,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-10-11 13:44:42,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106335852] [2024-10-11 13:44:42,094 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:44:42,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 13:44:42,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:44:42,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 13:44:42,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:44:42,095 INFO L87 Difference]: Start difference. First operand 130 states and 190 transitions. Second operand has 12 states, 11 states have (on average 7.363636363636363) internal successors, (81), 12 states have internal predecessors, (81), 4 states have call successors, (37), 3 states have call predecessors, (37), 4 states have return successors, (37), 3 states have call predecessors, (37), 4 states have call successors, (37) [2024-10-11 13:44:43,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:44:43,105 INFO L93 Difference]: Finished difference Result 272 states and 394 transitions. [2024-10-11 13:44:43,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 13:44:43,106 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.363636363636363) internal successors, (81), 12 states have internal predecessors, (81), 4 states have call successors, (37), 3 states have call predecessors, (37), 4 states have return successors, (37), 3 states have call predecessors, (37), 4 states have call successors, (37) Word has length 154 [2024-10-11 13:44:43,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:44:43,107 INFO L225 Difference]: With dead ends: 272 [2024-10-11 13:44:43,107 INFO L226 Difference]: Without dead ends: 132 [2024-10-11 13:44:43,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-10-11 13:44:43,108 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 162 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 13:44:43,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 806 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 13:44:43,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-11 13:44:43,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2024-10-11 13:44:43,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 109 states have (on average 1.3761467889908257) internal successors, (150), 109 states have internal predecessors, (150), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 13:44:43,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 188 transitions. [2024-10-11 13:44:43,114 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 188 transitions. Word has length 154 [2024-10-11 13:44:43,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:44:43,114 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 188 transitions. [2024-10-11 13:44:43,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.363636363636363) internal successors, (81), 12 states have internal predecessors, (81), 4 states have call successors, (37), 3 states have call predecessors, (37), 4 states have return successors, (37), 3 states have call predecessors, (37), 4 states have call successors, (37) [2024-10-11 13:44:43,114 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 188 transitions. [2024-10-11 13:44:43,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-11 13:44:43,115 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:43,115 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:43,129 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 (7)] Ended with exit code 0 [2024-10-11 13:44:43,319 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 [2024-10-11 13:44:43,320 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:43,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:43,320 INFO L85 PathProgramCache]: Analyzing trace with hash 203689873, now seen corresponding path program 1 times [2024-10-11 13:44:43,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:44:43,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [935572916] [2024-10-11 13:44:43,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:43,321 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:44:43,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:44:43,322 INFO L229 MonitoredProcess]: Starting monitored process 8 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:44:43,323 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 (8)] Waiting until timeout for monitored process [2024-10-11 13:44:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:43,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-11 13:44:43,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:44:46,036 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 70 treesize of output 34 [2024-10-11 13:44:46,043 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 68 treesize of output 32 [2024-10-11 13:44:46,126 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 5 proven. 415 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:44:46,126 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:44:46,474 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:44:46,474 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 91 treesize of output 66 [2024-10-11 13:44:46,873 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:44:46,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [935572916] [2024-10-11 13:44:46,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [935572916] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:44:46,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1996104032] [2024-10-11 13:44:46,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:46,874 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 13:44:46,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 13:44:46,876 INFO L229 MonitoredProcess]: Starting monitored process 9 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:44:46,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-10-11 13:44:48,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:48,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 13:44:48,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:44:48,501 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:44:48,728 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2024-10-11 13:44:48,729 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:44:48,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1996104032] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:44:48,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:44:48,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [16] total 20 [2024-10-11 13:44:48,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349841072] [2024-10-11 13:44:48,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:44:48,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:44:48,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:44:48,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:44:48,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=609, Unknown=0, NotChecked=0, Total=702 [2024-10-11 13:44:48,731 INFO L87 Difference]: Start difference. First operand 130 states and 188 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 13:44:49,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:44:49,500 INFO L93 Difference]: Finished difference Result 261 states and 378 transitions. [2024-10-11 13:44:49,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:44:49,501 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 154 [2024-10-11 13:44:49,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:44:49,502 INFO L225 Difference]: With dead ends: 261 [2024-10-11 13:44:49,502 INFO L226 Difference]: Without dead ends: 132 [2024-10-11 13:44:49,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 372 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2024-10-11 13:44:49,503 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 152 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 13:44:49,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 389 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 13:44:49,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-11 13:44:49,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-10-11 13:44:49,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 111 states have (on average 1.3693693693693694) internal successors, (152), 111 states have internal predecessors, (152), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 13:44:49,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 190 transitions. [2024-10-11 13:44:49,511 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 190 transitions. Word has length 154 [2024-10-11 13:44:49,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:44:49,512 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 190 transitions. [2024-10-11 13:44:49,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 13:44:49,512 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 190 transitions. [2024-10-11 13:44:49,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-11 13:44:49,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:49,513 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:49,526 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 (8)] Forceful destruction successful, exit code 0 [2024-10-11 13:44:49,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2024-10-11 13:44:49,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 13:44:49,914 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:49,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:49,914 INFO L85 PathProgramCache]: Analyzing trace with hash -744362093, now seen corresponding path program 1 times [2024-10-11 13:44:49,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:44:49,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1855171614] [2024-10-11 13:44:49,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:49,915 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:44:49,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:44:49,916 INFO L229 MonitoredProcess]: Starting monitored process 10 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:44:49,917 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 (10)] Waiting until timeout for monitored process [2024-10-11 13:44:50,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:50,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 13:44:50,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:44:50,303 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2024-10-11 13:44:50,303 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:44:50,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:44:50,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1855171614] [2024-10-11 13:44:50,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1855171614] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:44:50,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:44:50,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:44:50,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019139489] [2024-10-11 13:44:50,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:44:50,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:44:50,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:44:50,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:44:50,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:44:50,305 INFO L87 Difference]: Start difference. First operand 132 states and 190 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 13:44:50,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:44:50,347 INFO L93 Difference]: Finished difference Result 263 states and 379 transitions. [2024-10-11 13:44:50,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:44:50,347 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), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 154 [2024-10-11 13:44:50,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:44:50,348 INFO L225 Difference]: With dead ends: 263 [2024-10-11 13:44:50,348 INFO L226 Difference]: Without dead ends: 132 [2024-10-11 13:44:50,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 151 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:44:50,349 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 483 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.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:44:50,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 483 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:44:50,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-11 13:44:50,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2024-10-11 13:44:50,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 109 states have (on average 1.3669724770642202) internal successors, (149), 109 states have internal predecessors, (149), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 13:44:50,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 187 transitions. [2024-10-11 13:44:50,355 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 187 transitions. Word has length 154 [2024-10-11 13:44:50,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:44:50,355 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 187 transitions. [2024-10-11 13:44:50,355 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), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 13:44:50,356 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 187 transitions. [2024-10-11 13:44:50,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-11 13:44:50,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:50,356 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:50,371 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 (10)] Ended with exit code 0 [2024-10-11 13:44:50,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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:44:50,557 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:50,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:50,557 INFO L85 PathProgramCache]: Analyzing trace with hash -426536745, now seen corresponding path program 1 times [2024-10-11 13:44:50,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:44:50,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1179040815] [2024-10-11 13:44:50,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:50,558 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:44:50,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:44:50,560 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:44:50,561 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:44:50,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:50,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-11 13:44:50,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:44:53,075 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 70 treesize of output 34 [2024-10-11 13:44:53,082 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 68 treesize of output 32 [2024-10-11 13:44:53,155 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 5 proven. 415 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:44:53,155 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:44:53,479 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:44:53,479 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 91 treesize of output 66 [2024-10-11 13:44:53,797 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:44:53,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1179040815] [2024-10-11 13:44:53,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1179040815] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:44:53,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [912006257] [2024-10-11 13:44:53,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:53,797 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 13:44:53,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 13:44:53,799 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:44:53,800 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:44:55,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:55,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 13:44:55,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:44:55,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 41 [2024-10-11 13:44:55,334 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2024-10-11 13:44:55,334 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:44:55,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [912006257] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:44:55,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:44:55,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [16] total 20 [2024-10-11 13:44:55,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281954000] [2024-10-11 13:44:55,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:44:55,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:44:55,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:44:55,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:44:55,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2024-10-11 13:44:55,336 INFO L87 Difference]: Start difference. First operand 130 states and 187 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 13:44:55,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:44:55,923 INFO L93 Difference]: Finished difference Result 260 states and 374 transitions. [2024-10-11 13:44:55,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:44:55,923 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 156 [2024-10-11 13:44:55,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:44:55,924 INFO L225 Difference]: With dead ends: 260 [2024-10-11 13:44:55,924 INFO L226 Difference]: Without dead ends: 131 [2024-10-11 13:44:55,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 376 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=118, Invalid=752, Unknown=0, NotChecked=0, Total=870 [2024-10-11 13:44:55,925 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 141 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:44:55,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 482 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 13:44:55,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-11 13:44:55,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2024-10-11 13:44:55,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 109 states have (on average 1.3577981651376148) internal successors, (148), 109 states have internal predecessors, (148), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 13:44:55,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 186 transitions. [2024-10-11 13:44:55,936 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 186 transitions. Word has length 156 [2024-10-11 13:44:55,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:44:55,937 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 186 transitions. [2024-10-11 13:44:55,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 13:44:55,938 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 186 transitions. [2024-10-11 13:44:55,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-11 13:44:55,938 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:55,938 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:55,952 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:44:56,151 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:44:56,339 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:44:56,339 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:56,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:56,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1071407279, now seen corresponding path program 1 times [2024-10-11 13:44:56,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:44:56,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [341110635] [2024-10-11 13:44:56,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:56,340 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:44:56,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:44:56,341 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:44:56,342 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:44:56,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:56,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-11 13:44:56,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:44:58,841 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 70 treesize of output 34 [2024-10-11 13:44:58,847 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 68 treesize of output 32 [2024-10-11 13:44:58,926 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 5 proven. 415 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:44:58,926 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:44:59,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:44:59,234 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 91 treesize of output 66 [2024-10-11 13:44:59,584 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:44:59,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [341110635] [2024-10-11 13:44:59,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [341110635] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:44:59,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1754599263] [2024-10-11 13:44:59,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:59,585 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 13:44:59,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 13:44:59,586 INFO L229 MonitoredProcess]: Starting monitored process 14 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:44:59,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2024-10-11 13:45:00,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:00,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-11 13:45:00,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:45:01,199 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:45:03,907 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:45:05,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 22 [2024-10-11 13:45:05,465 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 68 treesize of output 32 [2024-10-11 13:45:05,586 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 5 proven. 415 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:45:05,586 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:45:05,763 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 86 treesize of output 74 [2024-10-11 13:45:05,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1754599263] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:45:05,964 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:45:05,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 30 [2024-10-11 13:45:05,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969548951] [2024-10-11 13:45:05,965 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:45:05,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-11 13:45:05,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:45:05,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-11 13:45:05,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1272, Unknown=0, NotChecked=0, Total=1482 [2024-10-11 13:45:05,966 INFO L87 Difference]: Start difference. First operand 130 states and 186 transitions. Second operand has 31 states, 29 states have (on average 4.793103448275862) internal successors, (139), 28 states have internal predecessors, (139), 8 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 6 states have call predecessors, (38), 8 states have call successors, (38) [2024-10-11 13:45:12,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:45:12,212 INFO L93 Difference]: Finished difference Result 361 states and 513 transitions. [2024-10-11 13:45:12,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 13:45:12,216 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 4.793103448275862) internal successors, (139), 28 states have internal predecessors, (139), 8 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 6 states have call predecessors, (38), 8 states have call successors, (38) Word has length 158 [2024-10-11 13:45:12,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:45:12,217 INFO L225 Difference]: With dead ends: 361 [2024-10-11 13:45:12,217 INFO L226 Difference]: Without dead ends: 232 [2024-10-11 13:45:12,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 461 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 799 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=589, Invalid=2717, Unknown=0, NotChecked=0, Total=3306 [2024-10-11 13:45:12,219 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 1488 mSDsluCounter, 1384 mSDsCounter, 0 mSdLazyCounter, 1657 mSolverCounterSat, 400 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1488 SdHoareTripleChecker+Valid, 1485 SdHoareTripleChecker+Invalid, 2057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 400 IncrementalHoareTripleChecker+Valid, 1657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:45:12,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1488 Valid, 1485 Invalid, 2057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [400 Valid, 1657 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-11 13:45:12,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-10-11 13:45:12,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 225. [2024-10-11 13:45:12,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 189 states have (on average 1.3544973544973544) internal successors, (256), 190 states have internal predecessors, (256), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 13:45:12,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 320 transitions. [2024-10-11 13:45:12,236 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 320 transitions. Word has length 158 [2024-10-11 13:45:12,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:45:12,237 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 320 transitions. [2024-10-11 13:45:12,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 4.793103448275862) internal successors, (139), 28 states have internal predecessors, (139), 8 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 6 states have call predecessors, (38), 8 states have call successors, (38) [2024-10-11 13:45:12,237 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 320 transitions. [2024-10-11 13:45:12,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-11 13:45:12,239 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:45:12,239 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:12,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2024-10-11 13:45:12,453 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:45:12,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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:45:12,640 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:45:12,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:45:12,641 INFO L85 PathProgramCache]: Analyzing trace with hash 805655951, now seen corresponding path program 1 times [2024-10-11 13:45:12,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:45:12,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1688128045] [2024-10-11 13:45:12,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:45:12,641 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:45:12,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:45:12,642 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:45:12,643 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:45:13,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:13,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 13:45:13,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:45:13,027 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 352 proven. 0 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2024-10-11 13:45:13,027 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:45:13,027 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:45:13,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1688128045] [2024-10-11 13:45:13,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1688128045] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:45:13,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:45:13,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:45:13,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303360150] [2024-10-11 13:45:13,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:45:13,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:45:13,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:45:13,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:45:13,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:45:13,028 INFO L87 Difference]: Start difference. First operand 225 states and 320 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 13:45:13,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:45:13,076 INFO L93 Difference]: Finished difference Result 449 states and 639 transitions. [2024-10-11 13:45:13,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:45:13,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 158 [2024-10-11 13:45:13,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:45:13,078 INFO L225 Difference]: With dead ends: 449 [2024-10-11 13:45:13,078 INFO L226 Difference]: Without dead ends: 225 [2024-10-11 13:45:13,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 155 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:45:13,079 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 0 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:45:13,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 479 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:45:13,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-10-11 13:45:13,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2024-10-11 13:45:13,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 189 states have (on average 1.3492063492063493) internal successors, (255), 190 states have internal predecessors, (255), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 13:45:13,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 319 transitions. [2024-10-11 13:45:13,099 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 319 transitions. Word has length 158 [2024-10-11 13:45:13,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:45:13,099 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 319 transitions. [2024-10-11 13:45:13,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 13:45:13,100 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 319 transitions. [2024-10-11 13:45:13,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-11 13:45:13,102 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:45:13,102 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:13,116 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:45:13,302 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 [2024-10-11 13:45:13,303 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:45:13,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:45:13,303 INFO L85 PathProgramCache]: Analyzing trace with hash -445127661, now seen corresponding path program 1 times [2024-10-11 13:45:13,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:45:13,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1778419244] [2024-10-11 13:45:13,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:45:13,304 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:45:13,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:45:13,306 INFO L229 MonitoredProcess]: Starting monitored process 16 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:45:13,307 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 (16)] Waiting until timeout for monitored process [2024-10-11 13:45:23,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:24,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-11 13:45:24,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:45:26,869 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:45:30,333 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 58 [2024-10-11 13:45:31,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 116 treesize of output 68 [2024-10-11 13:45:53,804 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 165 treesize of output 105 [2024-10-11 13:45:59,798 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 15 proven. 301 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2024-10-11 13:45:59,798 INFO L311 TraceCheckSpWp]: Computing backward predicates...