./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 27e2c506f8c4790ab21ed41c19bd1ea2839907b43d1ff7cacbbc276ad919ab4e --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 10:58:07,628 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 10:58:07,630 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 10:58:07,657 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 10:58:07,658 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 10:58:07,659 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 10:58:07,661 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 10:58:07,663 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 10:58:07,666 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 10:58:07,667 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 10:58:07,668 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 10:58:07,670 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 10:58:07,670 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 10:58:07,672 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 10:58:07,673 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 10:58:07,675 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 10:58:07,676 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 10:58:07,677 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 10:58:07,679 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 10:58:07,682 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 10:58:07,684 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 10:58:07,685 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 10:58:07,687 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 10:58:07,688 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 10:58:07,692 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 10:58:07,693 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 10:58:07,693 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 10:58:07,694 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 10:58:07,695 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 10:58:07,696 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 10:58:07,697 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 10:58:07,698 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 10:58:07,699 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 10:58:07,700 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 10:58:07,701 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 10:58:07,702 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 10:58:07,703 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 10:58:07,703 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 10:58:07,703 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 10:58:07,705 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 10:58:07,706 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 10:58:07,707 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 10:58:07,738 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 10:58:07,739 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 10:58:07,739 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 10:58:07,740 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 10:58:07,741 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 10:58:07,741 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 10:58:07,742 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 10:58:07,742 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 10:58:07,743 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 10:58:07,743 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 10:58:07,743 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 10:58:07,744 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 10:58:07,744 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 10:58:07,744 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 10:58:07,745 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 10:58:07,745 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 10:58:07,745 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 10:58:07,746 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 10:58:07,746 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 10:58:07,746 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 10:58:07,747 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 10:58:07,747 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 10:58:07,747 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 10:58:07,748 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 10:58:07,748 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 10:58:07,749 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 10:58:07,749 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 10:58:07,749 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 10:58:07,750 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 10:58:07,750 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 10:58:07,750 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 10:58:07,773 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 10:58:07,774 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 10:58:07,774 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 27e2c506f8c4790ab21ed41c19bd1ea2839907b43d1ff7cacbbc276ad919ab4e [2022-11-16 10:58:08,131 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 10:58:08,160 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 10:58:08,163 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 10:58:08,165 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 10:58:08,166 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 10:58:08,167 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c [2022-11-16 10:58:08,250 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/data/bc5ebcc12/226cc4fe37a042d1ab8b471ff96a0f84/FLAG0ee4a847c [2022-11-16 10:58:08,901 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 10:58:08,902 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c [2022-11-16 10:58:08,910 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/data/bc5ebcc12/226cc4fe37a042d1ab8b471ff96a0f84/FLAG0ee4a847c [2022-11-16 10:58:09,230 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/data/bc5ebcc12/226cc4fe37a042d1ab8b471ff96a0f84 [2022-11-16 10:58:09,234 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 10:58:09,236 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 10:58:09,239 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 10:58:09,239 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 10:58:09,250 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 10:58:09,252 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:58:09" (1/1) ... [2022-11-16 10:58:09,254 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e9c2c50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:09, skipping insertion in model container [2022-11-16 10:58:09,258 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:58:09" (1/1) ... [2022-11-16 10:58:09,268 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 10:58:09,312 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 10:58:09,545 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[1355,1368] [2022-11-16 10:58:09,555 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[2394,2407] [2022-11-16 10:58:09,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 10:58:09,573 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 10:58:09,594 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[1355,1368] [2022-11-16 10:58:09,599 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[2394,2407] [2022-11-16 10:58:09,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 10:58:09,621 INFO L208 MainTranslator]: Completed translation [2022-11-16 10:58:09,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:09 WrapperNode [2022-11-16 10:58:09,622 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 10:58:09,624 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 10:58:09,624 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 10:58:09,624 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 10:58:09,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:09" (1/1) ... [2022-11-16 10:58:09,643 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:09" (1/1) ... [2022-11-16 10:58:09,666 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 122 [2022-11-16 10:58:09,667 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 10:58:09,668 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 10:58:09,668 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 10:58:09,668 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 10:58:09,679 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:09" (1/1) ... [2022-11-16 10:58:09,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:09" (1/1) ... [2022-11-16 10:58:09,681 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:09" (1/1) ... [2022-11-16 10:58:09,682 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:09" (1/1) ... [2022-11-16 10:58:09,687 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:09" (1/1) ... [2022-11-16 10:58:09,690 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:09" (1/1) ... [2022-11-16 10:58:09,691 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:09" (1/1) ... [2022-11-16 10:58:09,692 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:09" (1/1) ... [2022-11-16 10:58:09,695 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 10:58:09,696 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 10:58:09,696 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 10:58:09,696 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 10:58:09,698 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:09" (1/1) ... [2022-11-16 10:58:09,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 10:58:09,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:58:09,736 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 10:58:09,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 10:58:09,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 10:58:09,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 10:58:09,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 10:58:09,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 10:58:09,877 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 10:58:09,880 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 10:58:10,165 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 10:58:10,172 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 10:58:10,173 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 10:58:10,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 10:58:10 BoogieIcfgContainer [2022-11-16 10:58:10,175 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 10:58:10,178 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 10:58:10,178 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 10:58:10,203 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 10:58:10,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 10:58:09" (1/3) ... [2022-11-16 10:58:10,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cb054a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:58:10, skipping insertion in model container [2022-11-16 10:58:10,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:09" (2/3) ... [2022-11-16 10:58:10,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cb054a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:58:10, skipping insertion in model container [2022-11-16 10:58:10,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 10:58:10" (3/3) ... [2022-11-16 10:58:10,208 INFO L112 eAbstractionObserver]: Analyzing ICFG filter1.c.v+lhb-reducer.c [2022-11-16 10:58:10,251 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 10:58:10,266 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-16 10:58:10,353 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 10:58:10,362 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6a66b351, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 10:58:10,362 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-16 10:58:10,368 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 30 states have (on average 1.6) internal successors, (48), 32 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:58:10,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 10:58:10,376 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:58:10,377 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:58:10,378 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 10:58:10,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:58:10,387 INFO L85 PathProgramCache]: Analyzing trace with hash 775758574, now seen corresponding path program 1 times [2022-11-16 10:58:10,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:58:10,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268528774] [2022-11-16 10:58:10,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:58:10,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:58:10,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:10,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:58:10,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:58:10,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268528774] [2022-11-16 10:58:10,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268528774] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:58:10,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:58:10,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 10:58:10,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004454799] [2022-11-16 10:58:10,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:58:10,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 10:58:10,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:58:10,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 10:58:10,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 10:58:10,803 INFO L87 Difference]: Start difference. First operand has 33 states, 30 states have (on average 1.6) internal successors, (48), 32 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:58:10,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:58:10,935 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2022-11-16 10:58:10,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 10:58:10,938 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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 [2022-11-16 10:58:10,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:58:10,949 INFO L225 Difference]: With dead ends: 45 [2022-11-16 10:58:10,949 INFO L226 Difference]: Without dead ends: 34 [2022-11-16 10:58:10,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-16 10:58:10,958 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 44 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 10:58:10,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 131 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 10:58:10,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-16 10:58:11,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-11-16 10:58:11,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:58:11,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2022-11-16 10:58:11,005 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 13 [2022-11-16 10:58:11,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:58:11,006 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2022-11-16 10:58:11,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:58:11,007 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-11-16 10:58:11,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 10:58:11,008 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:58:11,008 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:58:11,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 10:58:11,009 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 10:58:11,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:58:11,012 INFO L85 PathProgramCache]: Analyzing trace with hash 843294771, now seen corresponding path program 1 times [2022-11-16 10:58:11,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:58:11,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722493002] [2022-11-16 10:58:11,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:58:11,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:58:11,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 10:58:11,044 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 10:58:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 10:58:11,099 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 10:58:11,100 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 10:58:11,102 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-11-16 10:58:11,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-11-16 10:58:11,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 10:58:11,110 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1] [2022-11-16 10:58:11,115 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 10:58:11,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 10:58:11 BoogieIcfgContainer [2022-11-16 10:58:11,148 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 10:58:11,148 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 10:58:11,149 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 10:58:11,149 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 10:58:11,150 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 10:58:10" (3/4) ... [2022-11-16 10:58:11,157 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 10:58:11,158 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 10:58:11,159 INFO L158 Benchmark]: Toolchain (without parser) took 1922.29ms. Allocated memory is still 136.3MB. Free memory was 91.4MB in the beginning and 60.2MB in the end (delta: 31.2MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. [2022-11-16 10:58:11,159 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 136.3MB. Free memory was 107.7MB in the beginning and 107.6MB in the end (delta: 142.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 10:58:11,160 INFO L158 Benchmark]: CACSL2BoogieTranslator took 383.83ms. Allocated memory is still 136.3MB. Free memory was 91.1MB in the beginning and 107.9MB in the end (delta: -16.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 10:58:11,161 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.32ms. Allocated memory is still 136.3MB. Free memory was 107.9MB in the beginning and 106.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 10:58:11,161 INFO L158 Benchmark]: Boogie Preprocessor took 27.26ms. Allocated memory is still 136.3MB. Free memory was 105.8MB in the beginning and 104.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 10:58:11,162 INFO L158 Benchmark]: RCFGBuilder took 479.41ms. Allocated memory is still 136.3MB. Free memory was 104.8MB in the beginning and 92.7MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-16 10:58:11,163 INFO L158 Benchmark]: TraceAbstraction took 970.11ms. Allocated memory is still 136.3MB. Free memory was 92.2MB in the beginning and 60.8MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-16 10:58:11,164 INFO L158 Benchmark]: Witness Printer took 9.29ms. Allocated memory is still 136.3MB. Free memory was 60.8MB in the beginning and 60.2MB in the end (delta: 509.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 10:58:11,167 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.34ms. Allocated memory is still 136.3MB. Free memory was 107.7MB in the beginning and 107.6MB in the end (delta: 142.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 383.83ms. Allocated memory is still 136.3MB. Free memory was 91.1MB in the beginning and 107.9MB in the end (delta: -16.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.32ms. Allocated memory is still 136.3MB. Free memory was 107.9MB in the beginning and 106.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.26ms. Allocated memory is still 136.3MB. Free memory was 105.8MB in the beginning and 104.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 479.41ms. Allocated memory is still 136.3MB. Free memory was 104.8MB in the beginning and 92.7MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 970.11ms. Allocated memory is still 136.3MB. Free memory was 92.2MB in the beginning and 60.8MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Witness Printer took 9.29ms. Allocated memory is still 136.3MB. Free memory was 60.8MB in the beginning and 60.2MB in the end (delta: 509.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 58]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 45, overapproximation of to_real at line 41. Possible FailurePath: [L14] int __tmp_129_1; [L15] int __tmp_129_2; [L16] int __return_134; [L13] int __tmp_129_0; [L1] int __return_main; VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0] [L19] double main__E0; [L20] double main__E1; [L21] double main__S; [L22] int main__i; [L23] main__E1 = 0 [L24] main__S = 0 [L25] main__i = 0 VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main__i=0] [L26] COND TRUE main__i <= 1000000 [L28] main__E0 = __VERIFIER_nondet_double() [L29] int main____CPAchecker_TMP_0; VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main__E0=53, main__i=0] [L30] COND TRUE main__E0 >= -1.0 VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main__E0=53, main__i=0] [L32] COND TRUE main__E0 <= 1.0 [L34] main____CPAchecker_TMP_0 = 1 VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main__E0=53, main__i=0] [L35] COND TRUE main____CPAchecker_TMP_0 != 0 [L37] int main____CPAchecker_TMP_1; [L38] main____CPAchecker_TMP_1 = __VERIFIER_nondet_int() [L39] COND TRUE !(main____CPAchecker_TMP_1 == 0) [L41] main__S = 0 VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__E0=53, main__i=0] [L43] main__E1 = main__E0 [L44] int main____CPAchecker_TMP_2; VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__E0=53, main__E1=53, main__i=0] [L45] COND FALSE !(main__S >= -10000.0) VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__E0=53, main__E1=53, main__i=0] [L162] main____CPAchecker_TMP_2 = 0 VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__E0=53, main__E1=53, main__i=0] [L52] int __tmp_1; [L53] __tmp_1 = main____CPAchecker_TMP_2 [L54] int __VERIFIER_assert__cond; [L55] __VERIFIER_assert__cond = __tmp_1 VAL [__return_134=0, __return_main=0, __tmp_1=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__E0=53, main__E1=53, main__i=0] [L56] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_134=0, __return_main=0, __tmp_1=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__E0=53, main__E1=53, main__i=0] [L58] reach_error() VAL [__return_134=0, __return_main=0, __tmp_1=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__E0=53, main__E1=53, main__i=0] - UnprovableResult [Line: 104]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 44 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 44 mSDsluCounter, 131 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 87 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17 IncrementalHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 44 mSDtfsCounter, 17 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=0, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 26 NumberOfCodeBlocks, 26 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 20 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-16 10:58:11,207 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 27e2c506f8c4790ab21ed41c19bd1ea2839907b43d1ff7cacbbc276ad919ab4e --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 10:58:14,015 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 10:58:14,018 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 10:58:14,060 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 10:58:14,062 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 10:58:14,068 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 10:58:14,070 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 10:58:14,075 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 10:58:14,079 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 10:58:14,082 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 10:58:14,085 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 10:58:14,087 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 10:58:14,089 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 10:58:14,095 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 10:58:14,097 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 10:58:14,098 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 10:58:14,101 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 10:58:14,103 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 10:58:14,105 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 10:58:14,109 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 10:58:14,116 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 10:58:14,121 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 10:58:14,123 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 10:58:14,124 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 10:58:14,129 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 10:58:14,136 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 10:58:14,137 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 10:58:14,138 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 10:58:14,140 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 10:58:14,141 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 10:58:14,143 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 10:58:14,144 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 10:58:14,146 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 10:58:14,147 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 10:58:14,153 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 10:58:14,153 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 10:58:14,154 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 10:58:14,155 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 10:58:14,155 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 10:58:14,156 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 10:58:14,159 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 10:58:14,160 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-11-16 10:58:14,190 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 10:58:14,191 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 10:58:14,202 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 10:58:14,203 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 10:58:14,204 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 10:58:14,206 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 10:58:14,207 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 10:58:14,208 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 10:58:14,209 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 10:58:14,209 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 10:58:14,211 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 10:58:14,211 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 10:58:14,211 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 10:58:14,212 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 10:58:14,212 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 10:58:14,212 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 10:58:14,213 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 10:58:14,213 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-16 10:58:14,213 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-16 10:58:14,213 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 10:58:14,214 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 10:58:14,214 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 10:58:14,214 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 10:58:14,215 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 10:58:14,216 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 10:58:14,216 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 10:58:14,216 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 10:58:14,217 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 10:58:14,217 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 10:58:14,217 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 10:58:14,218 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-16 10:58:14,218 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-16 10:58:14,218 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 10:58:14,219 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 10:58:14,219 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 10:58:14,219 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-16 10:58:14,220 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_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 27e2c506f8c4790ab21ed41c19bd1ea2839907b43d1ff7cacbbc276ad919ab4e [2022-11-16 10:58:14,673 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 10:58:14,704 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 10:58:14,706 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 10:58:14,707 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 10:58:14,709 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 10:58:14,711 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c [2022-11-16 10:58:14,798 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/data/6fd7ddc7b/2a008815b3aa45ba93e2796fae149987/FLAGc8022b0b7 [2022-11-16 10:58:15,418 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 10:58:15,419 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c [2022-11-16 10:58:15,436 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/data/6fd7ddc7b/2a008815b3aa45ba93e2796fae149987/FLAGc8022b0b7 [2022-11-16 10:58:15,760 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/data/6fd7ddc7b/2a008815b3aa45ba93e2796fae149987 [2022-11-16 10:58:15,764 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 10:58:15,767 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 10:58:15,773 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 10:58:15,773 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 10:58:15,778 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 10:58:15,780 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:58:15" (1/1) ... [2022-11-16 10:58:15,782 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@556086ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:15, skipping insertion in model container [2022-11-16 10:58:15,783 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:58:15" (1/1) ... [2022-11-16 10:58:15,793 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 10:58:15,830 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 10:58:16,091 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[1355,1368] [2022-11-16 10:58:16,125 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[2394,2407] [2022-11-16 10:58:16,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 10:58:16,159 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 10:58:16,216 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[1355,1368] [2022-11-16 10:58:16,237 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[2394,2407] [2022-11-16 10:58:16,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 10:58:16,271 INFO L208 MainTranslator]: Completed translation [2022-11-16 10:58:16,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:16 WrapperNode [2022-11-16 10:58:16,272 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 10:58:16,274 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 10:58:16,274 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 10:58:16,274 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 10:58:16,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:16" (1/1) ... [2022-11-16 10:58:16,307 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:16" (1/1) ... [2022-11-16 10:58:16,346 INFO L138 Inliner]: procedures = 16, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 121 [2022-11-16 10:58:16,346 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 10:58:16,348 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 10:58:16,349 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 10:58:16,349 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 10:58:16,360 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:16" (1/1) ... [2022-11-16 10:58:16,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:16" (1/1) ... [2022-11-16 10:58:16,379 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:16" (1/1) ... [2022-11-16 10:58:16,380 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:16" (1/1) ... [2022-11-16 10:58:16,387 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:16" (1/1) ... [2022-11-16 10:58:16,389 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:16" (1/1) ... [2022-11-16 10:58:16,391 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:16" (1/1) ... [2022-11-16 10:58:16,392 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:16" (1/1) ... [2022-11-16 10:58:16,411 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 10:58:16,412 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 10:58:16,412 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 10:58:16,412 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 10:58:16,413 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:16" (1/1) ... [2022-11-16 10:58:16,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 10:58:16,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:58:16,451 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 10:58:16,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 10:58:16,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 10:58:16,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-16 10:58:16,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 10:58:16,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 10:58:16,617 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 10:58:16,619 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 10:58:21,167 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 10:58:21,174 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 10:58:21,174 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 10:58:21,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 10:58:21 BoogieIcfgContainer [2022-11-16 10:58:21,177 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 10:58:21,180 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 10:58:21,180 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 10:58:21,184 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 10:58:21,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 10:58:15" (1/3) ... [2022-11-16 10:58:21,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c5e0cd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:58:21, skipping insertion in model container [2022-11-16 10:58:21,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:16" (2/3) ... [2022-11-16 10:58:21,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c5e0cd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:58:21, skipping insertion in model container [2022-11-16 10:58:21,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 10:58:21" (3/3) ... [2022-11-16 10:58:21,189 INFO L112 eAbstractionObserver]: Analyzing ICFG filter1.c.v+lhb-reducer.c [2022-11-16 10:58:21,212 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 10:58:21,213 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-16 10:58:21,299 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 10:58:21,307 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6e8ebfbd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 10:58:21,307 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-16 10:58:21,313 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 30 states have (on average 1.6) internal successors, (48), 32 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:58:21,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 10:58:21,322 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:58:21,323 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:58:21,323 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 10:58:21,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:58:21,330 INFO L85 PathProgramCache]: Analyzing trace with hash 775758574, now seen corresponding path program 1 times [2022-11-16 10:58:21,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:58:21,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [907940609] [2022-11-16 10:58:21,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:58:21,346 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 10:58:21,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:58:21,353 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 10:58:21,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-16 10:58:21,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:21,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 10:58:21,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:58:21,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:58:21,604 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:58:21,607 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:58:21,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [907940609] [2022-11-16 10:58:21,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [907940609] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:58:21,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:58:21,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 10:58:21,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340883210] [2022-11-16 10:58:21,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:58:21,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 10:58:21,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:58:21,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 10:58:21,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 10:58:21,656 INFO L87 Difference]: Start difference. First operand has 33 states, 30 states have (on average 1.6) internal successors, (48), 32 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:58:21,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:58:21,944 INFO L93 Difference]: Finished difference Result 59 states and 81 transitions. [2022-11-16 10:58:21,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 10:58:21,948 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 [2022-11-16 10:58:21,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:58:21,958 INFO L225 Difference]: With dead ends: 59 [2022-11-16 10:58:21,958 INFO L226 Difference]: Without dead ends: 48 [2022-11-16 10:58:21,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 10:58:21,966 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 28 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 10:58:21,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 129 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 10:58:21,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-11-16 10:58:22,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 32. [2022-11-16 10:58:22,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:58:22,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2022-11-16 10:58:22,012 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 13 [2022-11-16 10:58:22,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:58:22,013 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2022-11-16 10:58:22,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:58:22,013 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-11-16 10:58:22,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 10:58:22,014 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:58:22,014 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:58:22,030 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-11-16 10:58:22,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 10:58:22,230 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 10:58:22,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:58:22,231 INFO L85 PathProgramCache]: Analyzing trace with hash 843294771, now seen corresponding path program 1 times [2022-11-16 10:58:22,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:58:22,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [178225373] [2022-11-16 10:58:22,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:58:22,232 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 10:58:22,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:58:22,234 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 10:58:22,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-16 10:58:22,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:22,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 10:58:22,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:58:22,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:58:22,376 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:58:22,377 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:58:22,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [178225373] [2022-11-16 10:58:22,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [178225373] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:58:22,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:58:22,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 10:58:22,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538614964] [2022-11-16 10:58:22,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:58:22,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 10:58:22,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:58:22,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 10:58:22,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 10:58:22,395 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. 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) [2022-11-16 10:58:23,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 10:58:24,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:58:24,661 INFO L93 Difference]: Finished difference Result 71 states and 91 transitions. [2022-11-16 10:58:24,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 10:58:24,663 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 [2022-11-16 10:58:24,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:58:24,664 INFO L225 Difference]: With dead ends: 71 [2022-11-16 10:58:24,665 INFO L226 Difference]: Without dead ends: 51 [2022-11-16 10:58:24,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 10:58:24,667 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 23 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-16 10:58:24,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 40 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-16 10:58:24,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-16 10:58:24,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 38. [2022-11-16 10:58:24,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 37 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:58:24,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2022-11-16 10:58:24,686 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 13 [2022-11-16 10:58:24,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:58:24,687 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2022-11-16 10:58:24,687 INFO L496 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) [2022-11-16 10:58:24,688 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-11-16 10:58:24,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 10:58:24,689 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:58:24,690 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:58:24,706 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-16 10:58:24,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 10:58:24,903 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 10:58:24,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:58:24,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1349105153, now seen corresponding path program 1 times [2022-11-16 10:58:24,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:58:24,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [707354381] [2022-11-16 10:58:24,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:58:24,905 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 10:58:24,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:58:24,907 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 10:58:24,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-16 10:58:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:25,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 10:58:25,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:58:26,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:58:26,441 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:58:26,442 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:58:26,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [707354381] [2022-11-16 10:58:26,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [707354381] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:58:26,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:58:26,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 10:58:26,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793050853] [2022-11-16 10:58:26,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:58:26,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 10:58:26,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:58:26,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 10:58:26,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-16 10:58:26,447 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:58:29,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 10:58:31,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 10:58:31,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:58:31,404 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2022-11-16 10:58:31,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 10:58:31,405 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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 [2022-11-16 10:58:31,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:58:31,406 INFO L225 Difference]: With dead ends: 61 [2022-11-16 10:58:31,406 INFO L226 Difference]: Without dead ends: 38 [2022-11-16 10:58:31,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-16 10:58:31,408 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 9 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-11-16 10:58:31,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 73 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 2 Unknown, 15 Unchecked, 4.9s Time] [2022-11-16 10:58:31,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-16 10:58:31,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-11-16 10:58:31,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:58:31,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2022-11-16 10:58:31,417 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 13 [2022-11-16 10:58:31,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:58:31,418 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2022-11-16 10:58:31,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:58:31,418 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-11-16 10:58:31,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 10:58:31,419 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:58:31,420 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:58:31,442 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-16 10:58:31,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 10:58:31,639 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 10:58:31,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:58:31,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1134941057, now seen corresponding path program 1 times [2022-11-16 10:58:31,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:58:31,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1042202137] [2022-11-16 10:58:31,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:58:31,647 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 10:58:31,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:58:31,654 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 10:58:31,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-16 10:58:32,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:32,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 10:58:32,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:58:33,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:58:33,515 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:58:33,516 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:58:33,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1042202137] [2022-11-16 10:58:33,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1042202137] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:58:33,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:58:33,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 10:58:33,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675160648] [2022-11-16 10:58:33,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:58:33,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 10:58:33,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:58:33,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 10:58:33,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-16 10:58:33,518 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:58:34,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:58:34,177 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2022-11-16 10:58:34,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 10:58:34,233 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 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) Word has length 14 [2022-11-16 10:58:34,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:58:34,234 INFO L225 Difference]: With dead ends: 56 [2022-11-16 10:58:34,234 INFO L226 Difference]: Without dead ends: 33 [2022-11-16 10:58:34,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-16 10:58:34,236 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 9 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 10:58:34,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 55 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 20 Unchecked, 0.6s Time] [2022-11-16 10:58:34,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-16 10:58:34,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2022-11-16 10:58:34,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:58:34,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-11-16 10:58:34,243 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 14 [2022-11-16 10:58:34,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:58:34,245 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-11-16 10:58:34,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:58:34,246 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-11-16 10:58:34,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 10:58:34,246 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:58:34,246 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:58:34,267 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-11-16 10:58:34,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 10:58:34,447 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 10:58:34,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:58:34,448 INFO L85 PathProgramCache]: Analyzing trace with hash -151896705, now seen corresponding path program 1 times [2022-11-16 10:58:34,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:58:34,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [26802087] [2022-11-16 10:58:34,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:58:34,449 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 10:58:34,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:58:34,451 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 10:58:34,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-16 10:58:34,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:34,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 10:58:34,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:58:34,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:58:34,573 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:58:34,574 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:58:34,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [26802087] [2022-11-16 10:58:34,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [26802087] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:58:34,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:58:34,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 10:58:34,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239875500] [2022-11-16 10:58:34,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:58:34,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 10:58:34,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:58:34,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 10:58:34,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 10:58:34,581 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:58:34,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:58:34,824 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2022-11-16 10:58:34,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 10:58:34,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-16 10:58:34,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:58:34,825 INFO L225 Difference]: With dead ends: 49 [2022-11-16 10:58:34,826 INFO L226 Difference]: Without dead ends: 29 [2022-11-16 10:58:34,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 10:58:34,827 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 10:58:34,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 10:58:34,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-16 10:58:34,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-11-16 10:58:34,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:58:34,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-11-16 10:58:34,833 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 24 [2022-11-16 10:58:34,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:58:34,834 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-11-16 10:58:34,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:58:34,834 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-11-16 10:58:34,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 10:58:34,836 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:58:34,836 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:58:34,858 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-16 10:58:35,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 10:58:35,037 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 10:58:35,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:58:35,038 INFO L85 PathProgramCache]: Analyzing trace with hash -327957724, now seen corresponding path program 1 times [2022-11-16 10:58:35,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:58:35,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [487363239] [2022-11-16 10:58:35,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:58:35,039 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 10:58:35,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:58:35,040 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 10:58:35,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-16 10:58:35,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:35,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 10:58:35,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:58:35,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:58:35,188 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:58:35,188 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:58:35,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [487363239] [2022-11-16 10:58:35,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [487363239] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:58:35,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:58:35,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 10:58:35,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869727347] [2022-11-16 10:58:35,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:58:35,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 10:58:35,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:58:35,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 10:58:35,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 10:58:35,191 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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) [2022-11-16 10:58:35,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:58:35,432 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-11-16 10:58:35,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 10:58:35,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-16 10:58:35,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:58:35,434 INFO L225 Difference]: With dead ends: 48 [2022-11-16 10:58:35,434 INFO L226 Difference]: Without dead ends: 46 [2022-11-16 10:58:35,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 10:58:35,435 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 23 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 10:58:35,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 94 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 10:58:35,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-16 10:58:35,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2022-11-16 10:58:35,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:58:35,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2022-11-16 10:58:35,443 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 24 [2022-11-16 10:58:35,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:58:35,444 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2022-11-16 10:58:35,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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) [2022-11-16 10:58:35,444 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2022-11-16 10:58:35,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 10:58:35,445 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:58:35,445 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:58:35,468 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-16 10:58:35,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 10:58:35,669 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 10:58:35,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:58:35,669 INFO L85 PathProgramCache]: Analyzing trace with hash 401808482, now seen corresponding path program 1 times [2022-11-16 10:58:35,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:58:35,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1941588963] [2022-11-16 10:58:35,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:58:35,670 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 10:58:35,670 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:58:35,671 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 10:58:35,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-16 10:58:36,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:36,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-16 10:58:36,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:58:57,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:58:57,695 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:58:57,695 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:58:57,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1941588963] [2022-11-16 10:58:57,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1941588963] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:58:57,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:58:57,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 10:58:57,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849864775] [2022-11-16 10:58:57,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:58:57,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 10:58:57,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:58:57,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 10:58:57,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=49, Unknown=6, NotChecked=0, Total=90 [2022-11-16 10:58:57,698 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 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) [2022-11-16 10:58:59,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 10:59:01,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 10:59:12,987 WARN L233 SmtUtils]: Spent 6.81s on a formula simplification. DAG size of input: 25 DAG size of output: 14 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 10:59:15,038 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse0 (fp.neg .cse2))) (and (fp.geq |c_ULTIMATE.start_main_~main__E0~0#1| .cse0) (= |c_ULTIMATE.start_main_~main__S~0#1| .cse1) (fp.leq |c_ULTIMATE.start_main_~main__E1~0#1| .cse2) (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse0) (= |c_ULTIMATE.start_main_~main__S~0#1| (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) .cse1) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|)) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse2) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse2))) (fp.geq |c_ULTIMATE.start_main_~main__E1~0#1| .cse0) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2022-11-16 10:59:22,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 10:59:24,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 10:59:24,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:59:24,283 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2022-11-16 10:59:24,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 10:59:24,284 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-16 10:59:24,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:59:24,285 INFO L225 Difference]: With dead ends: 85 [2022-11-16 10:59:24,285 INFO L226 Difference]: Without dead ends: 66 [2022-11-16 10:59:24,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 32.1s TimeCoverageRelationStatistics Valid=49, Invalid=79, Unknown=8, NotChecked=20, Total=156 [2022-11-16 10:59:24,286 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 78 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 14 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2022-11-16 10:59:24,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 44 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 66 Invalid, 4 Unknown, 31 Unchecked, 10.4s Time] [2022-11-16 10:59:24,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-16 10:59:24,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2022-11-16 10:59:24,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.1612903225806452) internal successors, (72), 62 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:59:24,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2022-11-16 10:59:24,304 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 24 [2022-11-16 10:59:24,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:59:24,305 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2022-11-16 10:59:24,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 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) [2022-11-16 10:59:24,305 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2022-11-16 10:59:24,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 10:59:24,307 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:59:24,307 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:59:24,330 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-16 10:59:24,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 10:59:24,530 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 10:59:24,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:59:24,531 INFO L85 PathProgramCache]: Analyzing trace with hash -60423724, now seen corresponding path program 1 times [2022-11-16 10:59:24,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:59:24,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1365105450] [2022-11-16 10:59:24,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:59:24,532 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 10:59:24,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:59:24,533 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 10:59:24,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-16 10:59:26,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:59:26,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-16 10:59:26,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:59:52,361 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.neg .cse3))) (and (= |c_ULTIMATE.start_main_~main__S~0#1| (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (fp.mul c_currentRoundingMode .cse0 (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) |ULTIMATE.start_main_~main__E1~0#1|) .cse1)))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|)) (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse2) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse2) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse3) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse3))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-16 11:00:38,274 WARN L833 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.neg .cse1))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse1) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)))) (fp.mul roundNearestTiesToEven .cse2 (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse3) |ULTIMATE.start_main_~main__E1~0#1|) .cse3)))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)))) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1))))) is different from false [2022-11-16 11:00:40,303 WARN L855 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.neg .cse1))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse1) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)))) (fp.mul roundNearestTiesToEven .cse2 (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse3) |ULTIMATE.start_main_~main__E1~0#1|) .cse3)))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)))) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1))))) is different from true [2022-11-16 11:01:49,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:01:49,306 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:01:49,306 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:01:49,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1365105450] [2022-11-16 11:01:49,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1365105450] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:01:49,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:01:49,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 11:01:49,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310880557] [2022-11-16 11:01:49,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:01:49,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 11:01:49,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:01:49,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 11:01:49,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=55, Unknown=3, NotChecked=34, Total=132 [2022-11-16 11:01:49,308 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2022-11-16 11:01:54,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 11:01:57,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 11:01:59,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:01:59,237 INFO L93 Difference]: Finished difference Result 87 states and 99 transitions. [2022-11-16 11:01:59,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 11:01:59,238 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-16 11:01:59,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:01:59,239 INFO L225 Difference]: With dead ends: 87 [2022-11-16 11:01:59,239 INFO L226 Difference]: Without dead ends: 85 [2022-11-16 11:01:59,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=47, Invalid=68, Unknown=3, NotChecked=38, Total=156 [2022-11-16 11:01:59,241 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 40 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:01:59,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 63 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 100 Invalid, 2 Unknown, 60 Unchecked, 9.6s Time] [2022-11-16 11:01:59,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-16 11:01:59,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 72. [2022-11-16 11:01:59,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.1690140845070423) internal successors, (83), 71 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:01:59,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2022-11-16 11:01:59,255 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 24 [2022-11-16 11:01:59,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:01:59,255 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2022-11-16 11:01:59,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2022-11-16 11:01:59,256 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2022-11-16 11:01:59,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 11:01:59,257 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:01:59,258 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:01:59,283 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-16 11:01:59,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:01:59,467 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:01:59,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:01:59,467 INFO L85 PathProgramCache]: Analyzing trace with hash -945685853, now seen corresponding path program 1 times [2022-11-16 11:01:59,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:01:59,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [801535319] [2022-11-16 11:01:59,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:01:59,468 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:01:59,468 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:01:59,471 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:01:59,473 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-16 11:02:00,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:02:00,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 11:02:00,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:02:40,853 WARN L833 $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 (not (fp.leq (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|) ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| (fp.neg .cse0)) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0)))) is different from false [2022-11-16 11:02:42,861 WARN L855 $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 (not (fp.leq (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|) ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| (fp.neg .cse0)) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0)))) is different from true [2022-11-16 11:03:08,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:03:08,649 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:03:08,649 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:03:08,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [801535319] [2022-11-16 11:03:08,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [801535319] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:03:08,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:03:08,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 11:03:08,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152599335] [2022-11-16 11:03:08,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:03:08,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 11:03:08,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:03:08,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 11:03:08,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=62, Unknown=6, NotChecked=18, Total=132 [2022-11-16 11:03:08,652 INFO L87 Difference]: Start difference. First operand 72 states and 83 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:11,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 11:03:14,022 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse2 (fp.neg .cse1))) (and (= |c_ULTIMATE.start_main_~main__S~0#1| .cse0) (fp.leq |c_ULTIMATE.start_main_~main__E1~0#1| .cse1) (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse2) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse2) (= |c_ULTIMATE.start_main_~main__S~0#1| (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) .cse0) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|)) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse1) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1))) (fp.geq |c_ULTIMATE.start_main_~main__S~0#1| (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (fp.geq |c_ULTIMATE.start_main_~main__E1~0#1| .cse2) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2022-11-16 11:03:40,631 WARN L233 SmtUtils]: Spent 5.15s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:03:42,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 11:03:44,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 11:03:46,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 11:03:56,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:03:56,624 INFO L93 Difference]: Finished difference Result 151 states and 177 transitions. [2022-11-16 11:03:56,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 11:03:56,624 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-16 11:03:56,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:03:56,627 INFO L225 Difference]: With dead ends: 151 [2022-11-16 11:03:56,627 INFO L226 Difference]: Without dead ends: 149 [2022-11-16 11:03:56,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 62.8s TimeCoverageRelationStatistics Valid=87, Invalid=119, Unknown=12, NotChecked=54, Total=272 [2022-11-16 11:03:56,631 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 99 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 17 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 143 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:03:56,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 60 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 59 Invalid, 4 Unknown, 143 Unchecked, 11.1s Time] [2022-11-16 11:03:56,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-11-16 11:03:56,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 128. [2022-11-16 11:03:56,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 1.188976377952756) internal successors, (151), 127 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:56,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 151 transitions. [2022-11-16 11:03:56,673 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 151 transitions. Word has length 25 [2022-11-16 11:03:56,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:03:56,674 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 151 transitions. [2022-11-16 11:03:56,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:56,675 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 151 transitions. [2022-11-16 11:03:56,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 11:03:56,678 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:03:56,678 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:03:56,703 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-16 11:03:56,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:03:56,899 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:03:56,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:03:56,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1904984945, now seen corresponding path program 1 times [2022-11-16 11:03:56,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:03:56,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [264009565] [2022-11-16 11:03:56,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:03:56,900 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:03:56,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:03:56,902 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:03:56,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-16 11:03:59,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:03:59,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-16 11:03:59,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:04:25,981 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.neg .cse3))) (and (= |c_ULTIMATE.start_main_~main__S~0#1| (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (fp.mul c_currentRoundingMode .cse0 (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) |ULTIMATE.start_main_~main__E1~0#1|) .cse1)))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|)) (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse2) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse2) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse3) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse3))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-16 11:05:07,516 WARN L833 $PredicateComparison]: unable to prove that (and (fp.geq |c_ULTIMATE.start_main_~main__S~0#1| (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.neg .cse3))) (and (= |c_ULTIMATE.start_main_~main__S~0#1| (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (fp.mul c_currentRoundingMode .cse0 (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) |ULTIMATE.start_main_~main__E1~0#1|) .cse1)))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|)) (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse2) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse2) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse3) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse3))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-16 11:05:36,926 WARN L833 $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 ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)))) (fp.mul roundNearestTiesToEven .cse4 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse5) |ULTIMATE.start_main_~main__E1~0#1|) .cse5)))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.geq .cse1 (fp.neg .cse2)) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse3) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse0) (not (fp.leq .cse1 .cse2)) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse3))))) is different from false [2022-11-16 11:05:38,959 WARN L855 $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 ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)))) (fp.mul roundNearestTiesToEven .cse4 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse5) |ULTIMATE.start_main_~main__E1~0#1|) .cse5)))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.geq .cse1 (fp.neg .cse2)) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse3) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse0) (not (fp.leq .cse1 .cse2)) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse3))))) is different from true [2022-11-16 11:07:01,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:07:01,005 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:07:01,005 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:07:01,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [264009565] [2022-11-16 11:07:01,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [264009565] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:07:01,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:07:01,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-16 11:07:01,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110066701] [2022-11-16 11:07:01,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:07:01,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-16 11:07:01,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:07:01,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-16 11:07:01,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=56, Unknown=4, NotChecked=54, Total=156 [2022-11-16 11:07:01,007 INFO L87 Difference]: Start difference. First operand 128 states and 151 transitions. Second operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:07:06,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 11:07:09,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 11:07:10,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:07:10,306 INFO L93 Difference]: Finished difference Result 145 states and 170 transitions. [2022-11-16 11:07:10,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 11:07:10,307 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-16 11:07:10,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:07:10,308 INFO L225 Difference]: With dead ends: 145 [2022-11-16 11:07:10,308 INFO L226 Difference]: Without dead ends: 143 [2022-11-16 11:07:10,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=49, Invalid=69, Unknown=4, NotChecked=60, Total=182 [2022-11-16 11:07:10,310 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 47 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 10 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 160 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:07:10,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 78 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 95 Invalid, 2 Unknown, 160 Unchecked, 9.0s Time] [2022-11-16 11:07:10,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-11-16 11:07:10,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 130. [2022-11-16 11:07:10,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.193798449612403) internal successors, (154), 129 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:07:10,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 154 transitions. [2022-11-16 11:07:10,329 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 154 transitions. Word has length 25 [2022-11-16 11:07:10,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:07:10,329 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 154 transitions. [2022-11-16 11:07:10,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:07:10,330 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 154 transitions. [2022-11-16 11:07:10,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-16 11:07:10,331 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:07:10,331 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:07:10,359 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-16 11:07:10,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:07:10,543 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:07:10,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:07:10,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1204213622, now seen corresponding path program 1 times [2022-11-16 11:07:10,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:07:10,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [34419297] [2022-11-16 11:07:10,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:07:10,544 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:07:10,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:07:10,546 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:07:10,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3124fb43-8494-4c2d-b85a-ef3bb406e7a5/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-16 11:07:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:07:12,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 11:07:12,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:07:45,464 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~main__S~0#1_26| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse2)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.geq |v_ULTIMATE.start_main_~main__S~0#1_26| (fp.neg .cse1)) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse0) (fp.leq |v_ULTIMATE.start_main_~main__S~0#1_26| .cse1) (= (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |v_ULTIMATE.start_main_~main__S~0#1_26|) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|) |c_ULTIMATE.start_main_~main__S~0#1|) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse2) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse2))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-16 11:08:47,810 WARN L833 $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)) (|v_ULTIMATE.start_main_~main__S~0#1_26| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.neg .cse1)) (.cse3 (fp.neg .cse2))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse1) (fp.leq |v_ULTIMATE.start_main_~main__S~0#1_26| .cse2) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) |v_ULTIMATE.start_main_~main__S~0#1_26|) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|) .cse3)) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse0) (fp.geq |v_ULTIMATE.start_main_~main__S~0#1_26| .cse3) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1))))) is different from false [2022-11-16 11:08:49,842 WARN L855 $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)) (|v_ULTIMATE.start_main_~main__S~0#1_26| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.neg .cse1)) (.cse3 (fp.neg .cse2))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse1) (fp.leq |v_ULTIMATE.start_main_~main__S~0#1_26| .cse2) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) |v_ULTIMATE.start_main_~main__S~0#1_26|) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|) .cse3)) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse0) (fp.geq |v_ULTIMATE.start_main_~main__S~0#1_26| .cse3) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1))))) is different from true [2022-11-16 11:10:23,329 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-16 11:10:23,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:10:29,584 WARN L833 $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 [2022-11-16 11:10:31,643 WARN L855 $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 [2022-11-16 11:10:46,210 WARN L833 $PredicateComparison]: unable to prove that (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#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))) (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from false [2022-11-16 11:10:48,271 WARN L855 $PredicateComparison]: unable to prove that (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#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))) (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from true [2022-11-16 11:11:02,955 WARN L855 $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.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))) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0))))) is different from true [2022-11-16 11:12:08,203 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (or (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (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 .cse1)) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0))))) (not (fp.leq |c_ULTIMATE.start_main_~main__S~0#1| .cse1)))) is different from true [2022-11-16 11:12:22,896 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__S~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse2 (fp.neg .cse0))) (or (not (fp.leq |ULTIMATE.start_main_~main__S~0#1| .cse0)) (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (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)) |ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) .cse2) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1))))) (not (fp.geq |ULTIMATE.start_main_~main__S~0#1| .cse2)))))) is different from false [2022-11-16 11:12:24,967 WARN L855 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__S~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse2 (fp.neg .cse0))) (or (not (fp.leq |ULTIMATE.start_main_~main__S~0#1| .cse0)) (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (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)) |ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) .cse2) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1))))) (not (fp.geq |ULTIMATE.start_main_~main__S~0#1| .cse2)))))) is different from true [2022-11-16 11:12:48,184 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_18| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__S~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse2 (fp.neg .cse0))) (or (not (fp.leq |ULTIMATE.start_main_~main__S~0#1| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_18| (fp.neg .cse1))) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_18| .cse1)) (not (fp.geq |ULTIMATE.start_main_~main__S~0#1| .cse2)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |ULTIMATE.start_main_~main__S~0#1|) |v_ULTIMATE.start_main_~main__E0~0#1_18|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse2))))) is different from false [2022-11-16 11:12:50,253 WARN L855 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_18| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__S~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse2 (fp.neg .cse0))) (or (not (fp.leq |ULTIMATE.start_main_~main__S~0#1| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_18| (fp.neg .cse1))) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_18| .cse1)) (not (fp.geq |ULTIMATE.start_main_~main__S~0#1| .cse2)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |ULTIMATE.start_main_~main__S~0#1|) |v_ULTIMATE.start_main_~main__E0~0#1_18|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse2))))) is different from true