./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 63182f13 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF --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 27e2c506f8c4790ab21ed41c19bd1ea2839907b43d1ff7cacbbc276ad919ab4e --- Real Ultimate output --- This is Ultimate 0.2.1-dev-63182f1 [2021-11-12 23:28:20,020 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-12 23:28:20,022 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-12 23:28:20,084 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-12 23:28:20,085 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-12 23:28:20,086 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-12 23:28:20,089 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-12 23:28:20,091 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-12 23:28:20,094 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-12 23:28:20,096 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-12 23:28:20,097 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-12 23:28:20,099 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-12 23:28:20,100 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-12 23:28:20,101 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-12 23:28:20,104 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-12 23:28:20,106 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-12 23:28:20,107 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-12 23:28:20,109 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-12 23:28:20,112 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-12 23:28:20,115 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-12 23:28:20,118 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-12 23:28:20,120 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-12 23:28:20,122 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-12 23:28:20,124 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-12 23:28:20,129 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-12 23:28:20,130 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-12 23:28:20,130 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-12 23:28:20,131 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-12 23:28:20,132 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-12 23:28:20,134 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-12 23:28:20,134 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-12 23:28:20,136 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-12 23:28:20,137 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-12 23:28:20,138 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-12 23:28:20,140 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-12 23:28:20,141 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-12 23:28:20,142 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-12 23:28:20,142 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-12 23:28:20,146 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-12 23:28:20,147 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-12 23:28:20,149 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-12 23:28:20,151 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-12 23:28:20,204 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-12 23:28:20,211 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-12 23:28:20,212 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-12 23:28:20,212 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-12 23:28:20,213 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-12 23:28:20,213 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-12 23:28:20,213 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-12 23:28:20,213 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-12 23:28:20,214 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-12 23:28:20,214 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-12 23:28:20,214 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-12 23:28:20,214 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-12 23:28:20,215 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-12 23:28:20,215 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-12 23:28:20,215 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-12 23:28:20,215 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-12 23:28:20,216 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-12 23:28:20,217 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-12 23:28:20,217 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-12 23:28:20,217 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-12 23:28:20,217 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-12 23:28:20,218 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-12 23:28:20,218 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-12 23:28:20,218 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-12 23:28:20,218 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-12 23:28:20,218 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-12 23:28:20,219 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-12 23:28:20,219 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-12 23:28:20,219 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-12 23:28:20,219 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-12 23:28:20,220 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-12 23:28:20,220 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-12 23:28:20,220 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-12 23:28:20,220 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-12 23:28:20,221 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-12 23:28:20,221 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-12 23:28:20,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-12 23:28:20,221 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-12 23:28:20,222 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-12 23:28:20,222 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-12 23:28:20,222 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_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/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_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF 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 -> 27e2c506f8c4790ab21ed41c19bd1ea2839907b43d1ff7cacbbc276ad919ab4e [2021-11-12 23:28:20,596 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-12 23:28:20,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-12 23:28:20,635 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-12 23:28:20,637 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-12 23:28:20,638 INFO L275 PluginConnector]: CDTParser initialized [2021-11-12 23:28:20,640 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/../../sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c [2021-11-12 23:28:20,751 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/data/e2b9aa6a5/d8a2a389f14c47e294dc6274bc6462b6/FLAG97a39180e [2021-11-12 23:28:21,428 INFO L306 CDTParser]: Found 1 translation units. [2021-11-12 23:28:21,429 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c [2021-11-12 23:28:21,436 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/data/e2b9aa6a5/d8a2a389f14c47e294dc6274bc6462b6/FLAG97a39180e [2021-11-12 23:28:21,764 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/data/e2b9aa6a5/d8a2a389f14c47e294dc6274bc6462b6 [2021-11-12 23:28:21,767 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-12 23:28:21,769 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-12 23:28:21,771 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-12 23:28:21,771 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-12 23:28:21,789 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-12 23:28:21,790 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 11:28:21" (1/1) ... [2021-11-12 23:28:21,792 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b188b5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:28:21, skipping insertion in model container [2021-11-12 23:28:21,794 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 11:28:21" (1/1) ... [2021-11-12 23:28:21,802 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-12 23:28:21,827 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-12 23:28:22,083 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_2e0dee7d-1b20-4c84-a973-a43a6def35e9/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[1355,1368] [2021-11-12 23:28:22,093 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_2e0dee7d-1b20-4c84-a973-a43a6def35e9/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[2394,2407] [2021-11-12 23:28:22,100 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-12 23:28:22,111 INFO L203 MainTranslator]: Completed pre-run [2021-11-12 23:28:22,132 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_2e0dee7d-1b20-4c84-a973-a43a6def35e9/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[1355,1368] [2021-11-12 23:28:22,137 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_2e0dee7d-1b20-4c84-a973-a43a6def35e9/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[2394,2407] [2021-11-12 23:28:22,143 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-12 23:28:22,159 INFO L208 MainTranslator]: Completed translation [2021-11-12 23:28:22,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:28:22 WrapperNode [2021-11-12 23:28:22,160 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-12 23:28:22,162 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-12 23:28:22,162 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-12 23:28:22,162 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-12 23:28:22,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:28:22" (1/1) ... [2021-11-12 23:28:22,181 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:28:22" (1/1) ... [2021-11-12 23:28:22,206 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-12 23:28:22,207 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-12 23:28:22,207 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-12 23:28:22,208 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-12 23:28:22,217 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:28:22" (1/1) ... [2021-11-12 23:28:22,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:28:22" (1/1) ... [2021-11-12 23:28:22,220 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:28:22" (1/1) ... [2021-11-12 23:28:22,220 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:28:22" (1/1) ... [2021-11-12 23:28:22,226 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:28:22" (1/1) ... [2021-11-12 23:28:22,230 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:28:22" (1/1) ... [2021-11-12 23:28:22,231 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:28:22" (1/1) ... [2021-11-12 23:28:22,234 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-12 23:28:22,235 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-12 23:28:22,236 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-12 23:28:22,236 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-12 23:28:22,237 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:28:22" (1/1) ... [2021-11-12 23:28:22,250 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-12 23:28:22,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:28:22,297 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-12 23:28:22,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-12 23:28:22,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-12 23:28:22,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-12 23:28:22,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-12 23:28:22,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-12 23:28:22,811 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-12 23:28:22,811 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-12 23:28:22,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 11:28:22 BoogieIcfgContainer [2021-11-12 23:28:22,814 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-12 23:28:22,817 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-12 23:28:22,817 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-12 23:28:22,821 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-12 23:28:22,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 11:28:21" (1/3) ... [2021-11-12 23:28:22,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f7b1701 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 11:28:22, skipping insertion in model container [2021-11-12 23:28:22,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:28:22" (2/3) ... [2021-11-12 23:28:22,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f7b1701 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 11:28:22, skipping insertion in model container [2021-11-12 23:28:22,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 11:28:22" (3/3) ... [2021-11-12 23:28:22,825 INFO L111 eAbstractionObserver]: Analyzing ICFG filter1.c.v+lhb-reducer.c [2021-11-12 23:28:22,832 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-12 23:28:22,833 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-12 23:28:22,893 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-12 23:28:22,902 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-12 23:28:22,902 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-11-12 23:28:22,924 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 26 states have internal predecessors, (40), 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-12 23:28:22,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-12 23:28:22,941 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:28:22,941 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:28:22,942 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-12 23:28:22,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:28:22,962 INFO L85 PathProgramCache]: Analyzing trace with hash -576365883, now seen corresponding path program 1 times [2021-11-12 23:28:22,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:28:22,978 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792834924] [2021-11-12 23:28:22,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:28:22,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:28:23,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:28:23,307 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-12 23:28:23,308 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:28:23,309 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792834924] [2021-11-12 23:28:23,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792834924] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:28:23,310 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:28:23,310 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-12 23:28:23,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926719760] [2021-11-12 23:28:23,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:28:23,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-12 23:28:23,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:28:23,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-12 23:28:23,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-12 23:28:23,356 INFO L87 Difference]: Start difference. First operand has 27 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 26 states have internal predecessors, (40), 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 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-12 23:28:23,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:28:23,470 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2021-11-12 23:28:23,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-12 23:28:23,474 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-12 23:28:23,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:28:23,483 INFO L225 Difference]: With dead ends: 37 [2021-11-12 23:28:23,484 INFO L226 Difference]: Without dead ends: 29 [2021-11-12 23:28:23,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-12 23:28:23,492 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 37 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.17ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.91ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.26ms IncrementalHoareTripleChecker+Time [2021-11-12 23:28:23,494 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 92 Invalid, 29 Unknown, 0 Unchecked, 2.91ms Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 33.26ms Time] [2021-11-12 23:28:23,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-11-12 23:28:23,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2021-11-12 23:28:23,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 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-12 23:28:23,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2021-11-12 23:28:23,534 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 10 [2021-11-12 23:28:23,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:28:23,535 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2021-11-12 23:28:23,535 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-12 23:28:23,535 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2021-11-12 23:28:23,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-12 23:28:23,536 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:28:23,536 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:28:23,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-12 23:28:23,537 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-12 23:28:23,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:28:23,538 INFO L85 PathProgramCache]: Analyzing trace with hash -508829686, now seen corresponding path program 1 times [2021-11-12 23:28:23,539 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:28:23,539 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109403850] [2021-11-12 23:28:23,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:28:23,540 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:28:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-12 23:28:23,559 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-12 23:28:23,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-12 23:28:23,600 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-12 23:28:23,600 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-12 23:28:23,602 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-11-12 23:28:23,604 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-11-12 23:28:23,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-12 23:28:23,609 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2021-11-12 23:28:23,613 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-12 23:28:23,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 11:28:23 BoogieIcfgContainer [2021-11-12 23:28:23,648 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-12 23:28:23,649 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-12 23:28:23,649 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-12 23:28:23,649 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-12 23:28:23,650 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 11:28:22" (3/4) ... [2021-11-12 23:28:23,653 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-12 23:28:23,653 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-12 23:28:23,654 INFO L158 Benchmark]: Toolchain (without parser) took 1885.16ms. Allocated memory is still 102.8MB. Free memory was 67.4MB in the beginning and 68.5MB in the end (delta: -1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-12 23:28:23,655 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 79.7MB. Free memory was 53.1MB in the beginning and 53.1MB in the end (delta: 27.2kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-12 23:28:23,655 INFO L158 Benchmark]: CACSL2BoogieTranslator took 389.69ms. Allocated memory is still 102.8MB. Free memory was 67.2MB in the beginning and 77.1MB in the end (delta: -9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-12 23:28:23,656 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.69ms. Allocated memory is still 102.8MB. Free memory was 77.1MB in the beginning and 75.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-12 23:28:23,657 INFO L158 Benchmark]: Boogie Preprocessor took 27.32ms. Allocated memory is still 102.8MB. Free memory was 75.4MB in the beginning and 74.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-12 23:28:23,657 INFO L158 Benchmark]: RCFGBuilder took 579.32ms. Allocated memory is still 102.8MB. Free memory was 74.2MB in the beginning and 62.0MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-12 23:28:23,658 INFO L158 Benchmark]: TraceAbstraction took 831.37ms. Allocated memory is still 102.8MB. Free memory was 61.7MB in the beginning and 69.0MB in the end (delta: -7.3MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-12 23:28:23,659 INFO L158 Benchmark]: Witness Printer took 4.61ms. Allocated memory is still 102.8MB. Free memory was 69.0MB in the beginning and 68.5MB in the end (delta: 493.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-12 23:28:23,669 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.39ms. Allocated memory is still 79.7MB. Free memory was 53.1MB in the beginning and 53.1MB in the end (delta: 27.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 389.69ms. Allocated memory is still 102.8MB. Free memory was 67.2MB in the beginning and 77.1MB in the end (delta: -9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.69ms. Allocated memory is still 102.8MB. Free memory was 77.1MB in the beginning and 75.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.32ms. Allocated memory is still 102.8MB. Free memory was 75.4MB in the beginning and 74.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 579.32ms. Allocated memory is still 102.8MB. Free memory was 74.2MB in the beginning and 62.0MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 831.37ms. Allocated memory is still 102.8MB. Free memory was 61.7MB in the beginning and 69.0MB in the end (delta: -7.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.61ms. Allocated memory is still 102.8MB. Free memory was 69.0MB in the beginning and 68.5MB in the end (delta: 493.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 58]: 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 45, overapproximation of to_real at line 41, overapproximation of someBinaryArithmeticDOUBLEoperation at line 173. Possible FailurePath: [L1] int __return_main; [L13] int __tmp_129_0; [L14] int __tmp_129_1; [L15] int __tmp_129_2; [L16] int __return_134; [L19] double main__E0; [L20] double main__E1; [L21] double main__S; [L22] int main__i; [L23] main__E1 = 0 [L24] main__S = 0 [L25] main__i = 0 VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main__i=0] [L26] COND TRUE main__i <= 1000000 [L28] main__E0 = __VERIFIER_nondet_double() [L29] int main____CPAchecker_TMP_0; VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main__E0=49, main__i=0] [L30] COND TRUE main__E0 >= -1.0 VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main__E0=49, main__i=0] [L32] COND TRUE main__E0 <= 1.0 [L34] main____CPAchecker_TMP_0 = 1 VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main__E0=49, main__i=0] [L35] COND TRUE main____CPAchecker_TMP_0 != 0 [L37] int main____CPAchecker_TMP_1; [L38] main____CPAchecker_TMP_1 = __VERIFIER_nondet_int() [L39] COND FALSE !(!(main____CPAchecker_TMP_1 == 0)) [L173] main__S = ((0.999 * main__S) + main__E0) - main__E1 [L43] main__E1 = main__E0 [L44] int main____CPAchecker_TMP_2; VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__E0=49, main__E1=49, main__i=0] [L45] COND FALSE !(main__S >= -10000.0) VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__E0=49, main__E1=49, main__i=0] [L162] main____CPAchecker_TMP_2 = 0 VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main____CPAchecker_TMP_2=0, main__E0=49, main__E1=49, main__i=0] [L52] int __tmp_1; [L53] __tmp_1 = main____CPAchecker_TMP_2 [L54] int __VERIFIER_assert__cond; [L55] __VERIFIER_assert__cond = __tmp_1 VAL [__return_134=0, __return_main=0, __tmp_1=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main____CPAchecker_TMP_2=0, main__E0=49, main__E1=49, main__i=0] [L56] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_134=0, __return_main=0, __tmp_1=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main____CPAchecker_TMP_2=0, main__E0=49, main__E1=49, main__i=0] [L58] reach_error() VAL [__return_134=0, __return_main=0, __tmp_1=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main____CPAchecker_TMP_2=0, main__E0=49, main__E1=49, main__i=0] - UnprovableResult [Line: 104]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 27 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 37 SdHoareTripleChecker+Valid, 33.26ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37 mSDsluCounter, 92 SdHoareTripleChecker+Invalid, 27.17ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 68 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27 IncrementalHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 31 mSDtfsCounter, 27 mSolverCounterSat, 2.91ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=0, InterpolantAutomatonStates: 7, 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, 1 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 17 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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-12 23:28:23,727 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/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_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF --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 27e2c506f8c4790ab21ed41c19bd1ea2839907b43d1ff7cacbbc276ad919ab4e --- Real Ultimate output --- This is Ultimate 0.2.1-dev-63182f1 [2021-11-12 23:28:26,637 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-12 23:28:26,640 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-12 23:28:26,715 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-12 23:28:26,716 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-12 23:28:26,721 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-12 23:28:26,723 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-12 23:28:26,728 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-12 23:28:26,732 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-12 23:28:26,740 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-12 23:28:26,742 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-12 23:28:26,744 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-12 23:28:26,745 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-12 23:28:26,748 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-12 23:28:26,750 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-12 23:28:26,756 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-12 23:28:26,757 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-12 23:28:26,759 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-12 23:28:26,761 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-12 23:28:26,770 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-12 23:28:26,773 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-12 23:28:26,774 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-12 23:28:26,777 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-12 23:28:26,780 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-12 23:28:26,790 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-12 23:28:26,791 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-12 23:28:26,791 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-12 23:28:26,794 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-12 23:28:26,795 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-12 23:28:26,796 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-12 23:28:26,796 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-12 23:28:26,797 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-12 23:28:26,800 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-12 23:28:26,801 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-12 23:28:26,803 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-12 23:28:26,803 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-12 23:28:26,804 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-12 23:28:26,804 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-12 23:28:26,805 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-12 23:28:26,807 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-12 23:28:26,808 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-12 23:28:26,814 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-11-12 23:28:26,864 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-12 23:28:26,864 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-12 23:28:26,865 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-12 23:28:26,866 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-12 23:28:26,866 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-12 23:28:26,866 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-12 23:28:26,866 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-12 23:28:26,867 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-12 23:28:26,868 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-12 23:28:26,868 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-12 23:28:26,870 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-12 23:28:26,871 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-12 23:28:26,871 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-12 23:28:26,871 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-12 23:28:26,871 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-12 23:28:26,872 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-12 23:28:26,872 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-12 23:28:26,872 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-12 23:28:26,872 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-12 23:28:26,872 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-12 23:28:26,873 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-12 23:28:26,873 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-12 23:28:26,873 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-12 23:28:26,873 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-12 23:28:26,874 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-12 23:28:26,874 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-12 23:28:26,874 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-12 23:28:26,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-12 23:28:26,875 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-12 23:28:26,875 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-12 23:28:26,875 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-12 23:28:26,875 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-12 23:28:26,875 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-12 23:28:26,876 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-12 23:28:26,876 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-12 23:28:26,877 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-12 23:28:26,877 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_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/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_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF 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 -> 27e2c506f8c4790ab21ed41c19bd1ea2839907b43d1ff7cacbbc276ad919ab4e [2021-11-12 23:28:27,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-12 23:28:27,410 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-12 23:28:27,414 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-12 23:28:27,416 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-12 23:28:27,420 INFO L275 PluginConnector]: CDTParser initialized [2021-11-12 23:28:27,421 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/../../sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c [2021-11-12 23:28:27,508 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/data/6c8fc9db5/fc7173bc853348de8068a51110cce8bc/FLAG2f88e7c55 [2021-11-12 23:28:28,130 INFO L306 CDTParser]: Found 1 translation units. [2021-11-12 23:28:28,131 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c [2021-11-12 23:28:28,145 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/data/6c8fc9db5/fc7173bc853348de8068a51110cce8bc/FLAG2f88e7c55 [2021-11-12 23:28:28,445 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/data/6c8fc9db5/fc7173bc853348de8068a51110cce8bc [2021-11-12 23:28:28,448 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-12 23:28:28,451 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-12 23:28:28,456 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-12 23:28:28,456 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-12 23:28:28,461 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-12 23:28:28,462 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 11:28:28" (1/1) ... [2021-11-12 23:28:28,463 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27f458c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:28:28, skipping insertion in model container [2021-11-12 23:28:28,464 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 11:28:28" (1/1) ... [2021-11-12 23:28:28,473 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-12 23:28:28,509 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-12 23:28:28,779 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_2e0dee7d-1b20-4c84-a973-a43a6def35e9/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[1355,1368] [2021-11-12 23:28:28,802 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_2e0dee7d-1b20-4c84-a973-a43a6def35e9/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[2394,2407] [2021-11-12 23:28:28,817 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-12 23:28:28,865 INFO L203 MainTranslator]: Completed pre-run [2021-11-12 23:28:28,927 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_2e0dee7d-1b20-4c84-a973-a43a6def35e9/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[1355,1368] [2021-11-12 23:28:28,933 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_2e0dee7d-1b20-4c84-a973-a43a6def35e9/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[2394,2407] [2021-11-12 23:28:28,952 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-12 23:28:28,989 INFO L208 MainTranslator]: Completed translation [2021-11-12 23:28:28,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:28:28 WrapperNode [2021-11-12 23:28:28,990 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-12 23:28:28,991 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-12 23:28:28,991 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-12 23:28:28,992 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-12 23:28:29,004 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:28:28" (1/1) ... [2021-11-12 23:28:29,032 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:28:28" (1/1) ... [2021-11-12 23:28:29,078 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-12 23:28:29,079 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-12 23:28:29,079 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-12 23:28:29,079 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-12 23:28:29,092 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:28:28" (1/1) ... [2021-11-12 23:28:29,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:28:28" (1/1) ... [2021-11-12 23:28:29,099 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:28:28" (1/1) ... [2021-11-12 23:28:29,100 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:28:28" (1/1) ... [2021-11-12 23:28:29,107 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:28:28" (1/1) ... [2021-11-12 23:28:29,110 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:28:28" (1/1) ... [2021-11-12 23:28:29,113 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:28:28" (1/1) ... [2021-11-12 23:28:29,126 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-12 23:28:29,127 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-12 23:28:29,127 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-12 23:28:29,127 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-12 23:28:29,128 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:28:28" (1/1) ... [2021-11-12 23:28:29,137 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-12 23:28:29,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:28:29,173 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-12 23:28:29,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-12 23:28:29,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-12 23:28:29,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-12 23:28:29,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-12 23:28:29,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-12 23:28:32,235 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-12 23:28:32,235 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-12 23:28:32,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 11:28:32 BoogieIcfgContainer [2021-11-12 23:28:32,238 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-12 23:28:32,240 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-12 23:28:32,241 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-12 23:28:32,244 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-12 23:28:32,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 11:28:28" (1/3) ... [2021-11-12 23:28:32,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7619dbea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 11:28:32, skipping insertion in model container [2021-11-12 23:28:32,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:28:28" (2/3) ... [2021-11-12 23:28:32,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7619dbea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 11:28:32, skipping insertion in model container [2021-11-12 23:28:32,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 11:28:32" (3/3) ... [2021-11-12 23:28:32,249 INFO L111 eAbstractionObserver]: Analyzing ICFG filter1.c.v+lhb-reducer.c [2021-11-12 23:28:32,256 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-12 23:28:32,256 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-12 23:28:32,341 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-12 23:28:32,350 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-12 23:28:32,350 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-11-12 23:28:32,369 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 30 states have (on average 1.6) internal successors, (48), 32 states have internal predecessors, (48), 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-12 23:28:32,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-12 23:28:32,376 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:28:32,377 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:28:32,378 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-12 23:28:32,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:28:32,385 INFO L85 PathProgramCache]: Analyzing trace with hash 775758574, now seen corresponding path program 1 times [2021-11-12 23:28:32,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-12 23:28:32,401 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [944270932] [2021-11-12 23:28:32,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:28:32,402 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-12 23:28:32,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/mathsat [2021-11-12 23:28:32,407 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-12 23:28:32,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-12 23:28:32,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:28:32,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-12 23:28:32,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:28:32,695 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-12 23:28:32,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:28:32,877 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-12 23:28:32,878 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-12 23:28:32,878 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [944270932] [2021-11-12 23:28:32,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [944270932] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-12 23:28:32,879 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:28:32,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-12 23:28:32,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635534478] [2021-11-12 23:28:32,883 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-12 23:28:32,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-12 23:28:32,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-12 23:28:32,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-12 23:28:32,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-12 23:28:32,963 INFO L87 Difference]: Start difference. First operand has 33 states, 30 states have (on average 1.6) internal successors, (48), 32 states have internal predecessors, (48), 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 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-12 23:28:33,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:28:33,149 INFO L93 Difference]: Finished difference Result 62 states and 83 transitions. [2021-11-12 23:28:33,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-12 23:28:33,152 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-12 23:28:33,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:28:33,162 INFO L225 Difference]: With dead ends: 62 [2021-11-12 23:28:33,162 INFO L226 Difference]: Without dead ends: 48 [2021-11-12 23:28:33,166 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-12 23:28:33,171 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 54 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 89.64ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.13ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 101.91ms IncrementalHoareTripleChecker+Time [2021-11-12 23:28:33,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 151 Invalid, 16 Unknown, 0 Unchecked, 4.13ms Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 101.91ms Time] [2021-11-12 23:28:33,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-11-12 23:28:33,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 32. [2021-11-12 23:28:33,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 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-12 23:28:33,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2021-11-12 23:28:33,216 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 13 [2021-11-12 23:28:33,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:28:33,217 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2021-11-12 23:28:33,217 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-12 23:28:33,217 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2021-11-12 23:28:33,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-12 23:28:33,218 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:28:33,218 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:28:33,235 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-12 23:28:33,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 [2021-11-12 23:28:33,428 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-12 23:28:33,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:28:33,429 INFO L85 PathProgramCache]: Analyzing trace with hash 843294771, now seen corresponding path program 1 times [2021-11-12 23:28:33,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-12 23:28:33,430 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1269086406] [2021-11-12 23:28:33,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:28:33,431 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-12 23:28:33,439 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/mathsat [2021-11-12 23:28:33,441 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-12 23:28:33,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-12 23:28:33,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:28:33,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-12 23:28:33,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:28:33,609 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-12 23:28:33,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:28:33,744 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-12 23:28:33,745 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-12 23:28:33,746 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1269086406] [2021-11-12 23:28:33,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1269086406] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-12 23:28:33,749 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:28:33,749 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-12 23:28:33,749 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686832553] [2021-11-12 23:28:33,751 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-12 23:28:33,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-12 23:28:33,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-12 23:28:33,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-12 23:28:33,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-12 23:28:33,758 INFO L87 Difference]: Start difference. First operand 32 states and 40 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-12 23:28:37,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:28:37,623 INFO L93 Difference]: Finished difference Result 88 states and 111 transitions. [2021-11-12 23:28:37,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-12 23:28:37,624 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-12 23:28:37,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:28:37,626 INFO L225 Difference]: With dead ends: 88 [2021-11-12 23:28:37,626 INFO L226 Difference]: Without dead ends: 68 [2021-11-12 23:28:37,627 INFO L932 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-12 23:28:37,630 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 45 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3684.01ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.55ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3839.90ms IncrementalHoareTripleChecker+Time [2021-11-12 23:28:37,630 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 62 Invalid, 49 Unknown, 0 Unchecked, 2.55ms Time], IncrementalHoareTripleChecker [9 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 3839.90ms Time] [2021-11-12 23:28:37,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-11-12 23:28:37,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 38. [2021-11-12 23:28:37,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 37 states have internal predecessors, (46), 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-12 23:28:37,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2021-11-12 23:28:37,644 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 13 [2021-11-12 23:28:37,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:28:37,645 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2021-11-12 23:28:37,645 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-12 23:28:37,645 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2021-11-12 23:28:37,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-12 23:28:37,646 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:28:37,647 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:28:37,672 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-12 23:28:37,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 [2021-11-12 23:28:37,873 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-12 23:28:37,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:28:37,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1349105153, now seen corresponding path program 1 times [2021-11-12 23:28:37,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-12 23:28:37,874 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1269946727] [2021-11-12 23:28:37,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:28:37,875 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-12 23:28:37,875 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/mathsat [2021-11-12 23:28:37,876 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-12 23:28:37,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-12 23:28:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:28:38,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-12 23:28:38,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:28:39,195 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-12 23:28:39,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:28:45,442 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#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) is different from false [2021-11-12 23:28:47,497 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#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) is different from true [2021-11-12 23:29:01,921 WARN L838 $PredicateComparison]: unable to prove that (or (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| ((_ 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)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) is different from false [2021-11-12 23:29:03,966 WARN L860 $PredicateComparison]: unable to prove that (or (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| ((_ 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)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) is different from true [2021-11-12 23:29:18,473 WARN L860 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0)) (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (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#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))))) is different from true [2021-11-12 23:29:31,005 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-12 23:29:31,005 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-12 23:29:31,005 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1269946727] [2021-11-12 23:29:31,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1269946727] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-12 23:29:31,006 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:29:31,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2021-11-12 23:29:31,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419290249] [2021-11-12 23:29:31,006 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-12 23:29:31,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-12 23:29:31,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-12 23:29:31,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-12 23:29:31,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=30, Unknown=5, NotChecked=42, Total=110 [2021-11-12 23:29:31,008 INFO L87 Difference]: Start difference. First operand 38 states and 46 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-12 23:29:33,101 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (= |c_ULTIMATE.start_main_~main__S~0#1| .cse0) (= .cse0 |c_ULTIMATE.start_main_~main__E1~0#1|) (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1)) (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .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)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-12 23:29:35,163 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#1| (fp.neg .cse0)) (= |c_ULTIMATE.start_main_~main__S~0#1| .cse1) (= .cse1 |c_ULTIMATE.start_main_~main__E1~0#1|) (or (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .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#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-12 23:29:37,230 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#1| (fp.neg .cse0)) (= |c_ULTIMATE.start_main_~main__S~0#1| .cse1) (= .cse1 |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .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#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-12 23:29:39,621 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-12 23:29:39,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:29:39,892 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2021-11-12 23:29:39,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-12 23:29:39,893 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-12 23:29:39,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:29:39,895 INFO L225 Difference]: With dead ends: 73 [2021-11-12 23:29:39,896 INFO L226 Difference]: Without dead ends: 50 [2021-11-12 23:29:39,897 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=39, Invalid=33, Unknown=8, NotChecked=102, Total=182 [2021-11-12 23:29:39,898 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 26 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2588.31ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.28ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 2671.26ms IncrementalHoareTripleChecker+Time [2021-11-12 23:29:39,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 65 Invalid, 165 Unknown, 0 Unchecked, 2.28ms Time], IncrementalHoareTripleChecker [5 Valid, 46 Invalid, 1 Unknown, 113 Unchecked, 2671.26ms Time] [2021-11-12 23:29:39,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-11-12 23:29:39,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 38. [2021-11-12 23:29:39,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 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-12 23:29:39,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2021-11-12 23:29:39,911 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 13 [2021-11-12 23:29:39,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:29:39,912 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2021-11-12 23:29:39,912 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-12 23:29:39,912 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2021-11-12 23:29:39,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-12 23:29:39,913 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:29:39,914 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:29:39,935 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-12 23:29:40,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 [2021-11-12 23:29:40,134 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-12 23:29:40,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:29:40,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1134941057, now seen corresponding path program 1 times [2021-11-12 23:29:40,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-12 23:29:40,135 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1462740937] [2021-11-12 23:29:40,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:29:40,135 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-12 23:29:40,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/mathsat [2021-11-12 23:29:40,136 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-12 23:29:40,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-12 23:29:40,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:29:40,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-12 23:29:40,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:29:41,747 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-12 23:29:41,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:29:52,391 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (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#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (or (fp.leq .cse0 .cse1) (not (fp.geq .cse0 (fp.neg .cse1))))) is different from false [2021-11-12 23:29:54,453 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (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#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (or (fp.leq .cse0 .cse1) (not (fp.geq .cse0 (fp.neg .cse1))))) is different from true [2021-11-12 23:30:17,431 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (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#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (or (fp.leq .cse0 .cse1) (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (not (fp.geq .cse0 (fp.neg .cse1))))) is different from false [2021-11-12 23:30:19,476 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (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#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (or (fp.leq .cse0 .cse1) (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (not (fp.geq .cse0 (fp.neg .cse1))))) is different from true [2021-11-12 23:30:38,250 WARN L860 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 (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#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.leq .cse0 .cse1) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse2)) (not (fp.geq .cse0 (fp.neg .cse1))) (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse2)))))) is different from true [2021-11-12 23:30:55,004 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-12 23:30:55,005 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-12 23:30:55,005 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1462740937] [2021-11-12 23:30:55,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1462740937] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-12 23:30:55,005 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:30:55,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 7] imperfect sequences [] total 12 [2021-11-12 23:30:55,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375135312] [2021-11-12 23:30:55,006 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-12 23:30:55,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-12 23:30:55,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-12 23:30:55,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-12 23:30:55,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=39, Unknown=5, NotChecked=48, Total=132 [2021-11-12 23:30:55,009 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 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-12 23:30:57,124 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 (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#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.leq .cse0 .cse1) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse2)) (not (fp.geq .cse0 (fp.neg .cse1))) (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse2)))))) (= |c_ULTIMATE.start_main_~main__S~0#1| .cse3) (= .cse3 |c_ULTIMATE.start_main_~main__E1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-12 23:30:59,189 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#1| (fp.neg .cse0)) (= |c_ULTIMATE.start_main_~main__S~0#1| .cse1) (= .cse1 |c_ULTIMATE.start_main_~main__E1~0#1|) (let ((.cse2 (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#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (or (fp.leq .cse2 .cse3) (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse0)) (not (fp.geq .cse2 (fp.neg .cse3))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-12 23:31:01,263 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#1| (fp.neg .cse0)) (= |c_ULTIMATE.start_main_~main__S~0#1| .cse1) (= .cse1 |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse0) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse2 (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#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (or (fp.leq .cse2 .cse3) (not (fp.geq .cse2 (fp.neg .cse3))))))) is different from true [2021-11-12 23:31:03,550 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-12 23:31:03,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:31:03,863 INFO L93 Difference]: Finished difference Result 79 states and 97 transitions. [2021-11-12 23:31:03,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-12 23:31:03,864 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-11-12 23:31:03,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:31:03,865 INFO L225 Difference]: With dead ends: 79 [2021-11-12 23:31:03,865 INFO L226 Difference]: Without dead ends: 56 [2021-11-12 23:31:03,866 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=46, Invalid=42, Unknown=8, NotChecked=114, Total=210 [2021-11-12 23:31:03,868 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 48 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2551.08ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.88ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 157 IncrementalHoareTripleChecker+Unchecked, 2633.31ms IncrementalHoareTripleChecker+Time [2021-11-12 23:31:03,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 76 Invalid, 216 Unknown, 0 Unchecked, 1.88ms Time], IncrementalHoareTripleChecker [13 Valid, 45 Invalid, 1 Unknown, 157 Unchecked, 2633.31ms Time] [2021-11-12 23:31:03,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-11-12 23:31:03,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 30. [2021-11-12 23:31:03,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 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-12 23:31:03,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2021-11-12 23:31:03,879 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 14 [2021-11-12 23:31:03,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:31:03,879 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2021-11-12 23:31:03,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 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-12 23:31:03,880 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2021-11-12 23:31:03,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-12 23:31:03,881 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:31:03,881 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:31:03,905 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-11-12 23:31:04,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 [2021-11-12 23:31:04,087 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-12 23:31:04,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:31:04,089 INFO L85 PathProgramCache]: Analyzing trace with hash -151896705, now seen corresponding path program 1 times [2021-11-12 23:31:04,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-12 23:31:04,093 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [622680483] [2021-11-12 23:31:04,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:31:04,093 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-12 23:31:04,094 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/mathsat [2021-11-12 23:31:04,095 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-12 23:31:04,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-12 23:31:04,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:31:04,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-12 23:31:04,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:31:04,267 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-12 23:31:04,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:31:04,329 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-12 23:31:04,329 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-12 23:31:04,329 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [622680483] [2021-11-12 23:31:04,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [622680483] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-12 23:31:04,329 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:31:04,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-12 23:31:04,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950735835] [2021-11-12 23:31:04,330 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-12 23:31:04,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-12 23:31:04,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-12 23:31:04,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-12 23:31:04,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-12 23:31:04,332 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-12 23:31:04,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:31:04,539 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2021-11-12 23:31:04,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-12 23:31:04,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24 [2021-11-12 23:31:04,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:31:04,541 INFO L225 Difference]: With dead ends: 49 [2021-11-12 23:31:04,541 INFO L226 Difference]: Without dead ends: 29 [2021-11-12 23:31:04,541 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 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-12 23:31:04,543 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 195.63ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.56ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 198.44ms IncrementalHoareTripleChecker+Time [2021-11-12 23:31:04,543 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 5 Unknown, 0 Unchecked, 0.56ms Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 198.44ms Time] [2021-11-12 23:31:04,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-11-12 23:31:04,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-11-12 23:31:04,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 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-12 23:31:04,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2021-11-12 23:31:04,551 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 24 [2021-11-12 23:31:04,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:31:04,552 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2021-11-12 23:31:04,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-12 23:31:04,552 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2021-11-12 23:31:04,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-12 23:31:04,553 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:31:04,553 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:31:04,580 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-12 23:31:04,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 [2021-11-12 23:31:04,780 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-12 23:31:04,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:31:04,781 INFO L85 PathProgramCache]: Analyzing trace with hash -327957724, now seen corresponding path program 1 times [2021-11-12 23:31:04,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-12 23:31:04,781 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1525101954] [2021-11-12 23:31:04,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:31:04,782 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-12 23:31:04,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/mathsat [2021-11-12 23:31:04,783 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-12 23:31:04,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-12 23:31:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:31:04,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-12 23:31:04,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:31:04,939 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-12 23:31:04,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:31:05,049 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-12 23:31:05,050 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-12 23:31:05,050 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1525101954] [2021-11-12 23:31:05,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1525101954] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-12 23:31:05,050 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:31:05,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-12 23:31:05,051 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094805283] [2021-11-12 23:31:05,051 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-12 23:31:05,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-12 23:31:05,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-12 23:31:05,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-12 23:31:05,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-12 23:31:05,053 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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-12 23:31:05,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:31:05,238 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2021-11-12 23:31:05,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-12 23:31:05,239 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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 24 [2021-11-12 23:31:05,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:31:05,240 INFO L225 Difference]: With dead ends: 63 [2021-11-12 23:31:05,240 INFO L226 Difference]: Without dead ends: 61 [2021-11-12 23:31:05,241 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-11-12 23:31:05,242 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 45 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 100.53ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.48ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 106.19ms IncrementalHoareTripleChecker+Time [2021-11-12 23:31:05,242 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 140 Invalid, 21 Unknown, 0 Unchecked, 1.48ms Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 106.19ms Time] [2021-11-12 23:31:05,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-11-12 23:31:05,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 31. [2021-11-12 23:31:05,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 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-12 23:31:05,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2021-11-12 23:31:05,253 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 24 [2021-11-12 23:31:05,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:31:05,254 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2021-11-12 23:31:05,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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-12 23:31:05,255 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2021-11-12 23:31:05,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-12 23:31:05,256 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:31:05,256 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:31:05,283 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-12 23:31:05,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 [2021-11-12 23:31:05,472 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-12 23:31:05,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:31:05,473 INFO L85 PathProgramCache]: Analyzing trace with hash 401808482, now seen corresponding path program 1 times [2021-11-12 23:31:05,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-12 23:31:05,474 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [41709455] [2021-11-12 23:31:05,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:31:05,474 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-12 23:31:05,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/mathsat [2021-11-12 23:31:05,476 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-12 23:31:05,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-12 23:31:06,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:31:06,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-12 23:31:06,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:31:47,842 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0)) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)))) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse0)))) is different from false [2021-11-12 23:32:41,750 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-12 23:32:41,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:32:49,814 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#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) is different from false [2021-11-12 23:32:51,871 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#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) is different from true [2021-11-12 23:33:06,388 WARN L838 $PredicateComparison]: unable to prove that (or (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| ((_ 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)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) is different from false [2021-11-12 23:33:08,443 WARN L860 $PredicateComparison]: unable to prove that (or (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| ((_ 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)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) is different from true [2021-11-12 23:33:22,983 WARN L860 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0)) (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (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#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))))) is different from true [2021-11-12 23:34:52,446 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_22| (_ 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#1|) |v_ULTIMATE.start_main_~main__E0~0#1_22|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_22| (fp.neg .cse0))) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_22| .cse0))))) is different from true [2021-11-12 23:35:13,528 WARN L860 $PredicateComparison]: unable to prove that (or (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_22| (_ FloatingPoint 11 53))) (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)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) |v_ULTIMATE.start_main_~main__E0~0#1_22|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_22| (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 1.0))))))) is different from true [2021-11-12 23:35:31,772 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0)) (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0))) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_22| (_ FloatingPoint 11 53))) (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)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) |v_ULTIMATE.start_main_~main__E0~0#1_22|) |ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_22| (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 1.0))))))))) is different from false [2021-11-12 23:35:33,784 WARN L860 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0)) (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0))) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_22| (_ FloatingPoint 11 53))) (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)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) |v_ULTIMATE.start_main_~main__E0~0#1_22|) |ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_22| (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 1.0))))))))) is different from true [2021-11-12 23:36:06,469 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-12 23:36:06,469 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-12 23:36:06,470 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [41709455] [2021-11-12 23:36:06,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [41709455] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-12 23:36:06,470 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:36:06,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 18 [2021-11-12 23:36:06,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298981150] [2021-11-12 23:36:06,470 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-12 23:36:06,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-12 23:36:06,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-12 23:36:06,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-12 23:36:06,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=83, Unknown=17, NotChecked=182, Total=342 [2021-11-12 23:36:06,472 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 18 states have internal predecessors, (48), 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-12 23:36:08,519 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0)) (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0))) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_22| (_ FloatingPoint 11 53))) (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)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) |v_ULTIMATE.start_main_~main__E0~0#1_22|) |ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_22| (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 1.0))))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-12 23:36:30,565 WARN L227 SmtUtils]: Spent 8.69s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-12 23:36:40,623 WARN L227 SmtUtils]: Spent 5.49s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-12 23:36:42,982 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq |c_ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0)) (= |c_ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_22| (_ 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#1|) |v_ULTIMATE.start_main_~main__E0~0#1_22|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_22| (fp.neg .cse1))) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_22| .cse1))))) (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-12 23:36:45,458 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.leq |c_ULTIMATE.start_main_~main__E1~0#1| .cse0) (= |c_ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1)) (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .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)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))))) (fp.geq |c_ULTIMATE.start_main_~main__E1~0#1| (fp.neg .cse0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-12 23:36:47,785 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse1))) (and (fp.geq |c_ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.leq |c_ULTIMATE.start_main_~main__E1~0#1| .cse1) (= |c_ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (or (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .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)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) (fp.geq |c_ULTIMATE.start_main_~main__E1~0#1| .cse0) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2021-11-12 23:36:50,079 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse1))) (and (fp.geq |c_ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.leq |c_ULTIMATE.start_main_~main__E1~0#1| .cse1) (= |c_ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .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)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (fp.geq |c_ULTIMATE.start_main_~main__E1~0#1| .cse0) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2021-11-12 23:36:50,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:36:50,247 INFO L93 Difference]: Finished difference Result 71 states and 80 transitions. [2021-11-12 23:36:50,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-12 23:36:50,248 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 18 states have internal predecessors, (48), 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 24 [2021-11-12 23:36:50,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:36:50,249 INFO L225 Difference]: With dead ends: 71 [2021-11-12 23:36:50,249 INFO L226 Difference]: Without dead ends: 52 [2021-11-12 23:36:50,251 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 86.7s TimeCoverageRelationStatistics Valid=81, Invalid=122, Unknown=27, NotChecked=420, Total=650 [2021-11-12 23:36:50,252 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 11 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 182.97ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.25ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 212 IncrementalHoareTripleChecker+Unchecked, 193.42ms IncrementalHoareTripleChecker+Time [2021-11-12 23:36:50,253 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 93 Invalid, 241 Unknown, 0 Unchecked, 1.25ms Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 212 Unchecked, 193.42ms Time] [2021-11-12 23:36:50,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-11-12 23:36:50,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2021-11-12 23:36:50,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 43 states have internal predecessors, (49), 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-12 23:36:50,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2021-11-12 23:36:50,263 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 24 [2021-11-12 23:36:50,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:36:50,264 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2021-11-12 23:36:50,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 18 states have internal predecessors, (48), 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-12 23:36:50,265 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2021-11-12 23:36:50,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-12 23:36:50,266 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:36:50,266 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:36:50,284 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-11-12 23:36:50,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 [2021-11-12 23:36:50,475 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-12 23:36:50,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:36:50,476 INFO L85 PathProgramCache]: Analyzing trace with hash -60423724, now seen corresponding path program 1 times [2021-11-12 23:36:50,477 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-12 23:36:50,477 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [467185794] [2021-11-12 23:36:50,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:36:50,477 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-12 23:36:50,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/mathsat [2021-11-12 23:36:50,478 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-12 23:36:50,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e0dee7d-1b20-4c84-a973-a43a6def35e9/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-12 23:36:52,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:36:52,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-12 23:36:52,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:37:41,258 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse1))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse1) (= |c_ULTIMATE.start_main_~main__S~0#1| (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (fp.mul c_currentRoundingMode .cse2 (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) |ULTIMATE.start_main_~main__E1~0#1|) .cse3)))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|)) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-12 23:39:12,460 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.neg .cse1))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse1) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)))) (fp.mul roundNearestTiesToEven .cse2 (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse3) |ULTIMATE.start_main_~main__E1~0#1|) .cse3)))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)))) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1))))) is different from false [2021-11-12 23:39:14,492 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.neg .cse1))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse1) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)))) (fp.mul roundNearestTiesToEven .cse2 (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse3) |ULTIMATE.start_main_~main__E1~0#1|) .cse3)))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)))) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1))))) is different from true [2021-11-12 23:41:34,700 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-12 23:41:34,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:41:40,987 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#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) is different from false [2021-11-12 23:41:43,061 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#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) is different from true [2021-11-12 23:41:57,584 WARN L838 $PredicateComparison]: unable to prove that (or (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| ((_ 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)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) is different from false [2021-11-12 23:41:59,646 WARN L860 $PredicateComparison]: unable to prove that (or (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| ((_ 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)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) is different from true [2021-11-12 23:42:14,219 WARN L860 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0)) (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (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#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))))) is different from true