./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f 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_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8 --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 497906435138d6e8ed86f6117a3a5c3feed8c22116354c349b2936471319931d --- 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-e04fb08 [2022-11-16 11:38:13,576 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:38:13,579 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:38:13,627 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:38:13,627 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:38:13,633 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:38:13,637 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:38:13,646 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:38:13,650 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:38:13,655 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:38:13,657 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:38:13,660 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:38:13,660 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:38:13,668 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:38:13,670 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:38:13,671 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:38:13,672 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:38:13,674 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:38:13,676 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:38:13,678 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:38:13,680 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:38:13,684 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:38:13,686 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:38:13,689 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:38:13,694 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:38:13,702 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:38:13,703 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:38:13,704 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:38:13,707 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:38:13,708 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:38:13,709 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:38:13,710 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:38:13,712 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:38:13,714 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:38:13,717 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:38:13,718 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:38:13,719 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:38:13,720 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:38:13,720 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:38:13,722 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:38:13,723 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:38:13,725 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 11:38:13,779 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:38:13,781 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:38:13,782 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:38:13,783 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:38:13,784 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:38:13,784 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:38:13,785 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:38:13,786 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:38:13,786 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:38:13,786 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:38:13,788 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:38:13,788 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:38:13,789 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:38:13,789 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:38:13,789 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:38:13,789 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:38:13,790 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:38:13,790 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:38:13,790 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:38:13,791 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:38:13,791 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:38:13,791 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:38:13,792 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:38:13,792 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:38:13,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:38:13,793 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:38:13,795 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:38:13,795 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:38:13,795 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:38:13,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:38:13,796 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:38:13,796 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:38:13,797 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:38:13,797 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_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/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_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8 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 -> 497906435138d6e8ed86f6117a3a5c3feed8c22116354c349b2936471319931d [2022-11-16 11:38:14,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:38:14,211 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:38:14,214 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:38:14,216 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:38:14,217 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:38:14,219 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i [2022-11-16 11:38:14,323 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/data/f170a029c/d7884eef6753489e9ed1901308a0011f/FLAG321c29342 [2022-11-16 11:38:14,947 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:38:14,947 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i [2022-11-16 11:38:14,956 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/data/f170a029c/d7884eef6753489e9ed1901308a0011f/FLAG321c29342 [2022-11-16 11:38:15,286 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/data/f170a029c/d7884eef6753489e9ed1901308a0011f [2022-11-16 11:38:15,289 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:38:15,291 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:38:15,293 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:38:15,293 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:38:15,298 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:38:15,299 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:38:15" (1/1) ... [2022-11-16 11:38:15,300 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d0337ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:38:15, skipping insertion in model container [2022-11-16 11:38:15,301 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:38:15" (1/1) ... [2022-11-16 11:38:15,309 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:38:15,330 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:38:15,567 WARN L229 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_682e525f-978e-4e95-878d-536a1d739be3/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i[807,820] [2022-11-16 11:38:15,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:38:15,590 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:38:15,604 WARN L229 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_682e525f-978e-4e95-878d-536a1d739be3/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i[807,820] [2022-11-16 11:38:15,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:38:15,623 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:38:15,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:38:15 WrapperNode [2022-11-16 11:38:15,624 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:38:15,626 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:38:15,626 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:38:15,626 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:38:15,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:38:15" (1/1) ... [2022-11-16 11:38:15,644 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:38:15" (1/1) ... [2022-11-16 11:38:15,665 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 26 [2022-11-16 11:38:15,666 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:38:15,666 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:38:15,667 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:38:15,667 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:38:15,678 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:38:15" (1/1) ... [2022-11-16 11:38:15,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:38:15" (1/1) ... [2022-11-16 11:38:15,680 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:38:15" (1/1) ... [2022-11-16 11:38:15,680 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:38:15" (1/1) ... [2022-11-16 11:38:15,686 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:38:15" (1/1) ... [2022-11-16 11:38:15,693 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:38:15" (1/1) ... [2022-11-16 11:38:15,703 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:38:15" (1/1) ... [2022-11-16 11:38:15,704 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:38:15" (1/1) ... [2022-11-16 11:38:15,706 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:38:15,707 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:38:15,709 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:38:15,709 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:38:15,711 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:38:15" (1/1) ... [2022-11-16 11:38:15,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:38:15,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:38:15,752 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:38:15,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:38:15,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:38:15,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:38:15,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:38:15,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:38:15,871 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:38:15,873 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:38:16,029 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:38:16,038 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:38:16,039 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-16 11:38:16,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:38:16 BoogieIcfgContainer [2022-11-16 11:38:16,053 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:38:16,056 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:38:16,057 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:38:16,061 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:38:16,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:38:15" (1/3) ... [2022-11-16 11:38:16,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44c92a54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:38:16, skipping insertion in model container [2022-11-16 11:38:16,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:38:15" (2/3) ... [2022-11-16 11:38:16,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44c92a54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:38:16, skipping insertion in model container [2022-11-16 11:38:16,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:38:16" (3/3) ... [2022-11-16 11:38:16,067 INFO L112 eAbstractionObserver]: Analyzing ICFG Float_div_bad.i [2022-11-16 11:38:16,091 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:38:16,091 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 11:38:16,171 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:38:16,179 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;@2041cb4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:38:16,180 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 11:38:16,185 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 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-16 11:38:16,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-16 11:38:16,193 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:38:16,194 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-16 11:38:16,194 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:38:16,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:38:16,202 INFO L85 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2022-11-16 11:38:16,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:38:16,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919469665] [2022-11-16 11:38:16,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:38:16,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:38:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:38:16,374 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:38:16,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:38:16,428 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:38:16,431 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:38:16,433 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-16 11:38:16,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:38:16,442 INFO L444 BasicCegarLoop]: Path program histogram: [1] [2022-11-16 11:38:16,447 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 11:38:16,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:38:16 BoogieIcfgContainer [2022-11-16 11:38:16,475 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 11:38:16,477 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 11:38:16,477 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 11:38:16,478 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 11:38:16,479 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:38:16" (3/4) ... [2022-11-16 11:38:16,483 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 11:38:16,484 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 11:38:16,486 INFO L158 Benchmark]: Toolchain (without parser) took 1193.97ms. Allocated memory is still 98.6MB. Free memory was 67.7MB in the beginning and 50.7MB in the end (delta: 17.0MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2022-11-16 11:38:16,487 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 98.6MB. Free memory is still 51.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:38:16,489 INFO L158 Benchmark]: CACSL2BoogieTranslator took 331.77ms. Allocated memory is still 98.6MB. Free memory was 67.5MB in the beginning and 75.8MB in the end (delta: -8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-16 11:38:16,490 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.02ms. Allocated memory is still 98.6MB. Free memory was 75.8MB in the beginning and 74.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:38:16,491 INFO L158 Benchmark]: Boogie Preprocessor took 39.63ms. Allocated memory is still 98.6MB. Free memory was 74.5MB in the beginning and 73.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:38:16,498 INFO L158 Benchmark]: RCFGBuilder took 345.93ms. Allocated memory is still 98.6MB. Free memory was 73.4MB in the beginning and 64.4MB in the end (delta: 9.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 11:38:16,498 INFO L158 Benchmark]: TraceAbstraction took 419.42ms. Allocated memory is still 98.6MB. Free memory was 64.1MB in the beginning and 51.1MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-16 11:38:16,499 INFO L158 Benchmark]: Witness Printer took 6.68ms. Allocated memory is still 98.6MB. Free memory is still 50.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:38:16,508 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.38ms. Allocated memory is still 98.6MB. Free memory is still 51.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 331.77ms. Allocated memory is still 98.6MB. Free memory was 67.5MB in the beginning and 75.8MB in the end (delta: -8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.02ms. Allocated memory is still 98.6MB. Free memory was 75.8MB in the beginning and 74.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.63ms. Allocated memory is still 98.6MB. Free memory was 74.5MB in the beginning and 73.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 345.93ms. Allocated memory is still 98.6MB. Free memory was 73.4MB in the beginning and 64.4MB in the end (delta: 9.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 419.42ms. Allocated memory is still 98.6MB. Free memory was 64.1MB in the beginning and 51.1MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Witness Printer took 6.68ms. Allocated memory is still 98.6MB. Free memory is still 50.7MB. 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: 13]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 29, overapproximation of someBinaryArithmeticFLOAToperation at line 21. Possible FailurePath: [L20] float x = 1.0f; [L21] float x1 = x/1.6f; VAL [x=1] [L23] COND FALSE !(x1 != x) VAL [x=1] [L29] CALL __VERIFIER_assert(x == 0) [L13] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L13] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, 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=11occurred 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-16 11:38:16,533 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8 --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 497906435138d6e8ed86f6117a3a5c3feed8c22116354c349b2936471319931d --- 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-e04fb08 [2022-11-16 11:38:19,422 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:38:19,426 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:38:19,456 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:38:19,456 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:38:19,458 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:38:19,459 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:38:19,462 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:38:19,464 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:38:19,465 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:38:19,466 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:38:19,468 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:38:19,469 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:38:19,470 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:38:19,472 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:38:19,473 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:38:19,474 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:38:19,476 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:38:19,478 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:38:19,481 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:38:19,483 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:38:19,484 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:38:19,486 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:38:19,487 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:38:19,492 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:38:19,493 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:38:19,493 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:38:19,495 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:38:19,495 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:38:19,497 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:38:19,497 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:38:19,498 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:38:19,499 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:38:19,500 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:38:19,502 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:38:19,503 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:38:19,504 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:38:19,504 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:38:19,504 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:38:19,506 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:38:19,507 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:38:19,508 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-11-16 11:38:19,549 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:38:19,550 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:38:19,550 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:38:19,550 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:38:19,551 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:38:19,552 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:38:19,553 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:38:19,553 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:38:19,553 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:38:19,554 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:38:19,554 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:38:19,554 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:38:19,555 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:38:19,555 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:38:19,555 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:38:19,555 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:38:19,556 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 11:38:19,556 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-16 11:38:19,556 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-16 11:38:19,557 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:38:19,557 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:38:19,557 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:38:19,558 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:38:19,562 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:38:19,562 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:38:19,562 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:38:19,563 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:38:19,563 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:38:19,563 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:38:19,563 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:38:19,564 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-16 11:38:19,564 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-16 11:38:19,564 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:38:19,564 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:38:19,564 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:38:19,565 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-16 11:38:19,565 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_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/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_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8 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 -> 497906435138d6e8ed86f6117a3a5c3feed8c22116354c349b2936471319931d [2022-11-16 11:38:20,027 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:38:20,077 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:38:20,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:38:20,081 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:38:20,082 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:38:20,085 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i [2022-11-16 11:38:20,182 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/data/135f299d0/d80dfbf1852b4a698f0e3002aa18c6c9/FLAGf857dd957 [2022-11-16 11:38:20,899 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:38:20,900 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i [2022-11-16 11:38:20,912 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/data/135f299d0/d80dfbf1852b4a698f0e3002aa18c6c9/FLAGf857dd957 [2022-11-16 11:38:21,258 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/data/135f299d0/d80dfbf1852b4a698f0e3002aa18c6c9 [2022-11-16 11:38:21,264 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:38:21,266 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:38:21,270 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:38:21,271 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:38:21,277 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:38:21,278 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:38:21" (1/1) ... [2022-11-16 11:38:21,280 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@644e67e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:38:21, skipping insertion in model container [2022-11-16 11:38:21,281 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:38:21" (1/1) ... [2022-11-16 11:38:21,290 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:38:21,311 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:38:21,562 WARN L229 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_682e525f-978e-4e95-878d-536a1d739be3/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i[807,820] [2022-11-16 11:38:21,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:38:21,602 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:38:21,652 WARN L229 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_682e525f-978e-4e95-878d-536a1d739be3/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i[807,820] [2022-11-16 11:38:21,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:38:21,701 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:38:21,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:38:21 WrapperNode [2022-11-16 11:38:21,702 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:38:21,705 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:38:21,705 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:38:21,706 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:38:21,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:38:21" (1/1) ... [2022-11-16 11:38:21,724 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:38:21" (1/1) ... [2022-11-16 11:38:21,748 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 27 [2022-11-16 11:38:21,748 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:38:21,750 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:38:21,750 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:38:21,751 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:38:21,761 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:38:21" (1/1) ... [2022-11-16 11:38:21,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:38:21" (1/1) ... [2022-11-16 11:38:21,783 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:38:21" (1/1) ... [2022-11-16 11:38:21,784 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:38:21" (1/1) ... [2022-11-16 11:38:21,790 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:38:21" (1/1) ... [2022-11-16 11:38:21,793 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:38:21" (1/1) ... [2022-11-16 11:38:21,795 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:38:21" (1/1) ... [2022-11-16 11:38:21,796 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:38:21" (1/1) ... [2022-11-16 11:38:21,799 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:38:21,800 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:38:21,801 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:38:21,801 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:38:21,802 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:38:21" (1/1) ... [2022-11-16 11:38:21,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:38:21,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:38:21,841 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:38:21,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:38:21,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:38:21,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-16 11:38:21,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:38:21,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:38:21,985 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:38:21,987 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:38:23,255 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:38:23,262 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:38:23,263 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-16 11:38:23,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:38:23 BoogieIcfgContainer [2022-11-16 11:38:23,265 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:38:23,268 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:38:23,268 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:38:23,272 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:38:23,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:38:21" (1/3) ... [2022-11-16 11:38:23,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b413997 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:38:23, skipping insertion in model container [2022-11-16 11:38:23,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:38:21" (2/3) ... [2022-11-16 11:38:23,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b413997 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:38:23, skipping insertion in model container [2022-11-16 11:38:23,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:38:23" (3/3) ... [2022-11-16 11:38:23,276 INFO L112 eAbstractionObserver]: Analyzing ICFG Float_div_bad.i [2022-11-16 11:38:23,298 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:38:23,299 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 11:38:23,368 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:38:23,377 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;@161c8f1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:38:23,378 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 11:38:23,383 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 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-16 11:38:23,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-16 11:38:23,405 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:38:23,406 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-16 11:38:23,419 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:38:23,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:38:23,426 INFO L85 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2022-11-16 11:38:23,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:38:23,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1142471629] [2022-11-16 11:38:23,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:38:23,464 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:38:23,465 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:38:23,476 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:38:23,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-16 11:38:23,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:23,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:38:23,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:38:26,212 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-16 11:38:26,212 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:38:26,213 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:38:26,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1142471629] [2022-11-16 11:38:26,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1142471629] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:38:26,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:38:26,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:38:26,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613502007] [2022-11-16 11:38:26,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:38:26,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:38:26,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:38:26,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:38:26,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:38:26,263 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 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) Second operand has 4 states, 4 states have (on average 1.5) 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-16 11:38:28,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:38:28,358 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-11-16 11:38:28,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:38:28,362 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) 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-16 11:38:28,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:38:28,370 INFO L225 Difference]: With dead ends: 20 [2022-11-16 11:38:28,370 INFO L226 Difference]: Without dead ends: 8 [2022-11-16 11:38:28,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:38:28,379 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 11 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:38:28,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 15 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-16 11:38:28,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2022-11-16 11:38:28,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-11-16 11:38:28,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-16 11:38:28,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2022-11-16 11:38:28,418 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2022-11-16 11:38:28,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:38:28,419 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2022-11-16 11:38:28,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) 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-16 11:38:28,420 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-11-16 11:38:28,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-16 11:38:28,420 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:38:28,421 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:38:28,444 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-16 11:38:28,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:38:28,639 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:38:28,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:38:28,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1810510480, now seen corresponding path program 1 times [2022-11-16 11:38:28,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:38:28,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1771321782] [2022-11-16 11:38:28,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:38:28,643 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:38:28,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:38:28,644 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:38:28,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-16 11:38:29,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:29,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 11:38:29,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:38:34,114 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-16 11:38:34,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:38:54,617 WARN L833 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from false [2022-11-16 11:38:56,694 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from true [2022-11-16 11:38:56,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:38:56,695 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:38:56,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1771321782] [2022-11-16 11:38:56,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1771321782] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:38:56,696 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:38:56,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-11-16 11:38:56,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283028442] [2022-11-16 11:38:56,696 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:38:56,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:38:56,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:38:56,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:38:56,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=26, Unknown=3, NotChecked=10, Total=56 [2022-11-16 11:38:56,699 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 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-16 11:39:14,423 WARN L233 SmtUtils]: Spent 5.24s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:39:16,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 11:39:19,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 11:39:21,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 11:39:23,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 11:39:25,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 11:39:25,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:39:25,613 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-11-16 11:39:25,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:39:25,642 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 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) Word has length 7 [2022-11-16 11:39:25,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:39:25,643 INFO L225 Difference]: With dead ends: 15 [2022-11-16 11:39:25,643 INFO L226 Difference]: Without dead ends: 11 [2022-11-16 11:39:25,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 35.6s TimeCoverageRelationStatistics Valid=43, Invalid=68, Unknown=3, NotChecked=18, Total=132 [2022-11-16 11:39:25,645 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 10 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:39:25,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 9 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 5 Unknown, 7 Unchecked, 14.0s Time] [2022-11-16 11:39:25,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-11-16 11:39:25,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-11-16 11:39:25,650 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-16 11:39:25,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2022-11-16 11:39:25,651 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2022-11-16 11:39:25,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:39:25,651 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2022-11-16 11:39:25,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 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-16 11:39:25,652 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-11-16 11:39:25,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-16 11:39:25,653 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:39:25,653 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2022-11-16 11:39:25,670 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-11-16 11:39:25,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:39:25,857 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:39:25,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:25,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1922847381, now seen corresponding path program 2 times [2022-11-16 11:39:25,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:39:25,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [748361869] [2022-11-16 11:39:25,859 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:39:25,860 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:39:25,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:39:25,861 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:39:25,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-16 11:39:26,879 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:39:26,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:39:26,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-16 11:39:26,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:39:34,277 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-16 11:39:49,356 WARN L233 SmtUtils]: Spent 6.56s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:39:56,187 WARN L855 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0)))) is different from true [2022-11-16 11:40:04,919 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0)) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-16 11:40:04,946 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 9 not checked. [2022-11-16 11:40:04,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:40:10,459 WARN L855 $PredicateComparison]: unable to prove that (or (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0))) |c_ULTIMATE.start_main_~x1~0#1|)) (fp.eq |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) is different from true [2022-11-16 11:40:19,709 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from false [2022-11-16 11:40:21,792 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2022-11-16 11:40:32,927 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from false [2022-11-16 11:40:35,066 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2022-11-16 11:40:46,716 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from false [2022-11-16 11:40:48,907 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2022-11-16 11:41:00,789 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from false [2022-11-16 11:41:03,030 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from true [2022-11-16 11:41:03,031 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-11-16 11:41:03,031 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:41:03,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [748361869] [2022-11-16 11:41:03,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [748361869] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:41:03,032 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:41:03,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 15 [2022-11-16 11:41:03,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945738438] [2022-11-16 11:41:03,033 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:41:03,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-16 11:41:03,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:41:03,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-16 11:41:03,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=42, Unknown=14, NotChecked=152, Total=240 [2022-11-16 11:41:03,036 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 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-16 11:41:05,318 WARN L855 $PredicateComparison]: unable to prove that (and (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-16 11:41:07,606 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-16 11:41:09,701 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0)) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) .cse0))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1)) (fp.eq .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-11-16 11:41:11,851 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0)) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) .cse0))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1)) (fp.eq .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-16 11:41:51,475 WARN L233 SmtUtils]: Spent 24.35s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:41:52,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 11:41:55,541 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (or (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) |c_ULTIMATE.start_main_~x1~0#1|)) (fp.eq |c_ULTIMATE.start_main_~x1~0#1| .cse1)) (or (not (fp.eq |c_ULTIMATE.start_main_~x1~0#1| |c_ULTIMATE.start_main_~x~0#1|)) (fp.eq |c_ULTIMATE.start_main_~x~0#1| .cse1)) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0)))) is different from false [2022-11-16 11:42:24,565 WARN L233 SmtUtils]: Spent 15.35s on a formula simplification. DAG size of input: 23 DAG size of output: 17 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:42:26,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 11:42:28,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 11:42:31,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 11:42:31,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:42:31,709 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-11-16 11:42:31,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:42:31,710 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 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-16 11:42:31,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:42:31,711 INFO L225 Difference]: With dead ends: 16 [2022-11-16 11:42:31,711 INFO L226 Difference]: Without dead ends: 12 [2022-11-16 11:42:31,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 119.6s TimeCoverageRelationStatistics Valid=48, Invalid=63, Unknown=27, NotChecked=324, Total=462 [2022-11-16 11:42:31,717 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 7 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:42:31,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 15 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 2 Unknown, 65 Unchecked, 9.0s Time] [2022-11-16 11:42:31,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-11-16 11:42:31,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-11-16 11:42:31,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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-16 11:42:31,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-11-16 11:42:31,727 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2022-11-16 11:42:31,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:42:31,728 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-11-16 11:42:31,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 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-16 11:42:31,731 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-11-16 11:42:31,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 11:42:31,732 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:42:31,732 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2022-11-16 11:42:31,767 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-16 11:42:31,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:42:31,949 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:42:31,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:31,950 INFO L85 PathProgramCache]: Analyzing trace with hash 522938704, now seen corresponding path program 3 times [2022-11-16 11:42:31,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:42:31,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2126019774] [2022-11-16 11:42:31,951 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 11:42:31,951 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:42:31,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:42:31,953 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:42:31,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-16 11:42:33,464 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-16 11:42:33,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:42:33,520 WARN L261 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-16 11:42:33,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:42:47,493 WARN L233 SmtUtils]: Spent 5.28s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:43:07,704 WARN L233 SmtUtils]: Spent 6.63s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:43:14,699 WARN L855 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0)))) is different from true [2022-11-16 11:43:22,909 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0)) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-16 11:43:28,754 WARN L233 SmtUtils]: Spent 5.11s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 11:43:30,806 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)) (= |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-16 11:43:34,999 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 2 times theorem prover too weak. 0 trivial. 12 not checked. [2022-11-16 11:43:35,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:43:45,621 WARN L855 $PredicateComparison]: unable to prove that (or (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0))) |c_ULTIMATE.start_main_~x1~0#1|)) (fp.eq |c_ULTIMATE.start_main_~x1~0#1| |c_ULTIMATE.start_main_~x~0#1|) (fp.eq |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) is different from true [2022-11-16 11:44:02,297 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 |c_ULTIMATE.start_main_~x1~0#1|) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2022-11-16 11:44:18,176 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse2))) (or (fp.eq .cse0 .cse1) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse2) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))))) is different from false [2022-11-16 11:44:20,356 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse2))) (or (fp.eq .cse0 .cse1) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse2) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))))) is different from true [2022-11-16 11:44:36,805 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (let ((.cse0 (fp.div c_currentRoundingMode .cse2 .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (fp.eq .cse0 .cse2))))) is different from false [2022-11-16 11:44:39,047 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (let ((.cse0 (fp.div c_currentRoundingMode .cse2 .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (fp.eq .cse0 .cse2))))) is different from true [2022-11-16 11:44:44,157 WARN L233 SmtUtils]: Spent 5.10s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 11:44:54,067 WARN L233 SmtUtils]: Spent 5.01s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 11:44:56,357 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) .cse2) .cse2))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse2))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (fp.eq .cse0 .cse1) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse2) .cse0)))))) is different from false [2022-11-16 11:44:58,636 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) .cse2) .cse2))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse2))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (fp.eq .cse0 .cse1) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse2) .cse0)))))) is different from true [2022-11-16 11:45:03,751 WARN L233 SmtUtils]: Spent 5.11s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 11:45:08,856 WARN L233 SmtUtils]: Spent 5.10s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 11:45:13,968 WARN L233 SmtUtils]: Spent 5.11s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 11:45:16,279 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1))) (let ((.cse0 (fp.div c_currentRoundingMode .cse2 .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 .cse2) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))))) is different from false [2022-11-16 11:45:18,587 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1))) (let ((.cse0 (fp.div c_currentRoundingMode .cse2 .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 .cse2) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))))) is different from true [2022-11-16 11:45:18,587 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2022-11-16 11:45:18,588 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:45:18,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2126019774] [2022-11-16 11:45:18,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2126019774] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:45:18,588 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:45:18,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2022-11-16 11:45:18,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033313076] [2022-11-16 11:45:18,588 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:45:18,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-16 11:45:18,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:45:18,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-16 11:45:18,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=54, Unknown=17, NotChecked=198, Total=306 [2022-11-16 11:45:18,590 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 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-16 11:45:20,974 WARN L855 $PredicateComparison]: unable to prove that (and (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1))) (let ((.cse0 (fp.div c_currentRoundingMode .cse2 .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 .cse2) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-16 11:45:23,269 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) .cse2) .cse2))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse2))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (fp.eq .cse0 .cse1) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse2) .cse0))))) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse2)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-16 11:45:25,488 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (let ((.cse0 (fp.div c_currentRoundingMode .cse2 .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (fp.eq .cse0 .cse2)))) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .cse1)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-16 11:45:27,666 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse2))) (or (fp.eq .cse0 .cse1) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse2) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse2) .cse2) .cse2)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-16 11:45:29,951 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 |c_ULTIMATE.start_main_~x1~0#1|) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1)))) is different from false [2022-11-16 11:45:32,172 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 |c_ULTIMATE.start_main_~x1~0#1|) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1)))) is different from true [2022-11-16 11:45:36,747 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (or (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) |c_ULTIMATE.start_main_~x1~0#1|)) (fp.eq |c_ULTIMATE.start_main_~x1~0#1| |c_ULTIMATE.start_main_~x~0#1|) (fp.eq |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (= |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0)) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-16 11:45:39,009 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)) (or (not (fp.eq |c_ULTIMATE.start_main_~x1~0#1| |c_ULTIMATE.start_main_~x~0#1|)) (fp.eq |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (= |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-16 11:45:40,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 11:45:42,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 11:45:44,763 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-16 11:45:45,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:45:45,423 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-11-16 11:45:45,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:45:45,424 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 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 11 [2022-11-16 11:45:45,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:45:45,425 INFO L225 Difference]: With dead ends: 17 [2022-11-16 11:45:45,425 INFO L226 Difference]: Without dead ends: 13 [2022-11-16 11:45:45,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 77.2s TimeCoverageRelationStatistics Valid=51, Invalid=60, Unknown=25, NotChecked=464, Total=600 [2022-11-16 11:45:45,427 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:45:45,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 2 Unknown, 51 Unchecked, 6.5s Time] [2022-11-16 11:45:45,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-11-16 11:45:45,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-11-16 11:45:45,432 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-16 11:45:45,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-11-16 11:45:45,432 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-11-16 11:45:45,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:45:45,433 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-11-16 11:45:45,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 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-16 11:45:45,433 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-11-16 11:45:45,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 11:45:45,434 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:45:45,434 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1] [2022-11-16 11:45:45,462 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-11-16 11:45:45,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:45:45,652 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:45:45,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:45:45,652 INFO L85 PathProgramCache]: Analyzing trace with hash -967103989, now seen corresponding path program 4 times [2022-11-16 11:45:45,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:45:45,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [832376694] [2022-11-16 11:45:45,653 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 11:45:45,653 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:45:45,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:45:45,654 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:45:45,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-16 11:45:46,897 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 11:45:46,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:45:46,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-16 11:45:46,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:45:53,439 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-16 11:45:59,838 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-16 11:46:06,651 WARN L855 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0)))) is different from true [2022-11-16 11:46:13,660 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-16 11:46:18,821 WARN L233 SmtUtils]: Spent 5.12s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 11:46:31,926 WARN L233 SmtUtils]: Spent 7.33s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:46:35,976 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 18 not checked. [2022-11-16 11:46:35,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:46:56,023 WARN L833 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from false [2022-11-16 11:46:58,129 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from true [2022-11-16 11:47:04,625 WARN L833 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from false [2022-11-16 11:47:06,794 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from true [2022-11-16 11:47:13,472 WARN L833 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from false [2022-11-16 11:47:15,704 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from true [2022-11-16 11:47:22,592 WARN L833 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from false [2022-11-16 11:47:24,881 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from true [2022-11-16 11:47:31,935 WARN L833 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from false [2022-11-16 11:47:34,295 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from true [2022-11-16 11:47:41,387 WARN L833 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from false [2022-11-16 11:47:43,767 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from true [2022-11-16 11:47:43,768 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 20 not checked. [2022-11-16 11:47:43,768 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:47:43,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [832376694] [2022-11-16 11:47:43,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [832376694] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:47:43,768 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:47:43,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2022-11-16 11:47:43,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8909960] [2022-11-16 11:47:43,769 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:47:43,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-16 11:47:43,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:47:43,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-16 11:47:43,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=39, Unknown=19, NotChecked=210, Total=306 [2022-11-16 11:47:43,770 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 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-16 11:47:46,375 WARN L855 $PredicateComparison]: unable to prove that (and (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-16 11:47:48,748 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (not (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-16 11:47:50,939 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0)) (not (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) .cse0) .cse0) .cse0))) (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-11-16 11:47:53,274 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0)) (not (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) .cse0) .cse0) .cse0))) (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-16 11:47:55,521 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (not (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-16 11:47:57,804 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (not (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1)))) is different from false [2022-11-16 11:48:00,499 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (not (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1)))) is different from true [2022-11-16 11:48:02,559 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0)) (not (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0))) (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-11-16 11:48:05,372 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0)) (not (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0))) (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-16 11:48:08,254 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) |c_ULTIMATE.start_main_~x1~0#1|)) (= (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-16 11:48:10,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 11:48:13,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 11:48:15,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 11:48:17,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 11:48:20,201 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-16 11:48:22,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 11:48:22,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:48:22,726 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-11-16 11:48:22,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 11:48:22,728 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 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-16 11:48:22,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:48:22,728 INFO L225 Difference]: With dead ends: 19 [2022-11-16 11:48:22,728 INFO L226 Difference]: Without dead ends: 15 [2022-11-16 11:48:22,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 88.8s TimeCoverageRelationStatistics Valid=52, Invalid=43, Unknown=29, NotChecked=476, Total=600 [2022-11-16 11:48:22,730 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:48:22,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 6 Unknown, 76 Unchecked, 14.6s Time] [2022-11-16 11:48:22,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-11-16 11:48:22,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-11-16 11:48:22,734 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-16 11:48:22,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-11-16 11:48:22,736 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2022-11-16 11:48:22,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:48:22,736 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-11-16 11:48:22,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 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-16 11:48:22,737 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-11-16 11:48:22,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 11:48:22,737 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:48:22,738 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1] [2022-11-16 11:48:22,771 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-16 11:48:22,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:48:22,939 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:48:22,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:48:22,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1620705621, now seen corresponding path program 5 times [2022-11-16 11:48:22,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:48:22,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2087455090] [2022-11-16 11:48:22,939 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 11:48:22,940 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:48:22,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:48:22,940 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:48:22,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-16 11:48:25,304 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-11-16 11:48:25,304 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:48:25,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-16 11:48:25,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:48:32,128 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-16 11:48:38,757 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-16 11:48:46,017 WARN L855 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0)))) is different from true [2022-11-16 11:48:55,208 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0)) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-16 11:49:00,546 WARN L233 SmtUtils]: Spent 5.30s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 11:49:03,127 WARN L855 $PredicateComparison]: unable to prove that (and (= (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0)) |c_ULTIMATE.start_main_~x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-16 11:49:08,749 WARN L233 SmtUtils]: Spent 5.59s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 11:49:11,820 WARN L855 $PredicateComparison]: unable to prove that (and (= (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0)) |c_ULTIMATE.start_main_~x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-16 11:49:17,699 WARN L233 SmtUtils]: Spent 5.85s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 11:49:21,209 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-16 11:49:25,963 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 35 not checked. [2022-11-16 11:49:25,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:49:42,885 WARN L833 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from false [2022-11-16 11:49:44,998 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from true [2022-11-16 11:49:51,548 WARN L833 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from false [2022-11-16 11:49:53,726 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from true [2022-11-16 11:50:05,347 WARN L833 $PredicateComparison]: unable to prove that (or (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) (fp.eq |c_ULTIMATE.start_main_~x1~0#1| |c_ULTIMATE.start_main_~x~0#1|)) is different from false [2022-11-16 11:50:07,584 WARN L855 $PredicateComparison]: unable to prove that (or (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) (fp.eq |c_ULTIMATE.start_main_~x1~0#1| |c_ULTIMATE.start_main_~x~0#1|)) is different from true [2022-11-16 11:50:17,380 WARN L233 SmtUtils]: Spent 5.12s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 11:50:19,687 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2))) (or (fp.eq .cse0 |c_ULTIMATE.start_main_~x1~0#1|) (not (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode .cse0 .cse2) .cse2) .cse2))) (fp.eq (fp.div c_currentRoundingMode .cse1 .cse2) .cse1)))))) is different from false [2022-11-16 11:50:21,984 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2))) (or (fp.eq .cse0 |c_ULTIMATE.start_main_~x1~0#1|) (not (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode .cse0 .cse2) .cse2) .cse2))) (fp.eq (fp.div c_currentRoundingMode .cse1 .cse2) .cse1)))))) is different from true [2022-11-16 11:50:32,278 WARN L233 SmtUtils]: Spent 5.36s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 11:50:34,646 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse3))) (or (fp.eq .cse0 .cse1) (not (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode .cse0 .cse3) .cse3) .cse3))) (fp.eq (fp.div c_currentRoundingMode .cse2 .cse3) .cse2))))))) is different from false [2022-11-16 11:50:37,020 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse3))) (or (fp.eq .cse0 .cse1) (not (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode .cse0 .cse3) .cse3) .cse3))) (fp.eq (fp.div c_currentRoundingMode .cse2 .cse3) .cse2))))))) is different from true [2022-11-16 11:50:42,646 WARN L233 SmtUtils]: Spent 5.62s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 11:50:47,800 WARN L233 SmtUtils]: Spent 5.15s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 11:50:50,228 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) .cse3))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse3))) (or (fp.eq .cse0 .cse1) (not (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode .cse0 .cse3) .cse3) .cse3))) (fp.eq (fp.div c_currentRoundingMode .cse2 .cse3) .cse2))))))) is different from false [2022-11-16 11:50:52,682 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) .cse3))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse3))) (or (fp.eq .cse0 .cse1) (not (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode .cse0 .cse3) .cse3) .cse3))) (fp.eq (fp.div c_currentRoundingMode .cse2 .cse3) .cse2))))))) is different from true [2022-11-16 11:50:58,047 WARN L233 SmtUtils]: Spent 5.36s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 11:51:03,892 WARN L233 SmtUtils]: Spent 5.84s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 11:51:06,380 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) .cse3) .cse3))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse3))) (or (fp.eq .cse0 .cse1) (not (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode .cse0 .cse3) .cse3) .cse3))) (fp.eq (fp.div c_currentRoundingMode .cse2 .cse3) .cse2))))))) is different from false [2022-11-16 11:51:08,854 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) .cse3) .cse3))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse3))) (or (fp.eq .cse0 .cse1) (not (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode .cse0 .cse3) .cse3) .cse3))) (fp.eq (fp.div c_currentRoundingMode .cse2 .cse3) .cse2))))))) is different from true [2022-11-16 11:51:14,409 WARN L233 SmtUtils]: Spent 5.55s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 11:51:20,648 WARN L233 SmtUtils]: Spent 6.24s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 11:51:23,161 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse3) .cse3) .cse3) .cse3))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse3))) (or (fp.eq .cse0 .cse1) (not (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode .cse0 .cse3) .cse3) .cse3))) (fp.eq (fp.div c_currentRoundingMode .cse2 .cse3) .cse2))))))) is different from false [2022-11-16 11:51:25,719 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse3) .cse3) .cse3) .cse3))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse3))) (or (fp.eq .cse0 .cse1) (not (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode .cse0 .cse3) .cse3) .cse3))) (fp.eq (fp.div c_currentRoundingMode .cse2 .cse3) .cse2))))))) is different from true [2022-11-16 11:51:25,719 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 35 not checked. [2022-11-16 11:51:25,719 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:51:25,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2087455090] [2022-11-16 11:51:25,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2087455090] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:51:25,720 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:51:25,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2022-11-16 11:51:25,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896311181] [2022-11-16 11:51:25,720 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:51:25,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-16 11:51:25,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:51:25,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-16 11:51:25,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=34, Unknown=23, NotChecked=360, Total=462 [2022-11-16 11:51:25,722 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 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-16 11:51:28,523 WARN L855 $PredicateComparison]: unable to prove that (and (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse3) .cse3) .cse3) .cse3))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse3))) (or (fp.eq .cse0 .cse1) (not (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode .cse0 .cse3) .cse3) .cse3))) (fp.eq (fp.div c_currentRoundingMode .cse2 .cse3) .cse2))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-16 11:51:30,873 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0)) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) .cse0) .cse0))) (let ((.cse1 (fp.div c_currentRoundingMode .cse2 .cse0))) (or (fp.eq .cse1 .cse2) (not (let ((.cse3 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode .cse1 .cse0) .cse0) .cse0))) (fp.eq (fp.div c_currentRoundingMode .cse3 .cse0) .cse3)))))))) is different from false [2022-11-16 11:51:33,349 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0)) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) .cse0) .cse0))) (let ((.cse1 (fp.div c_currentRoundingMode .cse2 .cse0))) (or (fp.eq .cse1 .cse2) (not (let ((.cse3 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode .cse1 .cse0) .cse0) .cse0))) (fp.eq (fp.div c_currentRoundingMode .cse3 .cse0) .cse3)))))))) is different from true [2022-11-16 11:51:35,821 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) .cse3))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse3))) (or (fp.eq .cse0 .cse1) (not (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode .cse0 .cse3) .cse3) .cse3))) (fp.eq (fp.div c_currentRoundingMode .cse2 .cse3) .cse2)))))) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse3) .cse3)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-16 11:51:38,217 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0)) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0))) (let ((.cse1 (fp.div c_currentRoundingMode .cse2 .cse0))) (or (fp.eq .cse1 .cse2) (not (let ((.cse3 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode .cse1 .cse0) .cse0) .cse0))) (fp.eq (fp.div c_currentRoundingMode .cse3 .cse0) .cse3)))))))) is different from false [2022-11-16 11:51:40,611 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0)) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0))) (let ((.cse1 (fp.div c_currentRoundingMode .cse2 .cse0))) (or (fp.eq .cse1 .cse2) (not (let ((.cse3 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode .cse1 .cse0) .cse0) .cse0))) (fp.eq (fp.div c_currentRoundingMode .cse3 .cse0) .cse3)))))))) is different from true [2022-11-16 11:51:43,021 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2))) (or (fp.eq .cse0 |c_ULTIMATE.start_main_~x1~0#1|) (not (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode .cse0 .cse2) .cse2) .cse2))) (fp.eq (fp.div c_currentRoundingMode .cse1 .cse2) .cse1))))) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse2) .cse2) .cse2) .cse2)))) is different from false [2022-11-16 11:51:45,648 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2))) (or (fp.eq .cse0 |c_ULTIMATE.start_main_~x1~0#1|) (not (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode .cse0 .cse2) .cse2) .cse2))) (fp.eq (fp.div c_currentRoundingMode .cse1 .cse2) .cse1))))) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse2) .cse2) .cse2) .cse2)))) is different from true [2022-11-16 11:51:47,835 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0)) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)) (or (not (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) .cse0) .cse0))) (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1))) (fp.eq |c_ULTIMATE.start_main_~x1~0#1| |c_ULTIMATE.start_main_~x~0#1|)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-11-16 11:51:50,066 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0)) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)) (or (not (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) .cse0) .cse0))) (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1))) (fp.eq |c_ULTIMATE.start_main_~x1~0#1| |c_ULTIMATE.start_main_~x~0#1|)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-16 11:51:52,272 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (not (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))) (= (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) |c_ULTIMATE.start_main_~x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-16 11:51:55,921 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (not (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))) (= (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) |c_ULTIMATE.start_main_~x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-16 11:51:58,516 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0)) (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) |c_ULTIMATE.start_main_~x1~0#1|)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-16 11:52:00,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 11:52:02,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 11:52:05,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:52:05,560 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-11-16 11:52:05,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 11:52:05,606 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 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-16 11:52:05,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:52:05,606 INFO L225 Difference]: With dead ends: 21 [2022-11-16 11:52:05,606 INFO L226 Difference]: Without dead ends: 17 [2022-11-16 11:52:05,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 24 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 103.2s TimeCoverageRelationStatistics Valid=63, Invalid=39, Unknown=36, NotChecked=792, Total=930 [2022-11-16 11:52:05,608 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:52:05,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 1 Unknown, 114 Unchecked, 7.2s Time] [2022-11-16 11:52:05,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-11-16 11:52:05,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-11-16 11:52:05,613 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-16 11:52:05,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-11-16 11:52:05,614 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2022-11-16 11:52:05,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:52:05,614 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-11-16 11:52:05,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 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-16 11:52:05,615 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-11-16 11:52:05,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 11:52:05,615 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:52:05,615 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2022-11-16 11:52:05,655 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-16 11:52:05,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:52:05,816 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:52:05,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:52:05,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1628318539, now seen corresponding path program 6 times [2022-11-16 11:52:05,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:52:05,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1368800396] [2022-11-16 11:52:05,817 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-16 11:52:05,817 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:52:05,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:52:05,819 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:52:05,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682e525f-978e-4e95-878d-536a1d739be3/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-16 11:52:08,736 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-11-16 11:52:08,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:52:08,845 WARN L261 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-16 11:52:08,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:52:16,693 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-16 11:52:23,406 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-16 11:52:30,756 WARN L855 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0)))) is different from true [2022-11-16 11:52:35,970 WARN L233 SmtUtils]: Spent 5.18s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 11:52:38,210 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-16 11:52:44,531 WARN L233 SmtUtils]: Spent 5.27s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 11:52:57,804 WARN L233 SmtUtils]: Spent 7.94s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:53:03,477 WARN L233 SmtUtils]: Spent 5.62s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 11:53:07,062 WARN L855 $PredicateComparison]: unable to prove that (and (= (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0)) |c_ULTIMATE.start_main_~x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-16 11:53:12,985 WARN L233 SmtUtils]: Spent 5.89s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 11:53:16,714 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-16 11:53:22,834 WARN L233 SmtUtils]: Spent 6.09s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 11:53:25,032 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-16 11:53:33,790 WARN L233 SmtUtils]: Spent 6.38s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)