./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9ad7fb26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6403ea17225d9927b82c2cb5a5e13cab8e302736934880873dcec33bef71c423 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-03 04:33:57,031 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-03 04:33:57,033 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-03 04:33:57,077 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-03 04:33:57,078 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-03 04:33:57,082 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-03 04:33:57,084 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-03 04:33:57,088 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-03 04:33:57,090 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-03 04:33:57,095 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-03 04:33:57,098 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-03 04:33:57,100 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-03 04:33:57,101 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-03 04:33:57,103 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-03 04:33:57,106 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-03 04:33:57,112 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-03 04:33:57,117 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-03 04:33:57,118 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-03 04:33:57,120 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-03 04:33:57,129 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-03 04:33:57,130 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-03 04:33:57,132 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-03 04:33:57,135 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-03 04:33:57,137 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-03 04:33:57,145 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-03 04:33:57,146 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-03 04:33:57,146 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-03 04:33:57,149 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-03 04:33:57,150 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-03 04:33:57,151 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-03 04:33:57,152 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-03 04:33:57,153 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-03 04:33:57,154 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-03 04:33:57,155 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-03 04:33:57,157 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-03 04:33:57,157 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-03 04:33:57,158 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-03 04:33:57,158 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-03 04:33:57,158 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-03 04:33:57,159 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-03 04:33:57,160 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-03 04:33:57,161 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-03 04:33:57,211 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-03 04:33:57,211 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-03 04:33:57,213 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-03 04:33:57,213 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-03 04:33:57,213 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-03 04:33:57,213 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-03 04:33:57,214 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-03 04:33:57,214 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-03 04:33:57,214 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-03 04:33:57,214 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-03 04:33:57,215 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-03 04:33:57,215 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-03 04:33:57,216 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-03 04:33:57,216 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-03 04:33:57,216 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-03 04:33:57,217 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-03 04:33:57,217 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-03 04:33:57,217 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-03 04:33:57,217 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-03 04:33:57,217 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-03 04:33:57,218 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-03 04:33:57,218 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-03 04:33:57,218 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-03 04:33:57,218 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-03 04:33:57,218 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-03 04:33:57,218 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-03 04:33:57,219 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-03 04:33:57,219 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-03 04:33:57,219 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-03 04:33:57,221 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-03 04:33:57,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 04:33:57,221 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-03 04:33:57,222 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-03 04:33:57,222 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-03 04:33:57,222 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-03 04:33:57,222 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-03 04:33:57,222 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-03 04:33:57,223 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-03 04:33:57,223 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-03 04:33:57,223 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/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_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH 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 -> Taipan 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 -> 6403ea17225d9927b82c2cb5a5e13cab8e302736934880873dcec33bef71c423 [2021-11-03 04:33:57,493 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-03 04:33:57,513 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-03 04:33:57,516 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-03 04:33:57,517 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-03 04:33:57,517 INFO L275 PluginConnector]: CDTParser initialized [2021-11-03 04:33:57,518 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/../../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c [2021-11-03 04:33:57,576 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/data/8b29496c5/245d4a6bb53b45e5a8ca997e3ea59be2/FLAG4cac1e7fe [2021-11-03 04:33:58,038 INFO L306 CDTParser]: Found 1 translation units. [2021-11-03 04:33:58,039 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c [2021-11-03 04:33:58,045 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/data/8b29496c5/245d4a6bb53b45e5a8ca997e3ea59be2/FLAG4cac1e7fe [2021-11-03 04:33:58,416 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/data/8b29496c5/245d4a6bb53b45e5a8ca997e3ea59be2 [2021-11-03 04:33:58,418 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-03 04:33:58,420 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-03 04:33:58,421 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-03 04:33:58,421 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-03 04:33:58,424 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-03 04:33:58,425 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:33:58" (1/1) ... [2021-11-03 04:33:58,426 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b4761d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:33:58, skipping insertion in model container [2021-11-03 04:33:58,426 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:33:58" (1/1) ... [2021-11-03 04:33:58,446 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-03 04:33:58,468 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-03 04:33:58,657 WARN L228 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_3f107cc2-871b-43b3-8c8e-b6e889495107/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c[1310,1323] [2021-11-03 04:33:58,670 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 04:33:58,678 INFO L203 MainTranslator]: Completed pre-run [2021-11-03 04:33:58,693 WARN L228 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_3f107cc2-871b-43b3-8c8e-b6e889495107/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c[1310,1323] [2021-11-03 04:33:58,695 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 04:33:58,708 INFO L208 MainTranslator]: Completed translation [2021-11-03 04:33:58,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:33:58 WrapperNode [2021-11-03 04:33:58,709 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-03 04:33:58,709 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-03 04:33:58,710 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-03 04:33:58,710 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-03 04:33:58,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:33:58" (1/1) ... [2021-11-03 04:33:58,720 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:33:58" (1/1) ... [2021-11-03 04:33:58,737 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-03 04:33:58,738 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-03 04:33:58,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-03 04:33:58,738 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-03 04:33:58,746 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:33:58" (1/1) ... [2021-11-03 04:33:58,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:33:58" (1/1) ... [2021-11-03 04:33:58,748 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:33:58" (1/1) ... [2021-11-03 04:33:58,748 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:33:58" (1/1) ... [2021-11-03 04:33:58,752 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:33:58" (1/1) ... [2021-11-03 04:33:58,754 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:33:58" (1/1) ... [2021-11-03 04:33:58,755 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:33:58" (1/1) ... [2021-11-03 04:33:58,757 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-03 04:33:58,758 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-03 04:33:58,758 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-03 04:33:58,758 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-03 04:33:58,759 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:33:58" (1/1) ... [2021-11-03 04:33:58,766 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 04:33:58,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:33:58,790 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-03 04:33:58,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-03 04:33:58,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-03 04:33:58,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-03 04:33:58,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-03 04:33:58,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-03 04:33:59,149 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-03 04:33:59,149 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-03 04:33:59,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:33:59 BoogieIcfgContainer [2021-11-03 04:33:59,151 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-03 04:33:59,153 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-03 04:33:59,153 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-03 04:33:59,171 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-03 04:33:59,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 04:33:58" (1/3) ... [2021-11-03 04:33:59,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c21e50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:33:59, skipping insertion in model container [2021-11-03 04:33:59,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:33:58" (2/3) ... [2021-11-03 04:33:59,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c21e50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:33:59, skipping insertion in model container [2021-11-03 04:33:59,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:33:59" (3/3) ... [2021-11-03 04:33:59,190 INFO L111 eAbstractionObserver]: Analyzing ICFG filter1.c.p+cfa-reducer.c [2021-11-03 04:33:59,195 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-03 04:33:59,195 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-03 04:33:59,242 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-03 04:33:59,249 INFO L339 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=FINITE_AUTOMATA, 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-03 04:33:59,249 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-03 04:33:59,264 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 14 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) [2021-11-03 04:33:59,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-03 04:33:59,269 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:33:59,270 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:33:59,271 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:33:59,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:33:59,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1090715464, now seen corresponding path program 1 times [2021-11-03 04:33:59,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:33:59,298 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089196702] [2021-11-03 04:33:59,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:33:59,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:33:59,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:33:59,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:33:59,519 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:33:59,520 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089196702] [2021-11-03 04:33:59,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089196702] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:33:59,521 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:33:59,521 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:33:59,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332887567] [2021-11-03 04:33:59,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 04:33:59,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:33:59,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 04:33:59,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:33:59,551 INFO L87 Difference]: Start difference. First operand has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 14 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) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2021-11-03 04:33:59,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:33:59,602 INFO L93 Difference]: Finished difference Result 32 states and 44 transitions. [2021-11-03 04:33:59,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 04:33:59,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 [2021-11-03 04:33:59,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:33:59,613 INFO L225 Difference]: With dead ends: 32 [2021-11-03 04:33:59,613 INFO L226 Difference]: Without dead ends: 12 [2021-11-03 04:33:59,617 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:33:59,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2021-11-03 04:33:59,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2021-11-03 04:33:59,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:33:59,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2021-11-03 04:33:59,648 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 10 [2021-11-03 04:33:59,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:33:59,649 INFO L470 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2021-11-03 04:33:59,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2021-11-03 04:33:59,649 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2021-11-03 04:33:59,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-03 04:33:59,651 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:33:59,651 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:33:59,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-03 04:33:59,652 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:33:59,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:33:59,656 INFO L85 PathProgramCache]: Analyzing trace with hash -201086419, now seen corresponding path program 1 times [2021-11-03 04:33:59,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:33:59,656 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568824056] [2021-11-03 04:33:59,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:33:59,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:33:59,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:33:59,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:33:59,778 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:33:59,779 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568824056] [2021-11-03 04:33:59,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568824056] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:33:59,779 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:33:59,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-03 04:33:59,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129497264] [2021-11-03 04:33:59,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 04:33:59,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:33:59,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 04:33:59,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:33:59,783 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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) [2021-11-03 04:33:59,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:33:59,878 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2021-11-03 04:33:59,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-03 04:33:59,880 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 [2021-11-03 04:33:59,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:33:59,882 INFO L225 Difference]: With dead ends: 29 [2021-11-03 04:33:59,882 INFO L226 Difference]: Without dead ends: 27 [2021-11-03 04:33:59,883 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-03 04:33:59,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-11-03 04:33:59,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 14. [2021-11-03 04:33:59,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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) [2021-11-03 04:33:59,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2021-11-03 04:33:59,894 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 10 [2021-11-03 04:33:59,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:33:59,896 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-11-03 04:33:59,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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) [2021-11-03 04:33:59,897 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2021-11-03 04:33:59,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-03 04:33:59,897 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:33:59,897 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:33:59,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-03 04:33:59,898 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:33:59,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:33:59,900 INFO L85 PathProgramCache]: Analyzing trace with hash -184075758, now seen corresponding path program 1 times [2021-11-03 04:33:59,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:33:59,903 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092651184] [2021-11-03 04:33:59,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:33:59,904 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:33:59,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-03 04:33:59,937 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-03 04:33:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-03 04:33:59,997 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-03 04:33:59,997 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-03 04:33:59,998 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-03 04:34:00,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-03 04:34:00,010 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2021-11-03 04:34:00,013 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-03 04:34:00,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 04:34:00 BoogieIcfgContainer [2021-11-03 04:34:00,051 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-03 04:34:00,052 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-03 04:34:00,052 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-03 04:34:00,053 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-03 04:34:00,054 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:33:59" (3/4) ... [2021-11-03 04:34:00,060 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-03 04:34:00,060 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-03 04:34:00,063 INFO L168 Benchmark]: Toolchain (without parser) took 1641.57 ms. Allocated memory is still 140.5 MB. Free memory was 101.0 MB in the beginning and 68.2 MB in the end (delta: 32.8 MB). Peak memory consumption was 30.9 MB. Max. memory is 16.1 GB. [2021-11-03 04:34:00,064 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 140.5 MB. Free memory is still 117.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-03 04:34:00,069 INFO L168 Benchmark]: CACSL2BoogieTranslator took 287.69 ms. Allocated memory is still 140.5 MB. Free memory was 100.7 MB in the beginning and 113.7 MB in the end (delta: -13.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-03 04:34:00,071 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.90 ms. Allocated memory is still 140.5 MB. Free memory was 113.7 MB in the beginning and 112.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-03 04:34:00,071 INFO L168 Benchmark]: Boogie Preprocessor took 19.18 ms. Allocated memory is still 140.5 MB. Free memory was 112.3 MB in the beginning and 110.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-03 04:34:00,072 INFO L168 Benchmark]: RCFGBuilder took 393.43 ms. Allocated memory is still 140.5 MB. Free memory was 110.9 MB in the beginning and 99.7 MB in the end (delta: 11.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-11-03 04:34:00,072 INFO L168 Benchmark]: TraceAbstraction took 898.36 ms. Allocated memory is still 140.5 MB. Free memory was 99.0 MB in the beginning and 69.0 MB in the end (delta: 30.1 MB). Peak memory consumption was 31.5 MB. Max. memory is 16.1 GB. [2021-11-03 04:34:00,073 INFO L168 Benchmark]: Witness Printer took 8.22 ms. Allocated memory is still 140.5 MB. Free memory was 69.0 MB in the beginning and 68.2 MB in the end (delta: 712.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-03 04:34:00,080 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.23 ms. Allocated memory is still 140.5 MB. Free memory is still 117.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 287.69 ms. Allocated memory is still 140.5 MB. Free memory was 100.7 MB in the beginning and 113.7 MB in the end (delta: -13.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 27.90 ms. Allocated memory is still 140.5 MB. Free memory was 113.7 MB in the beginning and 112.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 19.18 ms. Allocated memory is still 140.5 MB. Free memory was 112.3 MB in the beginning and 110.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 393.43 ms. Allocated memory is still 140.5 MB. Free memory was 110.9 MB in the beginning and 99.7 MB in the end (delta: 11.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 898.36 ms. Allocated memory is still 140.5 MB. Free memory was 99.0 MB in the beginning and 69.0 MB in the end (delta: 30.1 MB). Peak memory consumption was 31.5 MB. Max. memory is 16.1 GB. * Witness Printer took 8.22 ms. Allocated memory is still 140.5 MB. Free memory was 69.0 MB in the beginning and 68.2 MB in the end (delta: 712.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * 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: 56]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 43, overapproximation of to_real at line 39, overapproximation of someBinaryArithmeticDOUBLEoperation at line 80. Possible FailurePath: [L1] int __return_main; [L15] double main__E0; [L16] double main__E1; [L17] double main__S; [L18] int main__i; [L19] main__E1 = 0 [L20] main__S = 0 [L21] main__i = 0 VAL [__return_main=0] [L23] COND TRUE main__i <= 1000000 [L25] main__E0 = __VERIFIER_nondet_double() [L26] int main____CPAchecker_TMP_0; VAL [__return_main=0] [L27] COND TRUE main__E0 >= -1.0 VAL [__return_main=0] [L29] COND TRUE main__E0 <= 1.0 [L31] main____CPAchecker_TMP_0 = 1 VAL [__return_main=0] [L33] COND TRUE main____CPAchecker_TMP_0 != 0 [L35] int main____CPAchecker_TMP_1; [L36] main____CPAchecker_TMP_1 = __VERIFIER_nondet_int() [L37] COND FALSE !(!(main____CPAchecker_TMP_1 == 0)) [L80] main__S = ((0.999 * main__S) + main__E0) - main__E1 [L41] main__E1 = main__E0 [L42] int main____CPAchecker_TMP_2; VAL [__return_main=0] [L43] COND FALSE !(main__S >= -10000.0) VAL [__return_main=0] [L69] main____CPAchecker_TMP_2 = 0 VAL [__return_main=0] [L50] int __tmp_1; [L51] __tmp_1 = main____CPAchecker_TMP_2 [L52] int __VERIFIER_assert__cond; [L53] __VERIFIER_assert__cond = __tmp_1 VAL [__return_main=0] [L54] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0] [L56] reach_error() VAL [__return_main=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 39 SDtfs, 32 SDslu, 40 SDs, 0 SdLazy, 25 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=0, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 13 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 30 NumberOfCodeBlocks, 30 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 28 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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 [2021-11-03 04:34:00,121 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6403ea17225d9927b82c2cb5a5e13cab8e302736934880873dcec33bef71c423 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-03 04:34:02,454 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-03 04:34:02,457 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-03 04:34:02,517 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-03 04:34:02,518 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-03 04:34:02,524 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-03 04:34:02,525 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-03 04:34:02,527 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-03 04:34:02,529 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-03 04:34:02,531 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-03 04:34:02,532 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-03 04:34:02,533 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-03 04:34:02,534 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-03 04:34:02,535 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-03 04:34:02,537 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-03 04:34:02,538 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-03 04:34:02,539 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-03 04:34:02,540 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-03 04:34:02,543 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-03 04:34:02,546 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-03 04:34:02,548 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-03 04:34:02,549 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-03 04:34:02,551 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-03 04:34:02,552 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-03 04:34:02,556 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-03 04:34:02,556 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-03 04:34:02,557 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-03 04:34:02,558 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-03 04:34:02,559 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-03 04:34:02,560 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-03 04:34:02,560 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-03 04:34:02,561 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-03 04:34:02,562 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-03 04:34:02,563 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-03 04:34:02,564 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-03 04:34:02,565 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-03 04:34:02,566 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-03 04:34:02,566 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-03 04:34:02,566 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-03 04:34:02,567 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-03 04:34:02,569 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-03 04:34:02,570 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-11-03 04:34:02,610 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-03 04:34:02,610 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-03 04:34:02,611 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-03 04:34:02,612 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-03 04:34:02,612 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-03 04:34:02,612 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-03 04:34:02,612 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-03 04:34:02,613 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-03 04:34:02,613 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-03 04:34:02,614 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-03 04:34:02,615 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-03 04:34:02,616 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-03 04:34:02,616 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-03 04:34:02,616 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-03 04:34:02,616 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-03 04:34:02,616 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-03 04:34:02,617 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-03 04:34:02,617 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-03 04:34:02,617 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-03 04:34:02,617 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-03 04:34:02,618 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-03 04:34:02,618 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-03 04:34:02,618 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-03 04:34:02,618 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-03 04:34:02,619 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-03 04:34:02,619 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-03 04:34:02,619 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 04:34:02,619 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-03 04:34:02,620 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-03 04:34:02,620 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-03 04:34:02,620 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-03 04:34:02,620 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-03 04:34:02,621 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-03 04:34:02,621 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-03 04:34:02,621 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-03 04:34:02,621 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_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/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_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH 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 -> Taipan 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 -> 6403ea17225d9927b82c2cb5a5e13cab8e302736934880873dcec33bef71c423 [2021-11-03 04:34:02,975 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-03 04:34:03,008 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-03 04:34:03,010 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-03 04:34:03,010 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-03 04:34:03,011 INFO L275 PluginConnector]: CDTParser initialized [2021-11-03 04:34:03,012 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/../../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c [2021-11-03 04:34:03,086 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/data/8ee275e06/f219cd9cd2054e63bcf1a8ca7b27330c/FLAGa4870af6e [2021-11-03 04:34:03,565 INFO L306 CDTParser]: Found 1 translation units. [2021-11-03 04:34:03,566 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c [2021-11-03 04:34:03,574 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/data/8ee275e06/f219cd9cd2054e63bcf1a8ca7b27330c/FLAGa4870af6e [2021-11-03 04:34:03,948 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/data/8ee275e06/f219cd9cd2054e63bcf1a8ca7b27330c [2021-11-03 04:34:03,951 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-03 04:34:03,953 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-03 04:34:03,955 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-03 04:34:03,956 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-03 04:34:03,959 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-03 04:34:03,960 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:34:03" (1/1) ... [2021-11-03 04:34:03,961 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e8d4172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:34:03, skipping insertion in model container [2021-11-03 04:34:03,961 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:34:03" (1/1) ... [2021-11-03 04:34:03,969 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-03 04:34:03,989 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-03 04:34:04,167 WARN L228 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_3f107cc2-871b-43b3-8c8e-b6e889495107/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c[1310,1323] [2021-11-03 04:34:04,173 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 04:34:04,185 INFO L203 MainTranslator]: Completed pre-run [2021-11-03 04:34:04,252 WARN L228 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_3f107cc2-871b-43b3-8c8e-b6e889495107/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c[1310,1323] [2021-11-03 04:34:04,269 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 04:34:04,285 INFO L208 MainTranslator]: Completed translation [2021-11-03 04:34:04,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:34:04 WrapperNode [2021-11-03 04:34:04,286 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-03 04:34:04,287 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-03 04:34:04,288 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-03 04:34:04,288 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-03 04:34:04,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:34:04" (1/1) ... [2021-11-03 04:34:04,315 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:34:04" (1/1) ... [2021-11-03 04:34:04,339 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-03 04:34:04,340 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-03 04:34:04,340 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-03 04:34:04,340 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-03 04:34:04,348 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:34:04" (1/1) ... [2021-11-03 04:34:04,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:34:04" (1/1) ... [2021-11-03 04:34:04,356 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:34:04" (1/1) ... [2021-11-03 04:34:04,357 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:34:04" (1/1) ... [2021-11-03 04:34:04,375 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:34:04" (1/1) ... [2021-11-03 04:34:04,377 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:34:04" (1/1) ... [2021-11-03 04:34:04,381 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:34:04" (1/1) ... [2021-11-03 04:34:04,393 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-03 04:34:04,394 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-03 04:34:04,394 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-03 04:34:04,394 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-03 04:34:04,396 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:34:04" (1/1) ... [2021-11-03 04:34:04,403 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 04:34:04,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:34:04,429 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-03 04:34:04,448 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-03 04:34:04,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-03 04:34:04,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-03 04:34:04,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-03 04:34:04,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-03 04:34:05,803 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-03 04:34:05,803 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-03 04:34:05,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:34:05 BoogieIcfgContainer [2021-11-03 04:34:05,805 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-03 04:34:05,807 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-03 04:34:05,807 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-03 04:34:05,810 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-03 04:34:05,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 04:34:03" (1/3) ... [2021-11-03 04:34:05,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72b6325f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:34:05, skipping insertion in model container [2021-11-03 04:34:05,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:34:04" (2/3) ... [2021-11-03 04:34:05,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72b6325f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:34:05, skipping insertion in model container [2021-11-03 04:34:05,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:34:05" (3/3) ... [2021-11-03 04:34:05,813 INFO L111 eAbstractionObserver]: Analyzing ICFG filter1.c.p+cfa-reducer.c [2021-11-03 04:34:05,818 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-03 04:34:05,818 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-03 04:34:05,879 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-03 04:34:05,885 INFO L339 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=FINITE_AUTOMATA, 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-03 04:34:05,886 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-03 04:34:05,898 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 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) [2021-11-03 04:34:05,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-03 04:34:05,903 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:34:05,904 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:34:05,905 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:34:05,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:34:05,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1824272086, now seen corresponding path program 1 times [2021-11-03 04:34:05,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 04:34:05,922 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1426440333] [2021-11-03 04:34:05,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:34:05,923 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 04:34:05,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 04:34:05,927 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 04:34:05,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-03 04:34:06,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:34:06,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-03 04:34:06,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:34:06,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:34:06,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:34:06,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:34:06,185 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 04:34:06,185 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1426440333] [2021-11-03 04:34:06,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1426440333] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 04:34:06,186 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:34:06,187 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-03 04:34:06,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153017401] [2021-11-03 04:34:06,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 04:34:06,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 04:34:06,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 04:34:06,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:34:06,209 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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) [2021-11-03 04:34:06,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:34:06,248 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2021-11-03 04:34:06,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 04:34:06,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-03 04:34:06,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:34:06,258 INFO L225 Difference]: With dead ends: 40 [2021-11-03 04:34:06,258 INFO L226 Difference]: Without dead ends: 15 [2021-11-03 04:34:06,261 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:34:06,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-11-03 04:34:06,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-11-03 04:34:06,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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) [2021-11-03 04:34:06,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2021-11-03 04:34:06,290 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 13 [2021-11-03 04:34:06,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:34:06,291 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2021-11-03 04:34:06,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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) [2021-11-03 04:34:06,292 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2021-11-03 04:34:06,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-03 04:34:06,292 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:34:06,293 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:34:06,305 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-03 04:34:06,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 [2021-11-03 04:34:06,501 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:34:06,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:34:06,502 INFO L85 PathProgramCache]: Analyzing trace with hash -2000333105, now seen corresponding path program 1 times [2021-11-03 04:34:06,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 04:34:06,503 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1094525518] [2021-11-03 04:34:06,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:34:06,504 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 04:34:06,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 04:34:06,505 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 04:34:06,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-03 04:34:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:34:06,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-03 04:34:06,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:34:06,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:34:06,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:34:06,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:34:06,833 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 04:34:06,833 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1094525518] [2021-11-03 04:34:06,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1094525518] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 04:34:06,834 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:34:06,834 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-03 04:34:06,834 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012869595] [2021-11-03 04:34:06,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-03 04:34:06,836 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 04:34:06,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-03 04:34:06,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-03 04:34:06,838 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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) [2021-11-03 04:34:06,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:34:06,979 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2021-11-03 04:34:06,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-03 04:34:06,981 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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 13 [2021-11-03 04:34:06,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:34:06,982 INFO L225 Difference]: With dead ends: 41 [2021-11-03 04:34:06,982 INFO L226 Difference]: Without dead ends: 39 [2021-11-03 04:34:06,983 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-11-03 04:34:06,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-11-03 04:34:06,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 17. [2021-11-03 04:34:06,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 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) [2021-11-03 04:34:06,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2021-11-03 04:34:06,989 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 13 [2021-11-03 04:34:06,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:34:06,989 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2021-11-03 04:34:06,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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) [2021-11-03 04:34:06,990 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2021-11-03 04:34:06,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-03 04:34:06,992 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:34:06,993 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:34:07,008 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-03 04:34:07,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 [2021-11-03 04:34:07,194 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:34:07,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:34:07,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1983322444, now seen corresponding path program 1 times [2021-11-03 04:34:07,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 04:34:07,196 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1744635249] [2021-11-03 04:34:07,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:34:07,196 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 04:34:07,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 04:34:07,200 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 04:34:07,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-03 04:34:07,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:34:07,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-03 04:34:07,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:34:07,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:34:07,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:34:07,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:34:07,462 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 04:34:07,462 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1744635249] [2021-11-03 04:34:07,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1744635249] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 04:34:07,463 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:34:07,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-03 04:34:07,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600796425] [2021-11-03 04:34:07,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:34:07,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 04:34:07,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:34:07,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:34:07,465 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) [2021-11-03 04:34:08,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:34:08,215 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2021-11-03 04:34:08,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:34:08,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 13 [2021-11-03 04:34:08,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:34:08,219 INFO L225 Difference]: With dead ends: 52 [2021-11-03 04:34:08,219 INFO L226 Difference]: Without dead ends: 37 [2021-11-03 04:34:08,219 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:34:08,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-11-03 04:34:08,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 20. [2021-11-03 04:34:08,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 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) [2021-11-03 04:34:08,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2021-11-03 04:34:08,225 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 13 [2021-11-03 04:34:08,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:34:08,226 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2021-11-03 04:34:08,226 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) [2021-11-03 04:34:08,226 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2021-11-03 04:34:08,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-03 04:34:08,227 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:34:08,227 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:34:08,243 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-03 04:34:08,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 [2021-11-03 04:34:08,440 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:34:08,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:34:08,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1270566899, now seen corresponding path program 1 times [2021-11-03 04:34:08,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 04:34:08,441 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [127545052] [2021-11-03 04:34:08,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:34:08,442 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 04:34:08,442 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 04:34:08,443 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 04:34:08,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-03 04:34:08,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:34:08,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-03 04:34:08,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:34:09,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:34:09,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:34:15,716 WARN L838 $PredicateComparison]: unable to prove that (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) c_ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) is different from false [2021-11-03 04:34:17,753 WARN L860 $PredicateComparison]: unable to prove that (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) c_ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) is different from true [2021-11-03 04:34:32,126 WARN L838 $PredicateComparison]: unable to prove that (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) c_ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq c_ULTIMATE.start_main_~main__E0~0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from false [2021-11-03 04:34:34,166 WARN L860 $PredicateComparison]: unable to prove that (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) c_ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq c_ULTIMATE.start_main_~main__E0~0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from true [2021-11-03 04:34:48,575 WARN L860 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__E0~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq ULTIMATE.start_main_~main__E0~0 .cse0)) (not (fp.geq ULTIMATE.start_main_~main__E0~0 (fp.neg .cse0)))))) is different from true [2021-11-03 04:35:01,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:35:01,013 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 04:35:01,013 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [127545052] [2021-11-03 04:35:01,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [127545052] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 04:35:01,013 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:35:01,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2021-11-03 04:35:01,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434835567] [2021-11-03 04:35:01,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 04:35:01,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 04:35:01,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 04:35:01,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=30, Unknown=5, NotChecked=42, Total=110 [2021-11-03 04:35:01,016 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 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) [2021-11-03 04:35:03,319 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (forall ((ULTIMATE.start_main_~main__E0~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq ULTIMATE.start_main_~main__E0~0 .cse0)) (not (fp.geq ULTIMATE.start_main_~main__E0~0 (fp.neg .cse0)))))) (= .cse1 c_ULTIMATE.start_main_~main__E1~0) (= .cse1 c_ULTIMATE.start_main_~main__S~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-03 04:35:05,370 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq c_ULTIMATE.start_main_~main__E0~0 (fp.neg .cse0)) (= .cse1 c_ULTIMATE.start_main_~main__E1~0) (= .cse1 c_ULTIMATE.start_main_~main__S~0) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) c_ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq c_ULTIMATE.start_main_~main__E0~0 .cse0))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-03 04:35:07,418 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (fp.leq c_ULTIMATE.start_main_~main__E0~0 .cse0) (fp.geq c_ULTIMATE.start_main_~main__E0~0 (fp.neg .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) c_ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (= .cse1 c_ULTIMATE.start_main_~main__E1~0) (= .cse1 c_ULTIMATE.start_main_~main__S~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-03 04:35:10,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:35:10,288 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2021-11-03 04:35:10,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-03 04:35:10,289 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 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 13 [2021-11-03 04:35:10,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:35:10,289 INFO L225 Difference]: With dead ends: 68 [2021-11-03 04:35:10,289 INFO L226 Difference]: Without dead ends: 50 [2021-11-03 04:35:10,290 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=39, Invalid=33, Unknown=8, NotChecked=102, Total=182 [2021-11-03 04:35:10,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-11-03 04:35:10,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 25. [2021-11-03 04:35:10,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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) [2021-11-03 04:35:10,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2021-11-03 04:35:10,294 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 13 [2021-11-03 04:35:10,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:35:10,294 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2021-11-03 04:35:10,294 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 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) [2021-11-03 04:35:10,295 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2021-11-03 04:35:10,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-03 04:35:10,295 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:35:10,295 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:35:10,312 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-03 04:35:10,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 [2021-11-03 04:35:10,496 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:35:10,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:35:10,496 INFO L85 PathProgramCache]: Analyzing trace with hash -3307942, now seen corresponding path program 1 times [2021-11-03 04:35:10,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 04:35:10,498 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1186565282] [2021-11-03 04:35:10,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:35:10,498 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 04:35:10,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 04:35:10,499 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 04:35:10,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-03 04:35:10,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:35:11,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-03 04:35:11,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:35:38,506 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:35:38,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:35:46,715 WARN L838 $PredicateComparison]: unable to prove that (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) c_ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) is different from false [2021-11-03 04:35:48,755 WARN L860 $PredicateComparison]: unable to prove that (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) c_ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) is different from true [2021-11-03 04:36:03,117 WARN L838 $PredicateComparison]: unable to prove that (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) c_ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq c_ULTIMATE.start_main_~main__E0~0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from false [2021-11-03 04:36:05,160 WARN L860 $PredicateComparison]: unable to prove that (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) c_ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq c_ULTIMATE.start_main_~main__E0~0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from true [2021-11-03 04:36:16,952 WARN L860 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__E0~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq ULTIMATE.start_main_~main__E0~0 .cse0)) (not (fp.geq ULTIMATE.start_main_~main__E0~0 (fp.neg .cse0)))))) is different from true [2021-11-03 04:37:33,435 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~main__E0~0_14 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~main__E0~0_14 (fp.neg .cse0))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) v_ULTIMATE.start_main_~main__E0~0_14) c_ULTIMATE.start_main_~main__E0~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq v_ULTIMATE.start_main_~main__E0~0_14 .cse0))))) is different from true [2021-11-03 04:37:46,745 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-11-03 04:37:46,746 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 04:37:46,746 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1186565282] [2021-11-03 04:37:46,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1186565282] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:37:46,746 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2128644433] [2021-11-03 04:37:46,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:37:46,746 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-03 04:37:46,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/cvc4 [2021-11-03 04:37:46,748 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-03 04:37:46,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2021-11-03 04:37:47,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:37:47,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-03 04:37:47,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:37:59,908 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:37:59,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:39:45,587 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~main__E0~0_16 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) v_ULTIMATE.start_main_~main__E0~0_16) c_ULTIMATE.start_main_~main__E0~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.geq v_ULTIMATE.start_main_~main__E0~0_16 (fp.neg .cse0))) (not (fp.leq v_ULTIMATE.start_main_~main__E0~0_16 .cse0))))) is different from true [2021-11-03 04:40:06,182 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((v_ULTIMATE.start_main_~main__E0~0_14 (_ FloatingPoint 11 53))) (or (not (fp.geq v_ULTIMATE.start_main_~main__E0~0_14 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) v_ULTIMATE.start_main_~main__E0~0_14) c_ULTIMATE.start_main_~main__E0~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))))) (not (fp.leq c_ULTIMATE.start_main_~main__E0~0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from true [2021-11-03 04:40:08,158 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2021-11-03 04:40:08,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2128644433] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:40:08,159 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293803401] [2021-11-03 04:40:08,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:40:08,159 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:40:08,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:40:08,164 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:40:08,165 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-03 04:40:11,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:40:11,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-03 04:40:11,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:40:19,073 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:40:19,074 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:40:50,089 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) c_ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq c_ULTIMATE.start_main_~main__E0~0 .cse0)) (not (fp.geq c_ULTIMATE.start_main_~main__E0~0 (fp.neg .cse0))))) is different from false [2021-11-03 04:40:52,139 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) c_ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq c_ULTIMATE.start_main_~main__E0~0 .cse0)) (not (fp.geq c_ULTIMATE.start_main_~main__E0~0 (fp.neg .cse0))))) is different from true [2021-11-03 04:41:06,608 WARN L860 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_#t~nondet7| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) |ULTIMATE.start_main_#t~nondet7|) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |ULTIMATE.start_main_#t~nondet7| .cse0)) (not (fp.geq |ULTIMATE.start_main_#t~nondet7| (fp.neg .cse0)))))) is different from true [2021-11-03 04:42:10,916 WARN L860 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_#t~nondet7| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) |ULTIMATE.start_main_#t~nondet7|) c_ULTIMATE.start_main_~main__E0~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |ULTIMATE.start_main_#t~nondet7| .cse0)) (not (fp.geq |ULTIMATE.start_main_#t~nondet7| (fp.neg .cse0)))))) is different from true [2021-11-03 04:42:40,854 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2021-11-03 04:42:40,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293803401] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:42:40,854 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2021-11-03 04:42:40,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9, 9, 9, 10] total 21 [2021-11-03 04:42:40,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88397774] [2021-11-03 04:42:40,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-03 04:42:40,856 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 04:42:40,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-03 04:42:40,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=85, Unknown=22, NotChecked=252, Total=420 [2021-11-03 04:42:40,858 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 21 states have internal predecessors, (54), 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) [2021-11-03 04:43:24,316 WARN L207 SmtUtils]: Spent 21.65 s on a formula simplification. DAG size of input: 38 DAG size of output: 16 [2021-11-03 04:43:33,352 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.neg .cse1))) (and (forall ((v_ULTIMATE.start_main_~main__E0~0_14 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~main__E0~0_14 (fp.neg .cse0))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) v_ULTIMATE.start_main_~main__E0~0_14) c_ULTIMATE.start_main_~main__E0~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq v_ULTIMATE.start_main_~main__E0~0_14 .cse0))))) (fp.leq c_ULTIMATE.start_main_~main__E1~0 .cse1) (fp.leq c_ULTIMATE.start_main_~main__E0~0 .cse1) (fp.geq c_ULTIMATE.start_main_~main__E1~0 .cse2) (fp.geq c_ULTIMATE.start_main_~main__E0~0 .cse2) (forall ((|ULTIMATE.start_main_#t~nondet7| (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) |ULTIMATE.start_main_#t~nondet7|) c_ULTIMATE.start_main_~main__E0~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |ULTIMATE.start_main_#t~nondet7| .cse3)) (not (fp.geq |ULTIMATE.start_main_#t~nondet7| (fp.neg .cse3)))))) (forall ((v_ULTIMATE.start_main_~main__E0~0_16 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) v_ULTIMATE.start_main_~main__E0~0_16) c_ULTIMATE.start_main_~main__E0~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.geq v_ULTIMATE.start_main_~main__E0~0_16 (fp.neg .cse4))) (not (fp.leq v_ULTIMATE.start_main_~main__E0~0_16 .cse4))))) (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)) c_ULTIMATE.start_main_~main__S~0) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2021-11-03 04:43:41,653 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (forall ((ULTIMATE.start_main_~main__E0~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq ULTIMATE.start_main_~main__E0~0 .cse0)) (not (fp.geq ULTIMATE.start_main_~main__E0~0 (fp.neg .cse0)))))) (exists ((ULTIMATE.start_main_~main__E1~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~main__E0~0 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.neg .cse1))) (and (= c_ULTIMATE.start_main_~main__S~0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) ULTIMATE.start_main_~main__E0~0) ULTIMATE.start_main_~main__E1~0)) (fp.leq ULTIMATE.start_main_~main__E1~0 .cse1) (fp.leq ULTIMATE.start_main_~main__E0~0 .cse1) (fp.geq ULTIMATE.start_main_~main__E1~0 .cse2) (fp.geq ULTIMATE.start_main_~main__E0~0 .cse2))))) (fp.leq c_ULTIMATE.start_main_~main__E1~0 .cse3) (fp.geq c_ULTIMATE.start_main_~main__E1~0 (fp.neg .cse3)) (forall ((|ULTIMATE.start_main_#t~nondet7| (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) |ULTIMATE.start_main_#t~nondet7|) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |ULTIMATE.start_main_#t~nondet7| .cse4)) (not (fp.geq |ULTIMATE.start_main_#t~nondet7| (fp.neg .cse4)))))) (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)) c_ULTIMATE.start_main_~main__S~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-03 04:43:48,850 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (forall ((ULTIMATE.start_main_~main__E0~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq ULTIMATE.start_main_~main__E0~0 .cse0)) (not (fp.geq ULTIMATE.start_main_~main__E0~0 (fp.neg .cse0)))))) (fp.leq c_ULTIMATE.start_main_~main__E1~0 .cse1) (fp.geq c_ULTIMATE.start_main_~main__E1~0 (fp.neg .cse1)) (forall ((|ULTIMATE.start_main_#t~nondet7| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) |ULTIMATE.start_main_#t~nondet7|) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |ULTIMATE.start_main_#t~nondet7| .cse2)) (not (fp.geq |ULTIMATE.start_main_#t~nondet7| (fp.neg .cse2)))))) (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)) c_ULTIMATE.start_main_~main__S~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-03 04:44:01,420 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.neg .cse1))) (and (forall ((ULTIMATE.start_main_~main__E0~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq ULTIMATE.start_main_~main__E0~0 .cse0)) (not (fp.geq ULTIMATE.start_main_~main__E0~0 (fp.neg .cse0)))))) (fp.leq c_ULTIMATE.start_main_~main__E1~0 .cse1) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) c_ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq c_ULTIMATE.start_main_~main__E0~0 .cse1)) (not (fp.geq c_ULTIMATE.start_main_~main__E0~0 .cse2))) (fp.geq c_ULTIMATE.start_main_~main__E1~0 .cse2) (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)) c_ULTIMATE.start_main_~main__S~0) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2021-11-03 04:44:04,877 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.neg .cse0)) (.cse1 (not (fp.leq c_ULTIMATE.start_main_~main__E0~0 .cse0)))) (and (fp.leq c_ULTIMATE.start_main_~main__E1~0 .cse0) (or (forall ((v_ULTIMATE.start_main_~main__E0~0_14 (_ FloatingPoint 11 53))) (or (not (fp.geq v_ULTIMATE.start_main_~main__E0~0_14 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) v_ULTIMATE.start_main_~main__E0~0_14) c_ULTIMATE.start_main_~main__E0~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))))) .cse1) (fp.geq c_ULTIMATE.start_main_~main__E1~0 .cse2) (fp.geq c_ULTIMATE.start_main_~main__E0~0 .cse2) (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)) c_ULTIMATE.start_main_~main__S~0) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) c_ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) .cse1) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2021-11-03 04:44:46,166 WARN L207 SmtUtils]: Spent 30.77 s on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2021-11-03 04:44:48,471 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.neg .cse1))) (and (forall ((v_ULTIMATE.start_main_~main__E0~0_14 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~main__E0~0_14 (fp.neg .cse0))) (not (fp.leq v_ULTIMATE.start_main_~main__E0~0_14 .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) v_ULTIMATE.start_main_~main__E0~0_14) c_ULTIMATE.start_main_~main__E0~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))))) (fp.leq c_ULTIMATE.start_main_~main__E1~0 .cse1) (fp.leq c_ULTIMATE.start_main_~main__E0~0 .cse1) (fp.geq c_ULTIMATE.start_main_~main__E1~0 .cse2) (fp.geq c_ULTIMATE.start_main_~main__E0~0 .cse2) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) c_ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)) c_ULTIMATE.start_main_~main__S~0) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2021-11-03 04:45:11,251 WARN L207 SmtUtils]: Spent 14.86 s on a formula simplification that was a NOOP. DAG size: 38 [2021-11-03 04:45:13,368 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~main__E0~0_14 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~main__E0~0_14 (fp.neg .cse0))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) v_ULTIMATE.start_main_~main__E0~0_14) c_ULTIMATE.start_main_~main__E0~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq v_ULTIMATE.start_main_~main__E0~0_14 .cse0))))) (forall ((|ULTIMATE.start_main_#t~nondet7| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) |ULTIMATE.start_main_#t~nondet7|) c_ULTIMATE.start_main_~main__E0~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |ULTIMATE.start_main_#t~nondet7| .cse1)) (not (fp.geq |ULTIMATE.start_main_#t~nondet7| (fp.neg .cse1)))))) (forall ((v_ULTIMATE.start_main_~main__E0~0_16 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) v_ULTIMATE.start_main_~main__E0~0_16) c_ULTIMATE.start_main_~main__E0~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.geq v_ULTIMATE.start_main_~main__E0~0_16 (fp.neg .cse2))) (not (fp.leq v_ULTIMATE.start_main_~main__E0~0_16 .cse2)))))) is different from true [2021-11-03 04:45:19,882 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (forall ((v_ULTIMATE.start_main_~main__E0~0_14 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~main__E0~0_14 (fp.neg .cse0))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) v_ULTIMATE.start_main_~main__E0~0_14) c_ULTIMATE.start_main_~main__E0~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq v_ULTIMATE.start_main_~main__E0~0_14 .cse0))))) (forall ((v_ULTIMATE.start_main_~main__E0~0_14 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~main__E0~0_14 (fp.neg .cse1))) (not (fp.leq v_ULTIMATE.start_main_~main__E0~0_14 .cse1)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) v_ULTIMATE.start_main_~main__E0~0_14) c_ULTIMATE.start_main_~main__E0~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))))) (exists ((ULTIMATE.start_main_~main__E1~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~main__E0~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.neg .cse2))) (and (= c_ULTIMATE.start_main_~main__S~0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) ULTIMATE.start_main_~main__E0~0) ULTIMATE.start_main_~main__E1~0)) (fp.leq ULTIMATE.start_main_~main__E1~0 .cse2) (fp.leq ULTIMATE.start_main_~main__E0~0 .cse2) (fp.geq ULTIMATE.start_main_~main__E1~0 .cse3) (fp.geq ULTIMATE.start_main_~main__E0~0 .cse3))))) (fp.leq c_ULTIMATE.start_main_~main__E0~0 .cse4) (fp.geq c_ULTIMATE.start_main_~main__E0~0 (fp.neg .cse4)) (forall ((|ULTIMATE.start_main_#t~nondet7| (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) |ULTIMATE.start_main_#t~nondet7|) c_ULTIMATE.start_main_~main__E0~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |ULTIMATE.start_main_#t~nondet7| .cse5)) (not (fp.geq |ULTIMATE.start_main_#t~nondet7| (fp.neg .cse5)))))) (forall ((v_ULTIMATE.start_main_~main__E0~0_16 (_ FloatingPoint 11 53))) (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) v_ULTIMATE.start_main_~main__E0~0_16) c_ULTIMATE.start_main_~main__E0~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.geq v_ULTIMATE.start_main_~main__E0~0_16 (fp.neg .cse6))) (not (fp.leq v_ULTIMATE.start_main_~main__E0~0_16 .cse6))))) (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)) c_ULTIMATE.start_main_~main__S~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2021-11-03 04:45:21,970 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (forall ((v_ULTIMATE.start_main_~main__E0~0_14 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~main__E0~0_14 (fp.neg .cse0))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) v_ULTIMATE.start_main_~main__E0~0_14) c_ULTIMATE.start_main_~main__E0~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq v_ULTIMATE.start_main_~main__E0~0_14 .cse0))))) (forall ((v_ULTIMATE.start_main_~main__E0~0_14 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~main__E0~0_14 (fp.neg .cse1))) (not (fp.leq v_ULTIMATE.start_main_~main__E0~0_14 .cse1)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) v_ULTIMATE.start_main_~main__E0~0_14) c_ULTIMATE.start_main_~main__E0~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))))) (exists ((ULTIMATE.start_main_~main__E1~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~main__E0~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.neg .cse2))) (and (= c_ULTIMATE.start_main_~main__S~0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) ULTIMATE.start_main_~main__E0~0) ULTIMATE.start_main_~main__E1~0)) (fp.leq ULTIMATE.start_main_~main__E1~0 .cse2) (fp.leq ULTIMATE.start_main_~main__E0~0 .cse2) (fp.geq ULTIMATE.start_main_~main__E1~0 .cse3) (fp.geq ULTIMATE.start_main_~main__E0~0 .cse3))))) (fp.leq c_ULTIMATE.start_main_~main__E0~0 .cse4) (fp.geq c_ULTIMATE.start_main_~main__E0~0 (fp.neg .cse4)) (forall ((|ULTIMATE.start_main_#t~nondet7| (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) |ULTIMATE.start_main_#t~nondet7|) c_ULTIMATE.start_main_~main__E0~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |ULTIMATE.start_main_#t~nondet7| .cse5)) (not (fp.geq |ULTIMATE.start_main_#t~nondet7| (fp.neg .cse5)))))) (forall ((v_ULTIMATE.start_main_~main__E0~0_16 (_ FloatingPoint 11 53))) (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) v_ULTIMATE.start_main_~main__E0~0_16) c_ULTIMATE.start_main_~main__E0~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.geq v_ULTIMATE.start_main_~main__E0~0_16 (fp.neg .cse6))) (not (fp.leq v_ULTIMATE.start_main_~main__E0~0_16 .cse6))))) (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)) c_ULTIMATE.start_main_~main__S~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-03 04:45:26,299 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((ULTIMATE.start_main_~main__E0~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq ULTIMATE.start_main_~main__E0~0 .cse0)) (not (fp.geq ULTIMATE.start_main_~main__E0~0 (fp.neg .cse0)))))) (forall ((|ULTIMATE.start_main_#t~nondet7| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) |ULTIMATE.start_main_#t~nondet7|) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |ULTIMATE.start_main_#t~nondet7| .cse1)) (not (fp.geq |ULTIMATE.start_main_#t~nondet7| (fp.neg .cse1))))))) is different from true [2021-11-03 04:45:37,652 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((ULTIMATE.start_main_~main__E0~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq ULTIMATE.start_main_~main__E0~0 .cse0)) (not (fp.geq ULTIMATE.start_main_~main__E0~0 (fp.neg .cse0)))))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) c_ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq c_ULTIMATE.start_main_~main__E0~0 .cse1)) (not (fp.geq c_ULTIMATE.start_main_~main__E0~0 (fp.neg .cse1)))))) is different from false [2021-11-03 04:45:39,733 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((ULTIMATE.start_main_~main__E0~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq ULTIMATE.start_main_~main__E0~0 .cse0)) (not (fp.geq ULTIMATE.start_main_~main__E0~0 (fp.neg .cse0)))))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) c_ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq c_ULTIMATE.start_main_~main__E0~0 .cse1)) (not (fp.geq c_ULTIMATE.start_main_~main__E0~0 (fp.neg .cse1)))))) is different from true [2021-11-03 04:45:41,796 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (not (fp.leq c_ULTIMATE.start_main_~main__E0~0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))))) (and (or (forall ((v_ULTIMATE.start_main_~main__E0~0_14 (_ FloatingPoint 11 53))) (or (not (fp.geq v_ULTIMATE.start_main_~main__E0~0_14 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) v_ULTIMATE.start_main_~main__E0~0_14) c_ULTIMATE.start_main_~main__E0~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))))) .cse0) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) c_ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) .cse0))) is different from false [2021-11-03 04:45:43,860 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (not (fp.leq c_ULTIMATE.start_main_~main__E0~0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))))) (and (or (forall ((v_ULTIMATE.start_main_~main__E0~0_14 (_ FloatingPoint 11 53))) (or (not (fp.geq v_ULTIMATE.start_main_~main__E0~0_14 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) v_ULTIMATE.start_main_~main__E0~0_14) c_ULTIMATE.start_main_~main__E0~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))))) .cse0) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) c_ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) .cse0))) is different from true [2021-11-03 04:46:11,584 WARN L207 SmtUtils]: Spent 7.60 s on a formula simplification that was a NOOP. DAG size: 27 [2021-11-03 04:46:13,654 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~main__E0~0_14 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~main__E0~0_14 (fp.neg .cse0))) (not (fp.leq v_ULTIMATE.start_main_~main__E0~0_14 .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) v_ULTIMATE.start_main_~main__E0~0_14) c_ULTIMATE.start_main_~main__E0~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) c_ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) is different from false [2021-11-03 04:46:15,713 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~main__E0~0_14 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~main__E0~0_14 (fp.neg .cse0))) (not (fp.leq v_ULTIMATE.start_main_~main__E0~0_14 .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) v_ULTIMATE.start_main_~main__E0~0_14) c_ULTIMATE.start_main_~main__E0~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) c_ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) is different from true [2021-11-03 04:46:26,996 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~main__E0~0_14 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~main__E0~0_14 (fp.neg .cse0))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) v_ULTIMATE.start_main_~main__E0~0_14) c_ULTIMATE.start_main_~main__E0~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq v_ULTIMATE.start_main_~main__E0~0_14 .cse0))))) (forall ((v_ULTIMATE.start_main_~main__E0~0_14 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~main__E0~0_14 (fp.neg .cse1))) (not (fp.leq v_ULTIMATE.start_main_~main__E0~0_14 .cse1)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) v_ULTIMATE.start_main_~main__E0~0_14) c_ULTIMATE.start_main_~main__E0~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))))) (forall ((|ULTIMATE.start_main_#t~nondet7| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) |ULTIMATE.start_main_#t~nondet7|) c_ULTIMATE.start_main_~main__E0~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |ULTIMATE.start_main_#t~nondet7| .cse2)) (not (fp.geq |ULTIMATE.start_main_#t~nondet7| (fp.neg .cse2)))))) (forall ((v_ULTIMATE.start_main_~main__E0~0_16 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) v_ULTIMATE.start_main_~main__E0~0_16) c_ULTIMATE.start_main_~main__E0~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.geq v_ULTIMATE.start_main_~main__E0~0_16 (fp.neg .cse3))) (not (fp.leq v_ULTIMATE.start_main_~main__E0~0_16 .cse3))))) (fp.geq c_ULTIMATE.start_main_~main__S~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) is different from true [2021-11-03 04:46:29,624 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((ULTIMATE.start_main_~main__E0~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq ULTIMATE.start_main_~main__E0~0 .cse0)) (not (fp.geq ULTIMATE.start_main_~main__E0~0 (fp.neg .cse0)))))) (forall ((|ULTIMATE.start_main_#t~nondet7| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) |ULTIMATE.start_main_#t~nondet7|) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |ULTIMATE.start_main_#t~nondet7| .cse1)) (not (fp.geq |ULTIMATE.start_main_#t~nondet7| (fp.neg .cse1)))))) (fp.geq c_ULTIMATE.start_main_~main__S~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) is different from true [2021-11-03 04:46:29,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:46:29,639 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2021-11-03 04:46:29,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-03 04:46:29,640 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 21 states have internal predecessors, (54), 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 23 [2021-11-03 04:46:29,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:46:29,641 INFO L225 Difference]: With dead ends: 84 [2021-11-03 04:46:29,642 INFO L226 Difference]: Without dead ends: 66 [2021-11-03 04:46:29,643 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 113 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 23 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 251.0s TimeCoverageRelationStatistics Valid=155, Invalid=256, Unknown=61, NotChecked=1334, Total=1806 [2021-11-03 04:46:29,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-11-03 04:46:29,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 37. [2021-11-03 04:46:29,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 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) [2021-11-03 04:46:29,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2021-11-03 04:46:29,654 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 23 [2021-11-03 04:46:29,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:46:29,655 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2021-11-03 04:46:29,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 21 states have internal predecessors, (54), 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) [2021-11-03 04:46:29,655 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2021-11-03 04:46:29,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-03 04:46:29,656 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:46:29,657 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:46:29,676 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-03 04:46:29,872 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2021-11-03 04:46:30,107 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-03 04:46:30,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/cvc4 --incremental --print-success --lang smt,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:46:30,269 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:46:30,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:46:30,270 INFO L85 PathProgramCache]: Analyzing trace with hash -530303885, now seen corresponding path program 1 times [2021-11-03 04:46:30,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 04:46:30,270 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1635688299] [2021-11-03 04:46:30,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:46:30,271 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 04:46:30,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 04:46:30,272 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 04:46:30,275 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f107cc2-871b-43b3-8c8e-b6e889495107/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-03 04:46:32,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:46:32,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-03 04:46:32,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:47:20,418 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~main__E1~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~main__E0~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.neg .cse0))) (and (fp.leq ULTIMATE.start_main_~main__E1~0 .cse0) (= (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (fp.mul c_currentRoundingMode .cse1 (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) ULTIMATE.start_main_~main__E1~0) .cse2)))) ULTIMATE.start_main_~main__E0~0) ULTIMATE.start_main_~main__E1~0) c_ULTIMATE.start_main_~main__S~0) (fp.leq ULTIMATE.start_main_~main__E0~0 .cse0) (fp.geq ULTIMATE.start_main_~main__E1~0 .cse3) (fp.geq ULTIMATE.start_main_~main__E0~0 .cse3))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false