./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0f8a17c6 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6403ea17225d9927b82c2cb5a5e13cab8e302736934880873dcec33bef71c423 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-19 14:31:51,675 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-19 14:31:51,678 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-19 14:31:51,715 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-19 14:31:51,716 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-19 14:31:51,718 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-19 14:31:51,720 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-19 14:31:51,723 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-19 14:31:51,726 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-19 14:31:51,727 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-19 14:31:51,729 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-19 14:31:51,731 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-19 14:31:51,731 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-19 14:31:51,733 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-19 14:31:51,735 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-19 14:31:51,738 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-19 14:31:51,739 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-19 14:31:51,741 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-19 14:31:51,744 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-19 14:31:51,747 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-19 14:31:51,749 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-19 14:31:51,752 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-19 14:31:51,754 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-19 14:31:51,755 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-19 14:31:51,760 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-19 14:31:51,760 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-19 14:31:51,761 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-19 14:31:51,762 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-19 14:31:51,763 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-19 14:31:51,765 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-19 14:31:51,765 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-19 14:31:51,766 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-19 14:31:51,768 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-19 14:31:51,769 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-19 14:31:51,770 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-19 14:31:51,771 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-19 14:31:51,772 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-19 14:31:51,773 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-19 14:31:51,773 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-19 14:31:51,775 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-19 14:31:51,776 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-19 14:31:51,777 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-19 14:31:51,807 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-19 14:31:51,808 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-19 14:31:51,809 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-19 14:31:51,809 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-19 14:31:51,810 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-19 14:31:51,810 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-19 14:31:51,810 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-19 14:31:51,810 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-19 14:31:51,811 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-19 14:31:51,811 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-19 14:31:51,811 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-19 14:31:51,811 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-19 14:31:51,812 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-19 14:31:51,812 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-19 14:31:51,812 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-19 14:31:51,812 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-19 14:31:51,813 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-19 14:31:51,814 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-19 14:31:51,814 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-19 14:31:51,814 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-19 14:31:51,814 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-19 14:31:51,814 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-19 14:31:51,815 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-19 14:31:51,815 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-19 14:31:51,815 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-19 14:31:51,815 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-19 14:31:51,816 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-19 14:31:51,816 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-19 14:31:51,816 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-19 14:31:51,816 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-19 14:31:51,817 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-19 14:31:51,817 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 14:31:51,817 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-19 14:31:51,818 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-19 14:31:51,818 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-19 14:31:51,818 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-19 14:31:51,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-19 14:31:51,819 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-19 14:31:51,819 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-19 14:31:51,819 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-19 14:31:51,819 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_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/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_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6403ea17225d9927b82c2cb5a5e13cab8e302736934880873dcec33bef71c423 [2021-11-19 14:31:52,172 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-19 14:31:52,206 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-19 14:31:52,208 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-19 14:31:52,210 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-19 14:31:52,211 INFO L275 PluginConnector]: CDTParser initialized [2021-11-19 14:31:52,212 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/../../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c [2021-11-19 14:31:52,301 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/data/e7b26e396/89ad877bd38a49a28d36db1d106285b2/FLAGfe2659593 [2021-11-19 14:31:52,812 INFO L306 CDTParser]: Found 1 translation units. [2021-11-19 14:31:52,813 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c [2021-11-19 14:31:52,820 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/data/e7b26e396/89ad877bd38a49a28d36db1d106285b2/FLAGfe2659593 [2021-11-19 14:31:53,202 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/data/e7b26e396/89ad877bd38a49a28d36db1d106285b2 [2021-11-19 14:31:53,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-19 14:31:53,207 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-19 14:31:53,222 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-19 14:31:53,222 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-19 14:31:53,226 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-19 14:31:53,227 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:31:53" (1/1) ... [2021-11-19 14:31:53,228 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16f5304c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:31:53, skipping insertion in model container [2021-11-19 14:31:53,229 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:31:53" (1/1) ... [2021-11-19 14:31:53,237 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-19 14:31:53,255 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-19 14:31:53,436 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c[1310,1323] [2021-11-19 14:31:53,443 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 14:31:53,452 INFO L203 MainTranslator]: Completed pre-run [2021-11-19 14:31:53,472 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c[1310,1323] [2021-11-19 14:31:53,475 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 14:31:53,487 INFO L208 MainTranslator]: Completed translation [2021-11-19 14:31:53,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:31:53 WrapperNode [2021-11-19 14:31:53,487 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-19 14:31:53,489 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-19 14:31:53,489 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-19 14:31:53,489 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-19 14:31:53,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:31:53" (1/1) ... [2021-11-19 14:31:53,505 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:31:53" (1/1) ... [2021-11-19 14:31:53,525 INFO L137 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 65 [2021-11-19 14:31:53,525 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-19 14:31:53,526 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-19 14:31:53,526 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-19 14:31:53,527 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-19 14:31:53,535 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:31:53" (1/1) ... [2021-11-19 14:31:53,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:31:53" (1/1) ... [2021-11-19 14:31:53,537 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:31:53" (1/1) ... [2021-11-19 14:31:53,537 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:31:53" (1/1) ... [2021-11-19 14:31:53,542 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:31:53" (1/1) ... [2021-11-19 14:31:53,544 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:31:53" (1/1) ... [2021-11-19 14:31:53,545 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:31:53" (1/1) ... [2021-11-19 14:31:53,547 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-19 14:31:53,548 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-19 14:31:53,548 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-19 14:31:53,549 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-19 14:31:53,550 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:31:53" (1/1) ... [2021-11-19 14:31:53,561 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 14:31:53,574 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 14:31:53,590 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-19 14:31:53,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-19 14:31:53,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-19 14:31:53,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-19 14:31:53,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-19 14:31:53,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-19 14:31:53,693 INFO L236 CfgBuilder]: Building ICFG [2021-11-19 14:31:53,695 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-19 14:31:53,796 INFO L277 CfgBuilder]: Performing block encoding [2021-11-19 14:31:53,816 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-19 14:31:53,816 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-19 14:31:53,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:31:53 BoogieIcfgContainer [2021-11-19 14:31:53,818 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-19 14:31:53,820 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-19 14:31:53,820 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-19 14:31:53,824 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-19 14:31:53,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 02:31:53" (1/3) ... [2021-11-19 14:31:53,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4faa7f0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 02:31:53, skipping insertion in model container [2021-11-19 14:31:53,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:31:53" (2/3) ... [2021-11-19 14:31:53,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4faa7f0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 02:31:53, skipping insertion in model container [2021-11-19 14:31:53,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:31:53" (3/3) ... [2021-11-19 14:31:53,827 INFO L111 eAbstractionObserver]: Analyzing ICFG filter1.c.p+cfa-reducer.c [2021-11-19 14:31:53,833 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-19 14:31:53,833 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-19 14:31:53,885 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-19 14:31:53,893 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-19 14:31:53,893 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-19 14:31:53,908 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:31:53,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-19 14:31:53,914 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:31:53,914 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:31:53,915 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:31:53,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:31:53,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1090715464, now seen corresponding path program 1 times [2021-11-19 14:31:53,931 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:31:53,932 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738855662] [2021-11-19 14:31:53,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:31:53,933 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:31:54,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:31:54,126 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-19 14:31:54,127 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 14:31:54,127 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738855662] [2021-11-19 14:31:54,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738855662] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 14:31:54,129 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:31:54,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-19 14:31:54,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165145188] [2021-11-19 14:31:54,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 14:31:54,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-19 14:31:54,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 14:31:54,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-19 14:31:54,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-19 14:31:54,194 INFO L87 Difference]: Start difference. First operand has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:31:54,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:31:54,249 INFO L93 Difference]: Finished difference Result 32 states and 44 transitions. [2021-11-19 14:31:54,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-19 14:31:54,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-19 14:31:54,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:31:54,263 INFO L225 Difference]: With dead ends: 32 [2021-11-19 14:31:54,263 INFO L226 Difference]: Without dead ends: 12 [2021-11-19 14:31:54,267 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-19 14:31:54,271 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 2 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 14:31:54,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 29 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 14:31:54,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2021-11-19 14:31:54,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2021-11-19 14:31:54,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:31:54,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2021-11-19 14:31:54,321 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 10 [2021-11-19 14:31:54,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:31:54,322 INFO L470 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2021-11-19 14:31:54,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:31:54,323 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2021-11-19 14:31:54,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-19 14:31:54,323 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:31:54,324 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:31:54,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-19 14:31:54,324 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:31:54,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:31:54,329 INFO L85 PathProgramCache]: Analyzing trace with hash -201086419, now seen corresponding path program 1 times [2021-11-19 14:31:54,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:31:54,330 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255709711] [2021-11-19 14:31:54,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:31:54,331 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:31:54,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:31:54,492 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-19 14:31:54,493 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 14:31:54,493 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255709711] [2021-11-19 14:31:54,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255709711] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 14:31:54,494 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:31:54,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-19 14:31:54,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099428874] [2021-11-19 14:31:54,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 14:31:54,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-19 14:31:54,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 14:31:54,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-19 14:31:54,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-19 14:31:54,498 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:31:54,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:31:54,570 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2021-11-19 14:31:54,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-19 14:31:54,571 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-19 14:31:54,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:31:54,572 INFO L225 Difference]: With dead ends: 29 [2021-11-19 14:31:54,572 INFO L226 Difference]: Without dead ends: 27 [2021-11-19 14:31:54,573 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-19 14:31:54,575 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 30 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 14:31:54,576 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 44 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 14:31:54,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-11-19 14:31:54,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 14. [2021-11-19 14:31:54,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:31:54,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2021-11-19 14:31:54,583 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 10 [2021-11-19 14:31:54,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:31:54,583 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-11-19 14:31:54,583 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-19 14:31:54,583 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2021-11-19 14:31:54,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-19 14:31:54,584 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:31:54,584 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:31:54,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-19 14:31:54,585 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:31:54,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:31:54,586 INFO L85 PathProgramCache]: Analyzing trace with hash -184075758, now seen corresponding path program 1 times [2021-11-19 14:31:54,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:31:54,586 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596340492] [2021-11-19 14:31:54,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:31:54,587 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:31:54,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 14:31:54,622 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-19 14:31:54,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 14:31:54,667 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-19 14:31:54,667 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-19 14:31:54,668 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-19 14:31:54,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-19 14:31:54,680 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2021-11-19 14:31:54,684 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-19 14:31:54,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 02:31:54 BoogieIcfgContainer [2021-11-19 14:31:54,735 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-19 14:31:54,737 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-19 14:31:54,737 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-19 14:31:54,737 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-19 14:31:54,738 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:31:53" (3/4) ... [2021-11-19 14:31:54,744 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-19 14:31:54,744 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-19 14:31:54,747 INFO L158 Benchmark]: Toolchain (without parser) took 1539.39ms. Allocated memory is still 119.5MB. Free memory was 83.7MB in the beginning and 49.7MB in the end (delta: 34.1MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. [2021-11-19 14:31:54,748 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 119.5MB. Free memory was 92.9MB in the beginning and 92.9MB in the end (delta: 30.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-19 14:31:54,748 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.94ms. Allocated memory is still 119.5MB. Free memory was 83.5MB in the beginning and 93.7MB in the end (delta: -10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-19 14:31:54,751 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.97ms. Allocated memory is still 119.5MB. Free memory was 93.7MB in the beginning and 92.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-19 14:31:54,758 INFO L158 Benchmark]: Boogie Preprocessor took 21.22ms. Allocated memory is still 119.5MB. Free memory was 92.2MB in the beginning and 91.0MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-19 14:31:54,758 INFO L158 Benchmark]: RCFGBuilder took 270.25ms. Allocated memory is still 119.5MB. Free memory was 91.0MB in the beginning and 81.1MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-19 14:31:54,759 INFO L158 Benchmark]: TraceAbstraction took 915.06ms. Allocated memory is still 119.5MB. Free memory was 80.5MB in the beginning and 50.2MB in the end (delta: 30.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2021-11-19 14:31:54,759 INFO L158 Benchmark]: Witness Printer took 8.38ms. Allocated memory is still 119.5MB. Free memory was 50.2MB in the beginning and 49.7MB in the end (delta: 571.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-19 14:31:54,762 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.36ms. Allocated memory is still 119.5MB. Free memory was 92.9MB in the beginning and 92.9MB in the end (delta: 30.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 265.94ms. Allocated memory is still 119.5MB. Free memory was 83.5MB in the beginning and 93.7MB in the end (delta: -10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.97ms. Allocated memory is still 119.5MB. Free memory was 93.7MB in the beginning and 92.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.22ms. Allocated memory is still 119.5MB. Free memory was 92.2MB in the beginning and 91.0MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 270.25ms. Allocated memory is still 119.5MB. Free memory was 91.0MB in the beginning and 81.1MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 915.06ms. Allocated memory is still 119.5MB. Free memory was 80.5MB in the beginning and 50.2MB in the end (delta: 30.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Witness Printer took 8.38ms. Allocated memory is still 119.5MB. Free memory was 50.2MB in the beginning and 49.7MB in the end (delta: 571.1kB). Peak memory consumption was 2.1MB. 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: 56]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 43, overapproximation of to_real at line 39, overapproximation of someBinaryArithmeticDOUBLEoperation at line 80. Possible FailurePath: [L1] int __return_main; [L15] double main__E0; [L16] double main__E1; [L17] double main__S; [L18] int main__i; [L19] main__E1 = 0 [L20] main__S = 0 [L21] main__i = 0 VAL [__return_main=0, main__i=0] [L23] COND TRUE main__i <= 1000000 [L25] main__E0 = __VERIFIER_nondet_double() [L26] int main____CPAchecker_TMP_0; VAL [__return_main=0, main__E0=49, main__i=0] [L27] COND TRUE main__E0 >= -1.0 VAL [__return_main=0, main__E0=49, main__i=0] [L29] COND TRUE main__E0 <= 1.0 [L31] main____CPAchecker_TMP_0 = 1 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__E0=49, main__i=0] [L33] COND TRUE main____CPAchecker_TMP_0 != 0 [L35] int main____CPAchecker_TMP_1; [L36] main____CPAchecker_TMP_1 = __VERIFIER_nondet_int() [L37] COND FALSE !(!(main____CPAchecker_TMP_1 == 0)) [L80] main__S = ((0.999 * main__S) + main__E0) - main__E1 [L41] main__E1 = main__E0 [L42] int main____CPAchecker_TMP_2; VAL [__return_main=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__E0=49, main__E1=49, main__i=0] [L43] COND FALSE !(main__S >= -10000.0) VAL [__return_main=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__E0=49, main__E1=49, main__i=0] [L69] main____CPAchecker_TMP_2 = 0 VAL [__return_main=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] [L50] int __tmp_1; [L51] __tmp_1 = main____CPAchecker_TMP_2 [L52] int __VERIFIER_assert__cond; [L53] __VERIFIER_assert__cond = __tmp_1 VAL [__return_main=0, __tmp_1=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] [L54] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0, __tmp_1=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] reach_error() VAL [__return_main=0, __tmp_1=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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 3, 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, 32 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 32 mSDsluCounter, 73 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 40 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 31 IncrementalHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 34 mSDtfsCounter, 31 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=0, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 13 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 30 NumberOfCodeBlocks, 30 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 28 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-19 14:31:54,831 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/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_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6403ea17225d9927b82c2cb5a5e13cab8e302736934880873dcec33bef71c423 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-19 14:31:57,474 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-19 14:31:57,478 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-19 14:31:57,551 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-19 14:31:57,552 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-19 14:31:57,557 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-19 14:31:57,560 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-19 14:31:57,566 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-19 14:31:57,570 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-19 14:31:57,580 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-19 14:31:57,582 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-19 14:31:57,584 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-19 14:31:57,585 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-19 14:31:57,588 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-19 14:31:57,591 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-19 14:31:57,596 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-19 14:31:57,599 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-19 14:31:57,601 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-19 14:31:57,604 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-19 14:31:57,614 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-19 14:31:57,616 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-19 14:31:57,618 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-19 14:31:57,621 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-19 14:31:57,624 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-19 14:31:57,628 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-19 14:31:57,628 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-19 14:31:57,629 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-19 14:31:57,630 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-19 14:31:57,631 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-19 14:31:57,632 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-19 14:31:57,632 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-19 14:31:57,633 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-19 14:31:57,634 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-19 14:31:57,635 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-19 14:31:57,636 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-19 14:31:57,636 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-19 14:31:57,637 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-19 14:31:57,637 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-19 14:31:57,637 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-19 14:31:57,638 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-19 14:31:57,639 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-19 14:31:57,640 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-11-19 14:31:57,668 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-19 14:31:57,668 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-19 14:31:57,669 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-19 14:31:57,669 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-19 14:31:57,670 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-19 14:31:57,670 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-19 14:31:57,670 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-19 14:31:57,670 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-19 14:31:57,670 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-19 14:31:57,671 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-19 14:31:57,672 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-19 14:31:57,672 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-19 14:31:57,672 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-19 14:31:57,672 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-19 14:31:57,672 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-19 14:31:57,673 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-19 14:31:57,673 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-19 14:31:57,673 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-19 14:31:57,673 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-19 14:31:57,674 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-19 14:31:57,674 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-19 14:31:57,674 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-19 14:31:57,674 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-19 14:31:57,674 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-19 14:31:57,675 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-19 14:31:57,675 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-19 14:31:57,675 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-19 14:31:57,675 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 14:31:57,676 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-19 14:31:57,676 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-19 14:31:57,676 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-19 14:31:57,676 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-19 14:31:57,676 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-19 14:31:57,677 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-19 14:31:57,677 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-19 14:31:57,677 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-19 14:31:57,677 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_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/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_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6403ea17225d9927b82c2cb5a5e13cab8e302736934880873dcec33bef71c423 [2021-11-19 14:31:58,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-19 14:31:58,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-19 14:31:58,099 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-19 14:31:58,102 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-19 14:31:58,103 INFO L275 PluginConnector]: CDTParser initialized [2021-11-19 14:31:58,105 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/../../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c [2021-11-19 14:31:58,188 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/data/3c374fb30/53ec2cd664aa42f5a34084385cecf008/FLAG99e007f4f [2021-11-19 14:31:58,870 INFO L306 CDTParser]: Found 1 translation units. [2021-11-19 14:31:58,873 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c [2021-11-19 14:31:58,883 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/data/3c374fb30/53ec2cd664aa42f5a34084385cecf008/FLAG99e007f4f [2021-11-19 14:31:59,230 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/data/3c374fb30/53ec2cd664aa42f5a34084385cecf008 [2021-11-19 14:31:59,233 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-19 14:31:59,235 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-19 14:31:59,239 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-19 14:31:59,239 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-19 14:31:59,243 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-19 14:31:59,245 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:31:59" (1/1) ... [2021-11-19 14:31:59,246 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@590b76d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:31:59, skipping insertion in model container [2021-11-19 14:31:59,247 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:31:59" (1/1) ... [2021-11-19 14:31:59,256 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-19 14:31:59,278 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-19 14:31:59,470 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c[1310,1323] [2021-11-19 14:31:59,477 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 14:31:59,493 INFO L203 MainTranslator]: Completed pre-run [2021-11-19 14:31:59,515 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c[1310,1323] [2021-11-19 14:31:59,518 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 14:31:59,536 INFO L208 MainTranslator]: Completed translation [2021-11-19 14:31:59,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:31:59 WrapperNode [2021-11-19 14:31:59,537 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-19 14:31:59,538 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-19 14:31:59,539 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-19 14:31:59,539 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-19 14:31:59,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:31:59" (1/1) ... [2021-11-19 14:31:59,559 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:31:59" (1/1) ... [2021-11-19 14:31:59,581 INFO L137 Inliner]: procedures = 16, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 65 [2021-11-19 14:31:59,582 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-19 14:31:59,583 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-19 14:31:59,583 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-19 14:31:59,583 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-19 14:31:59,591 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:31:59" (1/1) ... [2021-11-19 14:31:59,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:31:59" (1/1) ... [2021-11-19 14:31:59,595 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:31:59" (1/1) ... [2021-11-19 14:31:59,595 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:31:59" (1/1) ... [2021-11-19 14:31:59,602 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:31:59" (1/1) ... [2021-11-19 14:31:59,605 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:31:59" (1/1) ... [2021-11-19 14:31:59,607 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:31:59" (1/1) ... [2021-11-19 14:31:59,610 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-19 14:31:59,611 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-19 14:31:59,611 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-19 14:31:59,612 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-19 14:31:59,613 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:31:59" (1/1) ... [2021-11-19 14:31:59,620 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 14:31:59,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 14:31:59,648 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-19 14:31:59,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-19 14:31:59,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-19 14:31:59,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-19 14:31:59,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-19 14:31:59,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-19 14:31:59,786 INFO L236 CfgBuilder]: Building ICFG [2021-11-19 14:31:59,788 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-19 14:32:02,013 INFO L277 CfgBuilder]: Performing block encoding [2021-11-19 14:32:02,020 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-19 14:32:02,020 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-19 14:32:02,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:32:02 BoogieIcfgContainer [2021-11-19 14:32:02,023 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-19 14:32:02,025 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-19 14:32:02,025 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-19 14:32:02,028 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-19 14:32:02,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 02:31:59" (1/3) ... [2021-11-19 14:32:02,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ba9cb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 02:32:02, skipping insertion in model container [2021-11-19 14:32:02,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:31:59" (2/3) ... [2021-11-19 14:32:02,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ba9cb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 02:32:02, skipping insertion in model container [2021-11-19 14:32:02,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:32:02" (3/3) ... [2021-11-19 14:32:02,032 INFO L111 eAbstractionObserver]: Analyzing ICFG filter1.c.p+cfa-reducer.c [2021-11-19 14:32:02,038 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-19 14:32:02,038 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-19 14:32:02,101 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-19 14:32:02,109 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-19 14:32:02,109 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-19 14:32:02,140 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:32:02,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-19 14:32:02,145 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:32:02,146 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:32:02,151 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:32:02,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:32:02,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1824272086, now seen corresponding path program 1 times [2021-11-19 14:32:02,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:32:02,194 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1347505941] [2021-11-19 14:32:02,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:32:02,195 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:32:02,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:32:02,230 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:32:02,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-19 14:32:02,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:32:02,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-19 14:32:02,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:32:02,483 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-19 14:32:02,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:32:02,564 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-19 14:32:02,566 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:32:02,566 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1347505941] [2021-11-19 14:32:02,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1347505941] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:32:02,568 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:32:02,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-19 14:32:02,570 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000652590] [2021-11-19 14:32:02,571 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:32:02,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-19 14:32:02,578 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:32:02,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-19 14:32:02,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-19 14:32:02,620 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:32:02,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:32:02,824 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2021-11-19 14:32:02,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-19 14:32:02,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-19 14:32:02,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:32:02,837 INFO L225 Difference]: With dead ends: 40 [2021-11-19 14:32:02,838 INFO L226 Difference]: Without dead ends: 15 [2021-11-19 14:32:02,841 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-19 14:32:02,846 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-19 14:32:02,848 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 45 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-19 14:32:02,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-11-19 14:32:02,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-11-19 14:32:02,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:32:02,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2021-11-19 14:32:02,889 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 13 [2021-11-19 14:32:02,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:32:02,890 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2021-11-19 14:32:02,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:32:02,891 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2021-11-19 14:32:02,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-19 14:32:02,892 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:32:02,892 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:32:02,905 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-11-19 14:32:03,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:32:03,102 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:32:03,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:32:03,103 INFO L85 PathProgramCache]: Analyzing trace with hash -2000333105, now seen corresponding path program 1 times [2021-11-19 14:32:03,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:32:03,111 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [396917988] [2021-11-19 14:32:03,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:32:03,111 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:32:03,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:32:03,113 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:32:03,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-19 14:32:03,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:32:03,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-19 14:32:03,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:32:03,316 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-19 14:32:03,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:32:03,411 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-19 14:32:03,412 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:32:03,412 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [396917988] [2021-11-19 14:32:03,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [396917988] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:32:03,413 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:32:03,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-19 14:32:03,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976523375] [2021-11-19 14:32:03,414 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:32:03,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-19 14:32:03,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:32:03,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-19 14:32:03,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-19 14:32:03,417 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:32:03,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:32:03,572 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2021-11-19 14:32:03,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-19 14:32:03,573 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-19 14:32:03,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:32:03,575 INFO L225 Difference]: With dead ends: 41 [2021-11-19 14:32:03,575 INFO L226 Difference]: Without dead ends: 39 [2021-11-19 14:32:03,575 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 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-19 14:32:03,577 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 46 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 14:32:03,578 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 98 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-19 14:32:03,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-11-19 14:32:03,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 17. [2021-11-19 14:32:03,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:32:03,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2021-11-19 14:32:03,595 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 13 [2021-11-19 14:32:03,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:32:03,598 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2021-11-19 14:32:03,598 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-19 14:32:03,598 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2021-11-19 14:32:03,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-19 14:32:03,599 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:32:03,599 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:32:03,613 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-19 14:32:03,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:32:03,806 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:32:03,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:32:03,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1983322444, now seen corresponding path program 1 times [2021-11-19 14:32:03,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:32:03,808 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [406219968] [2021-11-19 14:32:03,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:32:03,808 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:32:03,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:32:03,809 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:32:03,821 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-19 14:32:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:32:03,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-19 14:32:03,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:32:03,975 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-19 14:32:03,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:32:04,071 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-19 14:32:04,071 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:32:04,072 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [406219968] [2021-11-19 14:32:04,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [406219968] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:32:04,072 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:32:04,072 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-19 14:32:04,072 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055882356] [2021-11-19 14:32:04,073 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:32:04,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-19 14:32:04,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:32:04,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-19 14:32:04,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-19 14:32:04,074 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:32:05,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:32:05,012 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2021-11-19 14:32:05,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-19 14:32:05,017 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-19 14:32:05,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:32:05,018 INFO L225 Difference]: With dead ends: 52 [2021-11-19 14:32:05,018 INFO L226 Difference]: Without dead ends: 37 [2021-11-19 14:32:05,019 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-19 14:32:05,021 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 19 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-19 14:32:05,021 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 33 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-19 14:32:05,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-11-19 14:32:05,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 20. [2021-11-19 14:32:05,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:32:05,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2021-11-19 14:32:05,038 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 13 [2021-11-19 14:32:05,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:32:05,047 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2021-11-19 14:32:05,048 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-19 14:32:05,048 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2021-11-19 14:32:05,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-19 14:32:05,049 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:32:05,050 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:32:05,078 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-19 14:32:05,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:32:05,283 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:32:05,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:32:05,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1270566899, now seen corresponding path program 1 times [2021-11-19 14:32:05,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:32:05,284 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [525653036] [2021-11-19 14:32:05,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:32:05,284 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:32:05,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:32:05,290 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:32:05,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-19 14:32:05,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:32:05,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-19 14:32:05,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:32:06,556 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-19 14:32:06,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:32:12,777 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-19 14:32:14,823 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-19 14:32:29,337 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-19 14:32:31,387 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-19 14:32:45,876 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-19 14:32:58,359 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-19 14:32:58,359 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:32:58,359 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [525653036] [2021-11-19 14:32:58,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [525653036] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:32:58,360 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:32:58,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2021-11-19 14:32:58,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586655685] [2021-11-19 14:32:58,361 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:32:58,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-19 14:32:58,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:32:58,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-19 14:32:58,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=30, Unknown=5, NotChecked=42, Total=110 [2021-11-19 14:32:58,362 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:33:00,443 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-19 14:33:02,504 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-19 14:33:04,573 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-19 14:33:07,019 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-19 14:33:07,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:33:07,154 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2021-11-19 14:33:07,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-19 14:33:07,155 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-19 14:33:07,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:33:07,156 INFO L225 Difference]: With dead ends: 57 [2021-11-19 14:33:07,156 INFO L226 Difference]: Without dead ends: 39 [2021-11-19 14:33:07,157 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-19 14:33:07,159 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 13 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2021-11-19 14:33:07,159 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 46 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 1 Unknown, 85 Unchecked, 2.6s Time] [2021-11-19 14:33:07,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-11-19 14:33:07,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 27. [2021-11-19 14:33:07,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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-19 14:33:07,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2021-11-19 14:33:07,168 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 13 [2021-11-19 14:33:07,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:33:07,168 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-11-19 14:33:07,169 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-19 14:33:07,169 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2021-11-19 14:33:07,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-19 14:33:07,170 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:33:07,170 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:33:07,194 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-19 14:33:07,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:33:07,382 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:33:07,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:33:07,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1249715145, now seen corresponding path program 1 times [2021-11-19 14:33:07,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:33:07,386 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [467000963] [2021-11-19 14:33:07,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:33:07,387 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:33:07,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:33:07,391 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:33:07,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-19 14:33:07,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:33:07,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-19 14:33:07,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:33:08,901 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-19 14:33:08,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:33:19,531 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-19 14:33:21,583 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-19 14:33:44,568 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-19 14:33:46,614 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-19 14:34:05,299 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-19 14:34:22,077 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-19 14:34:22,077 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:34:22,077 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [467000963] [2021-11-19 14:34:22,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [467000963] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:34:22,078 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:34:22,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 7] imperfect sequences [] total 12 [2021-11-19 14:34:22,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644381604] [2021-11-19 14:34:22,078 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:34:22,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-19 14:34:22,079 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:34:22,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-19 14:34:22,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=39, Unknown=5, NotChecked=48, Total=132 [2021-11-19 14:34:22,081 INFO L87 Difference]: Start difference. First operand 27 states and 31 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-19 14:34:24,176 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-19 14:34:26,244 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-19 14:34:28,310 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-19 14:34:31,295 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-19 14:34:31,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:34:31,414 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2021-11-19 14:34:31,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-19 14:34:31,415 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-19 14:34:31,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:34:31,417 INFO L225 Difference]: With dead ends: 64 [2021-11-19 14:34:31,417 INFO L226 Difference]: Without dead ends: 46 [2021-11-19 14:34:31,418 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=46, Invalid=42, Unknown=8, NotChecked=114, Total=210 [2021-11-19 14:34:31,419 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 24 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2021-11-19 14:34:31,420 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 53 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 35 Invalid, 1 Unknown, 81 Unchecked, 3.1s Time] [2021-11-19 14:34:31,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-11-19 14:34:31,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 25. [2021-11-19 14:34:31,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:34:31,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2021-11-19 14:34:31,431 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 14 [2021-11-19 14:34:31,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:34:31,431 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2021-11-19 14:34:31,432 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-19 14:34:31,432 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2021-11-19 14:34:31,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-19 14:34:31,433 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:34:31,433 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:34:31,456 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-19 14:34:31,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:34:31,647 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:34:31,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:34:31,647 INFO L85 PathProgramCache]: Analyzing trace with hash -3307942, now seen corresponding path program 1 times [2021-11-19 14:34:31,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:34:31,648 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1230473181] [2021-11-19 14:34:31,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:34:31,648 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:34:31,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:34:31,649 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:34:31,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-19 14:34:32,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:34:32,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-19 14:34:32,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:35:15,653 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-19 14:35:17,661 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 ((.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 true [2021-11-19 14:36:09,978 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-11-19 14:36:09,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:36:18,206 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-19 14:36:20,257 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-19 14:36:34,699 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-19 14:36:36,752 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-19 14:36:51,245 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-19 14:38:08,088 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_15| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_15| (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|) |v_ULTIMATE.start_main_~main__E0~0#1_15|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_15| .cse0))))) is different from true [2021-11-19 14:38:29,064 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_15| (_ 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_15|) |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_15| (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 1.0))))))) is different from true [2021-11-19 14:38:47,449 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_15| (_ 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_15|) |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_15| (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 1.0))))))))) is different from false [2021-11-19 14:38:49,462 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_15| (_ 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_15|) |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_15| (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 1.0))))))))) is different from true [2021-11-19 14:39:22,185 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2021-11-19 14:39:22,185 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:39:22,185 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1230473181] [2021-11-19 14:39:22,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1230473181] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 14:39:22,186 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1391872846] [2021-11-19 14:39:22,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:39:22,186 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-19 14:39:22,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/cvc4 [2021-11-19 14:39:22,189 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-19 14:39:22,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2021-11-19 14:39:23,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:39:23,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-19 14:39:23,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:39:45,721 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:39:45,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:41:32,189 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_19| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_19| .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|) |v_ULTIMATE.start_main_~main__E0~0#1_19|) |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_19| (fp.neg .cse0)))))) is different from true [2021-11-19 14:42:15,587 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2021-11-19 14:42:15,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1391872846] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 14:42:15,588 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659943388] [2021-11-19 14:42:15,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:42:15,590 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 14:42:15,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 14:42:15,592 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 14:42:15,593 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64175158-6eb5-48f5-9d69-9c119fe2ca6c/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-19 14:42:19,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:42:19,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-19 14:42:19,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:43:43,396 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-11-19 14:43:43,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:44:14,624 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse0)) (not (fp.geq |c_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|) |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-19 14:44:16,688 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse0)) (not (fp.geq |c_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|) |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-19 14:44:31,316 WARN L860 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_#t~nondet4#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq |ULTIMATE.start_main_#t~nondet4#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_#t~nondet4#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |ULTIMATE.start_main_#t~nondet4#1| .cse0))))) is different from true [2021-11-19 14:45:36,086 WARN L860 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_#t~nondet4#1| (_ 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|) |ULTIMATE.start_main_#t~nondet4#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.geq |ULTIMATE.start_main_#t~nondet4#1| (fp.neg .cse0))) (not (fp.leq |ULTIMATE.start_main_#t~nondet4#1| .cse0))))) is different from true