./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/floats-esbmc-regression/digits_bad_for.c --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version 5e519f3a
Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/digits_bad_for.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --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 7a282122dc24d7edcdab0235b368fb11c8475c7879a31ec8b05ebbedfee80407
--- Real Ultimate output ---
[0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset.
This is Ultimate 0.2.2-dev-5e519f3
[2022-11-02 20:49:03,591 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-11-02 20:49:03,594 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-11-02 20:49:03,643 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-11-02 20:49:03,644 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-11-02 20:49:03,648 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-11-02 20:49:03,650 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-11-02 20:49:03,654 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-11-02 20:49:03,656 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-11-02 20:49:03,661 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-11-02 20:49:03,662 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-11-02 20:49:03,665 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-11-02 20:49:03,665 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-11-02 20:49:03,668 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-11-02 20:49:03,670 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-11-02 20:49:03,671 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-11-02 20:49:03,674 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-11-02 20:49:03,675 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-11-02 20:49:03,676 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-11-02 20:49:03,683 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-11-02 20:49:03,685 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-11-02 20:49:03,686 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-11-02 20:49:03,689 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-11-02 20:49:03,691 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-11-02 20:49:03,699 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-11-02 20:49:03,700 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-11-02 20:49:03,700 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-11-02 20:49:03,702 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-11-02 20:49:03,703 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-11-02 20:49:03,705 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-11-02 20:49:03,706 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-11-02 20:49:03,707 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-11-02 20:49:03,709 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-11-02 20:49:03,711 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-11-02 20:49:03,712 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-11-02 20:49:03,713 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-11-02 20:49:03,714 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-11-02 20:49:03,714 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-11-02 20:49:03,714 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-11-02 20:49:03,715 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-11-02 20:49:03,716 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-11-02 20:49:03,717 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf
[2022-11-02 20:49:03,755 INFO L113 SettingsManager]: Loading preferences was successful
[2022-11-02 20:49:03,756 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-11-02 20:49:03,757 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2022-11-02 20:49:03,757 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2022-11-02 20:49:03,758 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2022-11-02 20:49:03,758 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2022-11-02 20:49:03,759 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2022-11-02 20:49:03,760 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2022-11-02 20:49:03,760 INFO L138 SettingsManager]: * Use SBE=true
[2022-11-02 20:49:03,760 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-11-02 20:49:03,761 INFO L138 SettingsManager]: * sizeof long=4
[2022-11-02 20:49:03,762 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-11-02 20:49:03,762 INFO L138 SettingsManager]: * sizeof POINTER=4
[2022-11-02 20:49:03,762 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-11-02 20:49:03,763 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-11-02 20:49:03,763 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-11-02 20:49:03,763 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-11-02 20:49:03,764 INFO L138 SettingsManager]: * sizeof long double=12
[2022-11-02 20:49:03,764 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-11-02 20:49:03,764 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-11-02 20:49:03,765 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-11-02 20:49:03,765 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-11-02 20:49:03,765 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-11-02 20:49:03,766 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-11-02 20:49:03,766 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-11-02 20:49:03,766 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-11-02 20:49:03,767 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2022-11-02 20:49:03,767 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2022-11-02 20:49:03,767 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2022-11-02 20:49:03,768 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2022-11-02 20:49:03,768 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2022-11-02 20:49:03,768 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2022-11-02 20:49:03,769 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-11-02 20:49:03,769 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
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 -> 7a282122dc24d7edcdab0235b368fb11c8475c7879a31ec8b05ebbedfee80407
[2022-11-02 20:49:04,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-11-02 20:49:04,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-11-02 20:49:04,149 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-11-02 20:49:04,151 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-11-02 20:49:04,151 INFO L275 PluginConnector]: CDTParser initialized
[2022-11-02 20:49:04,153 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/floats-esbmc-regression/digits_bad_for.c
[2022-11-02 20:49:04,235 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/data/f410e604f/d4eb7ad13bc54d5f8b954b4edfe3e72f/FLAG57cb5ae74
[2022-11-02 20:49:04,712 INFO L306 CDTParser]: Found 1 translation units.
[2022-11-02 20:49:04,713 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/sv-benchmarks/c/floats-esbmc-regression/digits_bad_for.c
[2022-11-02 20:49:04,719 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/data/f410e604f/d4eb7ad13bc54d5f8b954b4edfe3e72f/FLAG57cb5ae74
[2022-11-02 20:49:05,097 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/data/f410e604f/d4eb7ad13bc54d5f8b954b4edfe3e72f
[2022-11-02 20:49:05,101 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-11-02 20:49:05,104 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements.
[2022-11-02 20:49:05,110 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-11-02 20:49:05,110 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-11-02 20:49:05,114 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-11-02 20:49:05,115 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:49:05" (1/1) ...
[2022-11-02 20:49:05,116 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f116fa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:05, skipping insertion in model container
[2022-11-02 20:49:05,116 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:49:05" (1/1) ...
[2022-11-02 20:49:05,124 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-11-02 20:49:05,138 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-11-02 20:49:05,315 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/sv-benchmarks/c/floats-esbmc-regression/digits_bad_for.c[319,332]
[2022-11-02 20:49:05,331 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-11-02 20:49:05,341 INFO L203 MainTranslator]: Completed pre-run
[2022-11-02 20:49:05,353 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/sv-benchmarks/c/floats-esbmc-regression/digits_bad_for.c[319,332]
[2022-11-02 20:49:05,356 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-11-02 20:49:05,370 INFO L208 MainTranslator]: Completed translation
[2022-11-02 20:49:05,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:05 WrapperNode
[2022-11-02 20:49:05,371 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-11-02 20:49:05,372 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2022-11-02 20:49:05,372 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2022-11-02 20:49:05,372 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2022-11-02 20:49:05,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:05" (1/1) ...
[2022-11-02 20:49:05,388 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:05" (1/1) ...
[2022-11-02 20:49:05,408 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 31
[2022-11-02 20:49:05,408 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2022-11-02 20:49:05,409 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-11-02 20:49:05,409 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-11-02 20:49:05,409 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-11-02 20:49:05,418 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:05" (1/1) ...
[2022-11-02 20:49:05,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:05" (1/1) ...
[2022-11-02 20:49:05,421 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:05" (1/1) ...
[2022-11-02 20:49:05,421 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:05" (1/1) ...
[2022-11-02 20:49:05,435 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:05" (1/1) ...
[2022-11-02 20:49:05,439 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:05" (1/1) ...
[2022-11-02 20:49:05,440 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:05" (1/1) ...
[2022-11-02 20:49:05,441 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:05" (1/1) ...
[2022-11-02 20:49:05,442 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-11-02 20:49:05,443 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-11-02 20:49:05,443 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-11-02 20:49:05,443 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-11-02 20:49:05,447 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:05" (1/1) ...
[2022-11-02 20:49:05,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-11-02 20:49:05,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/z3
[2022-11-02 20:49:05,482 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2022-11-02 20:49:05,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2022-11-02 20:49:05,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-11-02 20:49:05,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-11-02 20:49:05,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-11-02 20:49:05,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-11-02 20:49:05,617 INFO L235 CfgBuilder]: Building ICFG
[2022-11-02 20:49:05,619 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-11-02 20:49:05,805 INFO L276 CfgBuilder]: Performing block encoding
[2022-11-02 20:49:05,810 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-11-02 20:49:05,811 INFO L300 CfgBuilder]: Removed 1 assume(true) statements.
[2022-11-02 20:49:05,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:49:05 BoogieIcfgContainer
[2022-11-02 20:49:05,813 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-11-02 20:49:05,815 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-11-02 20:49:05,815 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-11-02 20:49:05,819 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-11-02 20:49:05,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:49:05" (1/3) ...
[2022-11-02 20:49:05,820 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3611e5bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:49:05, skipping insertion in model container
[2022-11-02 20:49:05,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:05" (2/3) ...
[2022-11-02 20:49:05,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3611e5bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:49:05, skipping insertion in model container
[2022-11-02 20:49:05,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:49:05" (3/3) ...
[2022-11-02 20:49:05,824 INFO L112 eAbstractionObserver]: Analyzing ICFG digits_bad_for.c
[2022-11-02 20:49:05,851 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2022-11-02 20:49:05,851 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-11-02 20:49:05,927 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-11-02 20:49:05,937 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@747246b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2022-11-02 20:49:05,937 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-11-02 20:49:05,942 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:49:05,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7
[2022-11-02 20:49:05,948 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:49:05,949 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1]
[2022-11-02 20:49:05,950 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:49:05,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:49:05,957 INFO L85 PathProgramCache]: Analyzing trace with hash 889605037, now seen corresponding path program 1 times
[2022-11-02 20:49:05,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:49:05,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857907832]
[2022-11-02 20:49:05,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:49:05,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:49:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-11-02 20:49:06,092 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-11-02 20:49:06,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-11-02 20:49:06,134 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2022-11-02 20:49:06,136 INFO L359 BasicCegarLoop]: Counterexample is feasible
[2022-11-02 20:49:06,139 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2022-11-02 20:49:06,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-11-02 20:49:06,148 INFO L444 BasicCegarLoop]: Path program histogram: [1]
[2022-11-02 20:49:06,153 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2022-11-02 20:49:06,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:49:06 BoogieIcfgContainer
[2022-11-02 20:49:06,180 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-11-02 20:49:06,184 INFO L113 PluginConnector]: ------------------------Witness Printer----------------------------
[2022-11-02 20:49:06,184 INFO L271 PluginConnector]: Initializing Witness Printer...
[2022-11-02 20:49:06,184 INFO L275 PluginConnector]: Witness Printer initialized
[2022-11-02 20:49:06,185 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:49:05" (3/4) ...
[2022-11-02 20:49:06,188 INFO L140 WitnessPrinter]: No result that supports witness generation found
[2022-11-02 20:49:06,189 INFO L132 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2022-11-02 20:49:06,190 INFO L158 Benchmark]: Toolchain (without parser) took 1086.02ms. Allocated memory is still 109.1MB. Free memory was 74.7MB in the beginning and 57.1MB in the end (delta: 17.6MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB.
[2022-11-02 20:49:06,192 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 109.1MB. Free memory was 59.5MB in the beginning and 59.5MB in the end (delta: 47.7kB). There was no memory consumed. Max. memory is 16.1GB.
[2022-11-02 20:49:06,193 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.03ms. Allocated memory is still 109.1MB. Free memory was 74.5MB in the beginning and 83.3MB in the end (delta: -8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2022-11-02 20:49:06,194 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.43ms. Allocated memory is still 109.1MB. Free memory was 83.3MB in the beginning and 81.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2022-11-02 20:49:06,196 INFO L158 Benchmark]: Boogie Preprocessor took 33.34ms. Allocated memory is still 109.1MB. Free memory was 81.6MB in the beginning and 80.6MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2022-11-02 20:49:06,201 INFO L158 Benchmark]: RCFGBuilder took 370.18ms. Allocated memory is still 109.1MB. Free memory was 80.6MB in the beginning and 71.5MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2022-11-02 20:49:06,202 INFO L158 Benchmark]: TraceAbstraction took 365.59ms. Allocated memory is still 109.1MB. Free memory was 70.8MB in the beginning and 57.5MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB.
[2022-11-02 20:49:06,204 INFO L158 Benchmark]: Witness Printer took 4.94ms. Allocated memory is still 109.1MB. Free memory was 57.5MB in the beginning and 57.1MB in the end (delta: 343.1kB). There was no memory consumed. Max. memory is 16.1GB.
[2022-11-02 20:49:06,213 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.30ms. Allocated memory is still 109.1MB. Free memory was 59.5MB in the beginning and 59.5MB in the end (delta: 47.7kB). There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 261.03ms. Allocated memory is still 109.1MB. Free memory was 74.5MB in the beginning and 83.3MB in the end (delta: -8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 36.43ms. Allocated memory is still 109.1MB. Free memory was 83.3MB in the beginning and 81.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 33.34ms. Allocated memory is still 109.1MB. Free memory was 81.6MB in the beginning and 80.6MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 370.18ms. Allocated memory is still 109.1MB. Free memory was 80.6MB in the beginning and 71.5MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* TraceAbstraction took 365.59ms. Allocated memory is still 109.1MB. Free memory was 70.8MB in the beginning and 57.5MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB.
* Witness Printer took 4.94ms. Allocated memory is still 109.1MB. Free memory was 57.5MB in the beginning and 57.1MB in the end (delta: 343.1kB). There was no memory consumed. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: ErrorAutomatonStatistics
NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
- UnprovableResult [Line: 4]: Unable to prove that call to reach_error is unreachable
Unable to prove that call to reach_error is unreachable
Reason: overapproximation of someBinaryLONGDOUBLEComparisonOperation at line 11, overapproximation of someBinaryArithmeticDOUBLEoperation at line 8.
Possible FailurePath:
[L8] long double x = 1.0/7.0;
[L9] long long res = 0;
[L11] int i = 1;
VAL [i=1, res=0]
[L11] COND FALSE !(x != 0)
VAL [i=1, res=0]
[L17] CALL __VERIFIER_assert(res > 67050)
[L4] COND TRUE !(cond)
VAL [\old(cond)=0, cond=0]
[L4] reach_error()
VAL [\old(cond)=0, cond=0]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 1 procedures, 12 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 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
[2022-11-02 20:49:06,274 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Using bit-precise analysis
Retrying with bit-precise analysis
### Bit-precise run ###
Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/digits_bad_for.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --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 7a282122dc24d7edcdab0235b368fb11c8475c7879a31ec8b05ebbedfee80407
--- Real Ultimate output ---
[0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset.
This is Ultimate 0.2.2-dev-5e519f3
[2022-11-02 20:49:08,705 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-11-02 20:49:08,707 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-11-02 20:49:08,735 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-11-02 20:49:08,735 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-11-02 20:49:08,736 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-11-02 20:49:08,738 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-11-02 20:49:08,740 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-11-02 20:49:08,742 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-11-02 20:49:08,743 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-11-02 20:49:08,744 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-11-02 20:49:08,745 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-11-02 20:49:08,746 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-11-02 20:49:08,747 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-11-02 20:49:08,748 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-11-02 20:49:08,749 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-11-02 20:49:08,750 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-11-02 20:49:08,752 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-11-02 20:49:08,753 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-11-02 20:49:08,755 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-11-02 20:49:08,757 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-11-02 20:49:08,759 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-11-02 20:49:08,760 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-11-02 20:49:08,761 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-11-02 20:49:08,765 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-11-02 20:49:08,765 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-11-02 20:49:08,766 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-11-02 20:49:08,767 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-11-02 20:49:08,767 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-11-02 20:49:08,772 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-11-02 20:49:08,773 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-11-02 20:49:08,774 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-11-02 20:49:08,774 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-11-02 20:49:08,775 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-11-02 20:49:08,776 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-11-02 20:49:08,776 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-11-02 20:49:08,777 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-11-02 20:49:08,777 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-11-02 20:49:08,778 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-11-02 20:49:08,779 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-11-02 20:49:08,780 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-11-02 20:49:08,783 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2022-11-02 20:49:08,845 INFO L113 SettingsManager]: Loading preferences was successful
[2022-11-02 20:49:08,846 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-11-02 20:49:08,847 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2022-11-02 20:49:08,847 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2022-11-02 20:49:08,848 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2022-11-02 20:49:08,848 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2022-11-02 20:49:08,850 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2022-11-02 20:49:08,850 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2022-11-02 20:49:08,850 INFO L138 SettingsManager]: * Use SBE=true
[2022-11-02 20:49:08,851 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-11-02 20:49:08,852 INFO L138 SettingsManager]: * sizeof long=4
[2022-11-02 20:49:08,852 INFO L138 SettingsManager]: * sizeof POINTER=4
[2022-11-02 20:49:08,852 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-11-02 20:49:08,852 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-11-02 20:49:08,853 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-11-02 20:49:08,853 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-11-02 20:49:08,853 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2022-11-02 20:49:08,853 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true
[2022-11-02 20:49:08,853 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2022-11-02 20:49:08,854 INFO L138 SettingsManager]: * sizeof long double=12
[2022-11-02 20:49:08,854 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-11-02 20:49:08,854 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-11-02 20:49:08,854 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-11-02 20:49:08,854 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-11-02 20:49:08,855 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-11-02 20:49:08,855 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-11-02 20:49:08,855 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-11-02 20:49:08,855 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-11-02 20:49:08,856 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2022-11-02 20:49:08,856 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2022-11-02 20:49:08,856 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF
[2022-11-02 20:49:08,856 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2022-11-02 20:49:08,857 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2022-11-02 20:49:08,857 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2022-11-02 20:49:08,857 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-11-02 20:49:08,857 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2022-11-02 20:49:08,858 INFO L138 SettingsManager]: * Logic for external solver=AUFBV
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
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 -> 7a282122dc24d7edcdab0235b368fb11c8475c7879a31ec8b05ebbedfee80407
[2022-11-02 20:49:09,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-11-02 20:49:09,278 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-11-02 20:49:09,282 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-11-02 20:49:09,283 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-11-02 20:49:09,284 INFO L275 PluginConnector]: CDTParser initialized
[2022-11-02 20:49:09,290 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/floats-esbmc-regression/digits_bad_for.c
[2022-11-02 20:49:09,363 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/data/8776a343e/27518ec5ae2f47e79468ef86ad3bf2c0/FLAG7c4ddfb71
[2022-11-02 20:49:09,925 INFO L306 CDTParser]: Found 1 translation units.
[2022-11-02 20:49:09,926 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/sv-benchmarks/c/floats-esbmc-regression/digits_bad_for.c
[2022-11-02 20:49:09,931 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/data/8776a343e/27518ec5ae2f47e79468ef86ad3bf2c0/FLAG7c4ddfb71
[2022-11-02 20:49:10,379 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/data/8776a343e/27518ec5ae2f47e79468ef86ad3bf2c0
[2022-11-02 20:49:10,381 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-11-02 20:49:10,382 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements.
[2022-11-02 20:49:10,386 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-11-02 20:49:10,386 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-11-02 20:49:10,390 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-11-02 20:49:10,391 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:49:10" (1/1) ...
[2022-11-02 20:49:10,392 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19315f38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:10, skipping insertion in model container
[2022-11-02 20:49:10,393 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:49:10" (1/1) ...
[2022-11-02 20:49:10,401 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-11-02 20:49:10,417 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-11-02 20:49:10,563 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/sv-benchmarks/c/floats-esbmc-regression/digits_bad_for.c[319,332]
[2022-11-02 20:49:10,576 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-11-02 20:49:10,589 INFO L203 MainTranslator]: Completed pre-run
[2022-11-02 20:49:10,621 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/sv-benchmarks/c/floats-esbmc-regression/digits_bad_for.c[319,332]
[2022-11-02 20:49:10,628 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-11-02 20:49:10,652 INFO L208 MainTranslator]: Completed translation
[2022-11-02 20:49:10,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:10 WrapperNode
[2022-11-02 20:49:10,652 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-11-02 20:49:10,655 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2022-11-02 20:49:10,655 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2022-11-02 20:49:10,655 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2022-11-02 20:49:10,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:10" (1/1) ...
[2022-11-02 20:49:10,674 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:10" (1/1) ...
[2022-11-02 20:49:10,698 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32
[2022-11-02 20:49:10,699 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2022-11-02 20:49:10,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-11-02 20:49:10,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-11-02 20:49:10,701 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-11-02 20:49:10,710 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:10" (1/1) ...
[2022-11-02 20:49:10,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:10" (1/1) ...
[2022-11-02 20:49:10,728 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:10" (1/1) ...
[2022-11-02 20:49:10,729 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:10" (1/1) ...
[2022-11-02 20:49:10,735 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:10" (1/1) ...
[2022-11-02 20:49:10,738 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:10" (1/1) ...
[2022-11-02 20:49:10,740 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:10" (1/1) ...
[2022-11-02 20:49:10,741 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:10" (1/1) ...
[2022-11-02 20:49:10,743 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-11-02 20:49:10,744 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-11-02 20:49:10,744 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-11-02 20:49:10,744 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-11-02 20:49:10,745 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:10" (1/1) ...
[2022-11-02 20:49:10,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-11-02 20:49:10,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/z3
[2022-11-02 20:49:10,784 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2022-11-02 20:49:10,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2022-11-02 20:49:10,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-11-02 20:49:10,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-11-02 20:49:10,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-11-02 20:49:10,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1
[2022-11-02 20:49:10,899 INFO L235 CfgBuilder]: Building ICFG
[2022-11-02 20:49:10,901 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-11-02 20:49:13,187 INFO L276 CfgBuilder]: Performing block encoding
[2022-11-02 20:49:13,193 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-11-02 20:49:13,193 INFO L300 CfgBuilder]: Removed 1 assume(true) statements.
[2022-11-02 20:49:13,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:49:13 BoogieIcfgContainer
[2022-11-02 20:49:13,196 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-11-02 20:49:13,198 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-11-02 20:49:13,198 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-11-02 20:49:13,201 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-11-02 20:49:13,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:49:10" (1/3) ...
[2022-11-02 20:49:13,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ae92a2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:49:13, skipping insertion in model container
[2022-11-02 20:49:13,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:10" (2/3) ...
[2022-11-02 20:49:13,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ae92a2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:49:13, skipping insertion in model container
[2022-11-02 20:49:13,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:49:13" (3/3) ...
[2022-11-02 20:49:13,205 INFO L112 eAbstractionObserver]: Analyzing ICFG digits_bad_for.c
[2022-11-02 20:49:13,241 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2022-11-02 20:49:13,254 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-11-02 20:49:13,354 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-11-02 20:49:13,361 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@342758f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2022-11-02 20:49:13,362 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-11-02 20:49:13,378 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:49:13,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7
[2022-11-02 20:49:13,384 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:49:13,394 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1]
[2022-11-02 20:49:13,395 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:49:13,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:49:13,404 INFO L85 PathProgramCache]: Analyzing trace with hash 889605037, now seen corresponding path program 1 times
[2022-11-02 20:49:13,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2022-11-02 20:49:13,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [658421406]
[2022-11-02 20:49:13,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:49:13,442 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3
[2022-11-02 20:49:13,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/mathsat
[2022-11-02 20:49:13,450 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2022-11-02 20:49:13,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process
[2022-11-02 20:49:13,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:49:13,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core
[2022-11-02 20:49:13,577 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-11-02 20:49:13,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:49:13,680 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-11-02 20:49:13,681 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2022-11-02 20:49:13,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [658421406]
[2022-11-02 20:49:13,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [658421406] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:49:13,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:49:13,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-11-02 20:49:13,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762925875]
[2022-11-02 20:49:13,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:49:13,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:49:13,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2022-11-02 20:49:13,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:49:13,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:49:13,716 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:49:15,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2022-11-02 20:49:15,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:49:15,996 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions.
[2022-11-02 20:49:15,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:49:15,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6
[2022-11-02 20:49:15,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:49:16,006 INFO L225 Difference]: With dead ends: 21
[2022-11-02 20:49:16,006 INFO L226 Difference]: Without dead ends: 9
[2022-11-02 20:49:16,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:49:16,012 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time
[2022-11-02 20:49:16,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time]
[2022-11-02 20:49:16,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states.
[2022-11-02 20:49:16,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9.
[2022-11-02 20:49:16,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:49:16,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions.
[2022-11-02 20:49:16,045 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6
[2022-11-02 20:49:16,045 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:49:16,045 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions.
[2022-11-02 20:49:16,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:49:16,046 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions.
[2022-11-02 20:49:16,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2022-11-02 20:49:16,046 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:49:16,047 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:49:16,065 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0
[2022-11-02 20:49:16,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3
[2022-11-02 20:49:16,260 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:49:16,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:49:16,261 INFO L85 PathProgramCache]: Analyzing trace with hash 265180975, now seen corresponding path program 1 times
[2022-11-02 20:49:16,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2022-11-02 20:49:16,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2134554216]
[2022-11-02 20:49:16,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:49:16,262 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3
[2022-11-02 20:49:16,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/mathsat
[2022-11-02 20:49:16,264 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2022-11-02 20:49:16,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process
[2022-11-02 20:49:16,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:49:17,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core
[2022-11-02 20:49:17,008 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-11-02 20:49:18,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:49:18,542 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-11-02 20:49:24,764 WARN L833 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false
[2022-11-02 20:49:26,809 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true
[2022-11-02 20:49:27,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2022-11-02 20:49:27,085 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2022-11-02 20:49:27,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2134554216]
[2022-11-02 20:49:27,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2134554216] provided 0 perfect and 2 imperfect interpolant sequences
[2022-11-02 20:49:27,086 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2022-11-02 20:49:27,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7
[2022-11-02 20:49:27,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514402518]
[2022-11-02 20:49:27,087 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2022-11-02 20:49:27,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2022-11-02 20:49:27,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2022-11-02 20:49:27,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2022-11-02 20:49:27,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=17, Unknown=2, NotChecked=8, Total=42
[2022-11-02 20:49:27,111 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:49:29,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2022-11-02 20:49:31,252 WARN L855 $PredicateComparison]: unable to prove that (and (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true
[2022-11-02 20:49:33,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2022-11-02 20:49:33,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:49:33,524 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions.
[2022-11-02 20:49:33,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-11-02 20:49:33,531 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8
[2022-11-02 20:49:33,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:49:33,532 INFO L225 Difference]: With dead ends: 15
[2022-11-02 20:49:33,532 INFO L226 Difference]: Without dead ends: 11
[2022-11-02 20:49:33,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=17, Invalid=18, Unknown=3, NotChecked=18, Total=56
[2022-11-02 20:49:33,534 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time
[2022-11-02 20:49:33,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 18 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 2 Unknown, 8 Unchecked, 4.3s Time]
[2022-11-02 20:49:33,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states.
[2022-11-02 20:49:33,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11.
[2022-11-02 20:49:33,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:49:33,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions.
[2022-11-02 20:49:33,546 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8
[2022-11-02 20:49:33,546 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:49:33,546 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions.
[2022-11-02 20:49:33,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:49:33,548 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions.
[2022-11-02 20:49:33,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2022-11-02 20:49:33,549 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:49:33,550 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:49:33,574 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0
[2022-11-02 20:49:33,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3
[2022-11-02 20:49:33,754 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:49:33,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:49:33,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1489078833, now seen corresponding path program 2 times
[2022-11-02 20:49:33,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2022-11-02 20:49:33,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [747456440]
[2022-11-02 20:49:33,755 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-11-02 20:49:33,756 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3
[2022-11-02 20:49:33,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/mathsat
[2022-11-02 20:49:33,762 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2022-11-02 20:49:33,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process
[2022-11-02 20:49:35,147 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-11-02 20:49:35,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-11-02 20:49:35,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 5 conjunts are in the unsatisfiable core
[2022-11-02 20:49:35,235 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-11-02 20:49:54,260 WARN L234 SmtUtils]: Spent 6.46s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2022-11-02 20:49:58,571 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:49:58,571 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-11-02 20:50:04,812 WARN L833 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false
[2022-11-02 20:50:06,867 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true
[2022-11-02 20:50:17,331 WARN L833 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false
[2022-11-02 20:50:19,446 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true
[2022-11-02 20:50:25,661 WARN L833 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false
[2022-11-02 20:50:27,733 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true
[2022-11-02 20:50:27,734 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked.
[2022-11-02 20:50:27,734 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2022-11-02 20:50:27,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [747456440]
[2022-11-02 20:50:27,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [747456440] provided 0 perfect and 2 imperfect interpolant sequences
[2022-11-02 20:50:27,735 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2022-11-02 20:50:27,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9
[2022-11-02 20:50:27,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100720924]
[2022-11-02 20:50:27,736 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2022-11-02 20:50:27,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2022-11-02 20:50:27,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2022-11-02 20:50:27,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2022-11-02 20:50:27,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=25, Unknown=6, NotChecked=36, Total=90
[2022-11-02 20:50:27,738 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:50:29,824 WARN L855 $PredicateComparison]: unable to prove that (and (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true
[2022-11-02 20:50:31,949 WARN L855 $PredicateComparison]: unable to prove that (and (= ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))) |c_ULTIMATE.start_main_~x~0#1|) (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true
[2022-11-02 20:50:34,019 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse0 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true
[2022-11-02 20:50:36,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2022-11-02 20:50:36,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:50:36,295 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions.
[2022-11-02 20:50:36,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-11-02 20:50:36,296 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10
[2022-11-02 20:50:36,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:50:36,297 INFO L225 Difference]: With dead ends: 17
[2022-11-02 20:50:36,297 INFO L226 Difference]: Without dead ends: 13
[2022-11-02 20:50:36,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 33.1s TimeCoverageRelationStatistics Valid=29, Invalid=28, Unknown=9, NotChecked=90, Total=156
[2022-11-02 20:50:36,299 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 1 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time
[2022-11-02 20:50:36,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 17 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 1 Unknown, 24 Unchecked, 2.3s Time]
[2022-11-02 20:50:36,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states.
[2022-11-02 20:50:36,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13.
[2022-11-02 20:50:36,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:50:36,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions.
[2022-11-02 20:50:36,304 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10
[2022-11-02 20:50:36,305 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:50:36,305 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions.
[2022-11-02 20:50:36,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:50:36,305 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions.
[2022-11-02 20:50:36,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2022-11-02 20:50:36,306 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:50:36,306 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:50:36,340 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0
[2022-11-02 20:50:36,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3
[2022-11-02 20:50:36,514 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:50:36,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:50:36,515 INFO L85 PathProgramCache]: Analyzing trace with hash 833881267, now seen corresponding path program 3 times
[2022-11-02 20:50:36,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2022-11-02 20:50:36,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [924810400]
[2022-11-02 20:50:36,516 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2022-11-02 20:50:36,516 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3
[2022-11-02 20:50:36,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/mathsat
[2022-11-02 20:50:36,518 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2022-11-02 20:50:36,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process
[2022-11-02 20:50:38,442 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s)
[2022-11-02 20:50:38,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-11-02 20:50:38,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjunts are in the unsatisfiable core
[2022-11-02 20:50:38,565 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-11-02 20:50:46,373 WARN L855 $PredicateComparison]: unable to prove that (and (= (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true
[2022-11-02 20:50:57,316 WARN L855 $PredicateComparison]: unable to prove that (and (= (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true
[2022-11-02 20:51:01,865 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked.
[2022-11-02 20:51:01,865 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-11-02 20:51:08,133 WARN L833 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false
[2022-11-02 20:51:10,210 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true
[2022-11-02 20:51:20,694 WARN L833 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false
[2022-11-02 20:51:22,812 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true
[2022-11-02 20:51:33,631 WARN L833 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false
[2022-11-02 20:51:35,814 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true
[2022-11-02 20:51:42,224 WARN L833 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false
[2022-11-02 20:51:44,375 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true
[2022-11-02 20:51:44,375 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked.
[2022-11-02 20:51:44,375 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2022-11-02 20:51:44,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [924810400]
[2022-11-02 20:51:44,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [924810400] provided 0 perfect and 2 imperfect interpolant sequences
[2022-11-02 20:51:44,376 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2022-11-02 20:51:44,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11
[2022-11-02 20:51:44,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776183084]
[2022-11-02 20:51:44,376 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2022-11-02 20:51:44,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2022-11-02 20:51:44,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2022-11-02 20:51:44,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2022-11-02 20:51:44,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=19, Unknown=10, NotChecked=78, Total=132
[2022-11-02 20:51:44,378 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:51:46,566 WARN L855 $PredicateComparison]: unable to prove that (and (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true
[2022-11-02 20:51:48,786 WARN L855 $PredicateComparison]: unable to prove that (and (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true
[2022-11-02 20:51:50,943 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse0 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) (not (fp.eq (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true
[2022-11-02 20:51:53,145 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (= (let ((.cse0 (let ((.cse2 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))) |c_ULTIMATE.start_main_~x~0#1|) (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true
[2022-11-02 20:51:55,259 WARN L855 $PredicateComparison]: unable to prove that (and (not (fp.eq |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true
[2022-11-02 20:51:55,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:51:55,294 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions.
[2022-11-02 20:51:55,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2022-11-02 20:51:55,295 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12
[2022-11-02 20:51:55,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:51:55,295 INFO L225 Difference]: With dead ends: 19
[2022-11-02 20:51:55,295 INFO L226 Difference]: Without dead ends: 15
[2022-11-02 20:51:55,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 33.2s TimeCoverageRelationStatistics Valid=35, Invalid=24, Unknown=15, NotChecked=198, Total=272
[2022-11-02 20:51:55,296 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-11-02 20:51:55,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 59 Unchecked, 0.1s Time]
[2022-11-02 20:51:55,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states.
[2022-11-02 20:51:55,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15.
[2022-11-02 20:51:55,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:51:55,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions.
[2022-11-02 20:51:55,301 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12
[2022-11-02 20:51:55,302 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:51:55,302 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions.
[2022-11-02 20:51:55,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:51:55,302 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions.
[2022-11-02 20:51:55,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2022-11-02 20:51:55,303 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:51:55,303 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:51:55,359 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0
[2022-11-02 20:51:55,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3
[2022-11-02 20:51:55,514 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:51:55,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:51:55,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1745754443, now seen corresponding path program 4 times
[2022-11-02 20:51:55,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2022-11-02 20:51:55,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [162445958]
[2022-11-02 20:51:55,515 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-11-02 20:51:55,515 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3
[2022-11-02 20:51:55,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/mathsat
[2022-11-02 20:51:55,516 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2022-11-02 20:51:55,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process
[2022-11-02 20:51:57,997 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-11-02 20:51:57,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-11-02 20:51:58,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 7 conjunts are in the unsatisfiable core
[2022-11-02 20:51:58,167 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-11-02 20:52:05,834 WARN L855 $PredicateComparison]: unable to prove that (and (= (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true
[2022-11-02 20:52:16,759 WARN L855 $PredicateComparison]: unable to prove that (and (= (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true
[2022-11-02 20:52:28,349 WARN L855 $PredicateComparison]: unable to prove that (and (= (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true
[2022-11-02 20:52:33,087 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked.
[2022-11-02 20:52:33,087 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-11-02 20:52:39,383 WARN L833 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false
[2022-11-02 20:52:41,450 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true
[2022-11-02 20:52:51,995 WARN L833 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false
[2022-11-02 20:52:54,133 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true
[2022-11-02 20:53:05,028 WARN L833 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false
[2022-11-02 20:53:07,233 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true
[2022-11-02 20:53:18,486 WARN L833 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse3))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false
[2022-11-02 20:53:20,747 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse3))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true
[2022-11-02 20:53:27,418 WARN L833 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false
[2022-11-02 20:53:29,644 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true
[2022-11-02 20:53:29,644 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked.
[2022-11-02 20:53:29,645 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2022-11-02 20:53:29,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [162445958]
[2022-11-02 20:53:29,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [162445958] provided 0 perfect and 2 imperfect interpolant sequences
[2022-11-02 20:53:29,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2022-11-02 20:53:29,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13
[2022-11-02 20:53:29,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146257364]
[2022-11-02 20:53:29,646 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2022-11-02 20:53:29,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2022-11-02 20:53:29,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2022-11-02 20:53:29,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2022-11-02 20:53:29,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=20, Unknown=13, NotChecked=120, Total=182
[2022-11-02 20:53:29,647 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:53:31,936 WARN L855 $PredicateComparison]: unable to prove that (and (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true
[2022-11-02 20:53:34,228 WARN L855 $PredicateComparison]: unable to prove that (and (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse3))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true
[2022-11-02 20:53:36,459 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse0 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) (not (fp.eq (let ((.cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse3))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true
[2022-11-02 20:53:38,653 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (= (let ((.cse0 (let ((.cse2 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))) |c_ULTIMATE.start_main_~x~0#1|) (not (fp.eq (let ((.cse3 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse3))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true
[2022-11-02 20:53:40,860 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (= (let ((.cse0 (let ((.cse2 (let ((.cse3 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))) |c_ULTIMATE.start_main_~x~0#1|) (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true
[2022-11-02 20:53:43,181 WARN L855 $PredicateComparison]: unable to prove that (and (= (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) |c_ULTIMATE.start_main_~x~0#1|) (not (fp.eq |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true
[2022-11-02 20:53:43,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:53:43,499 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions.
[2022-11-02 20:53:43,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2022-11-02 20:53:43,500 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14
[2022-11-02 20:53:43,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:53:43,501 INFO L225 Difference]: With dead ends: 21
[2022-11-02 20:53:43,501 INFO L226 Difference]: Without dead ends: 17
[2022-11-02 20:53:43,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 42.7s TimeCoverageRelationStatistics Valid=41, Invalid=26, Unknown=19, NotChecked=294, Total=380
[2022-11-02 20:53:43,503 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2022-11-02 20:53:43,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 76 Unchecked, 0.4s Time]
[2022-11-02 20:53:43,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states.
[2022-11-02 20:53:43,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17.
[2022-11-02 20:53:43,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:53:43,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions.
[2022-11-02 20:53:43,522 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14
[2022-11-02 20:53:43,522 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:53:43,522 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions.
[2022-11-02 20:53:43,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:53:43,523 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions.
[2022-11-02 20:53:43,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2022-11-02 20:53:43,523 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:53:43,524 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:53:43,598 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0
[2022-11-02 20:53:43,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3
[2022-11-02 20:53:43,738 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:53:43,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:53:43,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1715425335, now seen corresponding path program 5 times
[2022-11-02 20:53:43,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2022-11-02 20:53:43,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1539347633]
[2022-11-02 20:53:43,739 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2022-11-02 20:53:43,739 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3
[2022-11-02 20:53:43,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/mathsat
[2022-11-02 20:53:43,740 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2022-11-02 20:53:43,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8078dbc-b496-46a5-a387-2f3b258d794c/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process
[2022-11-02 20:53:48,069 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s)
[2022-11-02 20:53:48,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat