./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/drift_tenth.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a 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_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/drift_tenth.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc --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 ee159be1ed42c29b70080447b490f7a1aeb72331afc90e5794e0e8d61cb20d74 --- 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-5e519f3 [2022-11-02 20:59:01,693 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:59:01,695 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:59:01,739 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:59:01,740 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:59:01,745 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:59:01,748 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:59:01,751 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:59:01,756 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:59:01,757 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:59:01,759 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:59:01,761 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:59:01,762 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:59:01,769 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:59:01,771 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:59:01,772 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:59:01,774 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:59:01,777 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:59:01,778 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:59:01,780 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:59:01,784 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:59:01,786 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:59:01,790 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:59:01,791 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:59:01,799 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:59:01,799 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:59:01,800 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:59:01,802 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:59:01,802 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:59:01,803 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:59:01,804 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:59:01,806 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:59:01,807 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:59:01,809 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:59:01,810 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:59:01,810 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:59:01,811 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:59:01,811 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:59:01,812 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:59:01,813 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:59:01,814 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:59:01,815 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:59:01,859 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:59:01,859 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:59:01,860 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:59:01,860 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:59:01,861 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:59:01,861 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:59:01,862 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:59:01,862 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:59:01,862 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:59:01,863 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:59:01,864 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:59:01,864 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:59:01,865 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:59:01,865 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:59:01,865 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:59:01,865 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:59:01,866 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:59:01,866 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:59:01,866 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:59:01,866 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:59:01,866 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:59:01,867 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:59:01,867 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:59:01,867 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:59:01,867 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:59:01,868 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:59:01,869 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:59:01,870 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:59:01,870 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:59:01,870 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:59:01,870 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:59:01,871 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:59:01,871 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:59:01,871 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_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/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_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc 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 -> ee159be1ed42c29b70080447b490f7a1aeb72331afc90e5794e0e8d61cb20d74 [2022-11-02 20:59:02,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:59:02,228 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:59:02,230 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:59:02,232 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:59:02,232 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:59:02,241 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/float-benchs/drift_tenth.c.p+cfa-reducer.c [2022-11-02 20:59:02,295 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/data/987afac19/c44bbbb215364093b0093ea75f1f09f4/FLAGa88f1b1d2 [2022-11-02 20:59:02,757 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:59:02,758 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/sv-benchmarks/c/float-benchs/drift_tenth.c.p+cfa-reducer.c [2022-11-02 20:59:02,765 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/data/987afac19/c44bbbb215364093b0093ea75f1f09f4/FLAGa88f1b1d2 [2022-11-02 20:59:03,153 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/data/987afac19/c44bbbb215364093b0093ea75f1f09f4 [2022-11-02 20:59:03,155 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:59:03,157 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:59:03,160 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:59:03,160 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:59:03,163 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:59:03,164 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:59:03" (1/1) ... [2022-11-02 20:59:03,165 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b06297b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:03, skipping insertion in model container [2022-11-02 20:59:03,166 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:59:03" (1/1) ... [2022-11-02 20:59:03,173 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:59:03,187 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:59:03,422 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/sv-benchmarks/c/float-benchs/drift_tenth.c.p+cfa-reducer.c[721,734] [2022-11-02 20:59:03,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:59:03,437 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:59:03,450 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/sv-benchmarks/c/float-benchs/drift_tenth.c.p+cfa-reducer.c[721,734] [2022-11-02 20:59:03,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:59:03,463 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:59:03,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:03 WrapperNode [2022-11-02 20:59:03,464 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:59:03,465 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:59:03,465 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:59:03,465 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:59:03,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:03" (1/1) ... [2022-11-02 20:59:03,479 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:03" (1/1) ... [2022-11-02 20:59:03,494 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 30 [2022-11-02 20:59:03,494 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:59:03,495 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:59:03,495 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:59:03,495 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:59:03,503 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:03" (1/1) ... [2022-11-02 20:59:03,503 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:03" (1/1) ... [2022-11-02 20:59:03,504 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:03" (1/1) ... [2022-11-02 20:59:03,505 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:03" (1/1) ... [2022-11-02 20:59:03,508 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:03" (1/1) ... [2022-11-02 20:59:03,509 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:03" (1/1) ... [2022-11-02 20:59:03,510 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:03" (1/1) ... [2022-11-02 20:59:03,511 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:03" (1/1) ... [2022-11-02 20:59:03,512 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:59:03,513 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:59:03,513 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:59:03,513 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:59:03,514 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:03" (1/1) ... [2022-11-02 20:59:03,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:59:03,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:59:03,543 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:59:03,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:59:03,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:59:03,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:59:03,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:59:03,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:59:03,660 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:59:03,663 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:59:03,788 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:59:03,794 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:59:03,794 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 20:59:03,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:59:03 BoogieIcfgContainer [2022-11-02 20:59:03,796 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:59:03,800 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:59:03,801 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:59:03,804 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:59:03,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:59:03" (1/3) ... [2022-11-02 20:59:03,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ae4ea19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:59:03, skipping insertion in model container [2022-11-02 20:59:03,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:03" (2/3) ... [2022-11-02 20:59:03,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ae4ea19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:59:03, skipping insertion in model container [2022-11-02 20:59:03,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:59:03" (3/3) ... [2022-11-02 20:59:03,808 INFO L112 eAbstractionObserver]: Analyzing ICFG drift_tenth.c.p+cfa-reducer.c [2022-11-02 20:59:03,828 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:59:03,829 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:59:03,897 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:59:03,908 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;@2de82c2b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:59:03,908 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:59:03,922 INFO L276 IsEmpty]: Start isEmpty. Operand has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:03,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-02 20:59:03,931 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:03,932 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-02 20:59:03,932 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:59:03,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:03,937 INFO L85 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2022-11-02 20:59:03,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:03,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744787758] [2022-11-02 20:59:03,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:03,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:04,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:04,193 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-02 20:59:04,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:04,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744787758] [2022-11-02 20:59:04,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744787758] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:59:04,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:59:04,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:59:04,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098559449] [2022-11-02 20:59:04,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:59:04,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:59:04,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:04,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:59:04,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:59:04,237 INFO L87 Difference]: Start difference. First operand has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-02 20:59:04,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:04,272 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-11-02 20:59:04,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:59:04,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2022-11-02 20:59:04,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:04,305 INFO L225 Difference]: With dead ends: 16 [2022-11-02 20:59:04,305 INFO L226 Difference]: Without dead ends: 7 [2022-11-02 20:59:04,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:59:04,322 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:04,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:59:04,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2022-11-02 20:59:04,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2022-11-02 20:59:04,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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-02 20:59:04,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2022-11-02 20:59:04,395 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2022-11-02 20:59:04,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:04,395 INFO L495 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2022-11-02 20:59:04,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-02 20:59:04,396 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2022-11-02 20:59:04,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-02 20:59:04,397 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:04,397 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-02 20:59:04,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:59:04,397 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:59:04,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:04,398 INFO L85 PathProgramCache]: Analyzing trace with hash 889537510, now seen corresponding path program 1 times [2022-11-02 20:59:04,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:04,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185640729] [2022-11-02 20:59:04,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:04,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:04,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:04,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:59:04,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:04,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185640729] [2022-11-02 20:59:04,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185640729] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:59:04,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358159350] [2022-11-02 20:59:04,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:04,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:59:04,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:59:04,494 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:59:04,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:59:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:04,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:59:04,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:59:04,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:59:04,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:59:04,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:59:04,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358159350] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:59:04,624 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:59:04,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-02 20:59:04,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472037065] [2022-11-02 20:59:04,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:59:04,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:59:04,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:04,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:59:04,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:59:04,628 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:04,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:04,645 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2022-11-02 20:59:04,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:59:04,646 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-02 20:59:04,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:04,646 INFO L225 Difference]: With dead ends: 13 [2022-11-02 20:59:04,646 INFO L226 Difference]: Without dead ends: 10 [2022-11-02 20:59:04,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:59:04,648 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:04,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:59:04,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-11-02 20:59:04,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-11-02 20:59:04,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:04,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2022-11-02 20:59:04,653 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2022-11-02 20:59:04,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:04,653 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2022-11-02 20:59:04,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:04,654 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-11-02 20:59:04,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:59:04,654 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:04,655 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2022-11-02 20:59:04,695 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:59:04,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:59:04,878 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:59:04,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:04,879 INFO L85 PathProgramCache]: Analyzing trace with hash 201697478, now seen corresponding path program 2 times [2022-11-02 20:59:04,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:04,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792609565] [2022-11-02 20:59:04,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:04,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:04,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:04,988 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:59:04,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:04,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792609565] [2022-11-02 20:59:04,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792609565] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:59:04,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177846426] [2022-11-02 20:59:04,990 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:59:04,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:59:04,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:59:04,991 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:59:04,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:59:05,037 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:59:05,037 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:59:05,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:59:05,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:59:05,063 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:59:05,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:59:05,152 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:59:05,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177846426] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:59:05,153 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:59:05,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-11-02 20:59:05,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172357769] [2022-11-02 20:59:05,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:59:05,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:59:05,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:05,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:59:05,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:59:05,155 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:05,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:05,197 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-11-02 20:59:05,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:59:05,197 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-02 20:59:05,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:05,198 INFO L225 Difference]: With dead ends: 19 [2022-11-02 20:59:05,198 INFO L226 Difference]: Without dead ends: 16 [2022-11-02 20:59:05,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:59:05,200 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:05,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:59:05,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-11-02 20:59:05,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-11-02 20:59:05,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:05,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-11-02 20:59:05,218 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 9 [2022-11-02 20:59:05,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:05,219 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-11-02 20:59:05,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:05,219 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-11-02 20:59:05,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 20:59:05,220 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:05,220 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2022-11-02 20:59:05,274 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:59:05,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:59:05,438 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:59:05,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:05,439 INFO L85 PathProgramCache]: Analyzing trace with hash -763767610, now seen corresponding path program 3 times [2022-11-02 20:59:05,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:05,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130309480] [2022-11-02 20:59:05,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:05,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:05,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:59:05,467 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:59:05,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:59:05,504 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:59:05,504 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 20:59:05,505 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-02 20:59:05,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:59:05,510 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1] [2022-11-02 20:59:05,514 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:59:05,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:59:05 BoogieIcfgContainer [2022-11-02 20:59:05,560 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:59:05,560 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:59:05,560 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:59:05,561 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:59:05,580 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:59:03" (3/4) ... [2022-11-02 20:59:05,582 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-02 20:59:05,583 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:59:05,583 INFO L158 Benchmark]: Toolchain (without parser) took 2426.76ms. Allocated memory was 90.2MB in the beginning and 113.2MB in the end (delta: 23.1MB). Free memory was 55.1MB in the beginning and 89.0MB in the end (delta: -33.9MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:59:05,584 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 90.2MB. Free memory is still 71.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:59:05,584 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.27ms. Allocated memory is still 90.2MB. Free memory was 54.9MB in the beginning and 66.7MB in the end (delta: -11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 20:59:05,585 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.64ms. Allocated memory is still 90.2MB. Free memory was 66.7MB in the beginning and 65.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:59:05,585 INFO L158 Benchmark]: Boogie Preprocessor took 17.69ms. Allocated memory is still 90.2MB. Free memory was 65.3MB in the beginning and 64.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:59:05,585 INFO L158 Benchmark]: RCFGBuilder took 283.35ms. Allocated memory is still 90.2MB. Free memory was 64.1MB in the beginning and 55.4MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 20:59:05,586 INFO L158 Benchmark]: TraceAbstraction took 1759.49ms. Allocated memory was 90.2MB in the beginning and 113.2MB in the end (delta: 23.1MB). Free memory was 54.8MB in the beginning and 89.8MB in the end (delta: -35.0MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. [2022-11-02 20:59:05,586 INFO L158 Benchmark]: Witness Printer took 22.46ms. Allocated memory is still 113.2MB. Free memory was 89.8MB in the beginning and 89.0MB in the end (delta: 834.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:59:05,588 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.31ms. Allocated memory is still 90.2MB. Free memory is still 71.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 304.27ms. Allocated memory is still 90.2MB. Free memory was 54.9MB in the beginning and 66.7MB in the end (delta: -11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.64ms. Allocated memory is still 90.2MB. Free memory was 66.7MB in the beginning and 65.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.69ms. Allocated memory is still 90.2MB. Free memory was 65.3MB in the beginning and 64.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 283.35ms. Allocated memory is still 90.2MB. Free memory was 64.1MB in the beginning and 55.4MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1759.49ms. Allocated memory was 90.2MB in the beginning and 113.2MB in the end (delta: 23.1MB). Free memory was 54.8MB in the beginning and 89.8MB in the end (delta: -35.0MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. * Witness Printer took 22.46ms. Allocated memory is still 113.2MB. Free memory was 89.8MB in the beginning and 89.0MB in the end (delta: 834.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 29]: 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 24, overapproximation of someBinaryArithmeticFLOAToperation at line 16. Possible FailurePath: [L1] int __return_main; VAL [__return_main=0] [L9] float main__tick = 0.10000000149011612; [L10] float main__time = 0.0; [L11] int main__i; [L12] main__i = 0 VAL [__return_main=0, main__i=0, main__tick=2500000037252903/25000000000000000, main__time=0] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0, main__i=1, main__tick=2500000037252903/25000000000000000] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0, main__i=2, main__tick=2500000037252903/25000000000000000] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0, main__i=3, main__tick=2500000037252903/25000000000000000] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0, main__i=4, main__tick=2500000037252903/25000000000000000] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0, main__i=5, main__tick=2500000037252903/25000000000000000] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0, main__i=6, main__tick=2500000037252903/25000000000000000] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0, main__i=7, main__tick=2500000037252903/25000000000000000] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0, main__i=8, main__tick=2500000037252903/25000000000000000] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0, main__i=9, main__tick=2500000037252903/25000000000000000] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0, main__i=10, main__tick=2500000037252903/25000000000000000] [L14] COND FALSE !(main__i < 10) [L23] int __tmp_1; [L24] __tmp_1 = main__time != 1.0 [L25] int __VERIFIER_assert__cond; [L26] __VERIFIER_assert__cond = __tmp_1 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__i=10, main__tick=2500000037252903/25000000000000000] [L27] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__i=10, main__tick=2500000037252903/25000000000000000] [L29] reach_error() VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__i=10, main__tick=2500000037252903/25000000000000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 4, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 42 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27 IncrementalHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 18 mSDtfsCounter, 27 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=3, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 43 ConstructedInterpolants, 0 QuantifiedInterpolants, 87 SizeOfPredicates, 0 NumberOfNonLiveVariables, 97 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 0/33 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-02 20:59:05,655 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/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_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/drift_tenth.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc --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 ee159be1ed42c29b70080447b490f7a1aeb72331afc90e5794e0e8d61cb20d74 --- 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-5e519f3 [2022-11-02 20:59:08,105 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:59:08,107 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:59:08,154 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:59:08,155 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:59:08,158 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:59:08,159 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:59:08,163 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:59:08,170 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:59:08,173 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:59:08,174 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:59:08,176 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:59:08,177 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:59:08,182 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:59:08,183 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:59:08,185 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:59:08,185 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:59:08,186 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:59:08,188 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:59:08,190 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:59:08,191 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:59:08,192 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:59:08,193 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:59:08,194 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:59:08,197 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:59:08,198 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:59:08,198 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:59:08,199 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:59:08,199 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:59:08,200 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:59:08,200 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:59:08,201 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:59:08,202 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:59:08,203 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:59:08,204 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:59:08,204 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:59:08,205 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:59:08,205 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:59:08,205 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:59:08,206 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:59:08,207 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:59:08,208 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-11-02 20:59:08,241 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:59:08,242 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:59:08,243 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:59:08,243 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:59:08,244 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:59:08,245 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:59:08,246 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:59:08,246 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:59:08,246 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:59:08,247 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:59:08,248 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:59:08,248 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:59:08,248 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:59:08,248 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:59:08,248 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:59:08,249 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:59:08,249 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 20:59:08,249 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-02 20:59:08,249 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-02 20:59:08,249 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:59:08,249 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:59:08,250 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:59:08,250 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:59:08,250 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:59:08,250 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:59:08,250 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:59:08,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:59:08,251 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:59:08,251 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:59:08,251 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:59:08,251 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-02 20:59:08,251 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-02 20:59:08,252 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:59:08,252 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:59:08,252 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:59:08,252 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-02 20:59:08,253 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_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/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_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc 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 -> ee159be1ed42c29b70080447b490f7a1aeb72331afc90e5794e0e8d61cb20d74 [2022-11-02 20:59:08,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:59:08,645 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:59:08,648 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:59:08,649 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:59:08,650 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:59:08,652 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/float-benchs/drift_tenth.c.p+cfa-reducer.c [2022-11-02 20:59:08,726 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/data/56eccaab0/2003ba70f19b4d6e857d9db1e1728466/FLAGfba9a11e8 [2022-11-02 20:59:09,203 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:59:09,204 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/sv-benchmarks/c/float-benchs/drift_tenth.c.p+cfa-reducer.c [2022-11-02 20:59:09,210 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/data/56eccaab0/2003ba70f19b4d6e857d9db1e1728466/FLAGfba9a11e8 [2022-11-02 20:59:09,588 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/data/56eccaab0/2003ba70f19b4d6e857d9db1e1728466 [2022-11-02 20:59:09,590 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:59:09,592 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:59:09,593 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:59:09,593 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:59:09,597 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:59:09,598 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:59:09" (1/1) ... [2022-11-02 20:59:09,599 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e80c630 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:09, skipping insertion in model container [2022-11-02 20:59:09,600 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:59:09" (1/1) ... [2022-11-02 20:59:09,611 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:59:09,623 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:59:09,762 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/sv-benchmarks/c/float-benchs/drift_tenth.c.p+cfa-reducer.c[721,734] [2022-11-02 20:59:09,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:59:09,780 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:59:09,793 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/sv-benchmarks/c/float-benchs/drift_tenth.c.p+cfa-reducer.c[721,734] [2022-11-02 20:59:09,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:59:09,808 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:59:09,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:09 WrapperNode [2022-11-02 20:59:09,809 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:59:09,810 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:59:09,810 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:59:09,810 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:59:09,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:09" (1/1) ... [2022-11-02 20:59:09,825 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:09" (1/1) ... [2022-11-02 20:59:09,842 INFO L138 Inliner]: procedures = 13, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 31 [2022-11-02 20:59:09,842 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:59:09,843 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:59:09,843 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:59:09,843 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:59:09,852 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:09" (1/1) ... [2022-11-02 20:59:09,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:09" (1/1) ... [2022-11-02 20:59:09,854 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:09" (1/1) ... [2022-11-02 20:59:09,855 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:09" (1/1) ... [2022-11-02 20:59:09,881 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:09" (1/1) ... [2022-11-02 20:59:09,883 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:09" (1/1) ... [2022-11-02 20:59:09,884 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:09" (1/1) ... [2022-11-02 20:59:09,885 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:09" (1/1) ... [2022-11-02 20:59:09,887 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:59:09,888 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:59:09,889 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:59:09,889 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:59:09,889 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:09" (1/1) ... [2022-11-02 20:59:09,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:59:09,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:59:09,916 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:59:09,933 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:59:09,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:59:09,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:59:09,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:59:09,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-02 20:59:10,028 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:59:10,030 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:59:10,418 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:59:10,424 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:59:10,424 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 20:59:10,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:59:10 BoogieIcfgContainer [2022-11-02 20:59:10,426 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:59:10,428 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:59:10,429 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:59:10,432 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:59:10,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:59:09" (1/3) ... [2022-11-02 20:59:10,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3048a6dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:59:10, skipping insertion in model container [2022-11-02 20:59:10,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:09" (2/3) ... [2022-11-02 20:59:10,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3048a6dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:59:10, skipping insertion in model container [2022-11-02 20:59:10,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:59:10" (3/3) ... [2022-11-02 20:59:10,435 INFO L112 eAbstractionObserver]: Analyzing ICFG drift_tenth.c.p+cfa-reducer.c [2022-11-02 20:59:10,463 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:59:10,463 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:59:10,558 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:59:10,565 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;@7dae9a40, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:59:10,565 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:59:10,584 INFO L276 IsEmpty]: Start isEmpty. Operand has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:10,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-02 20:59:10,593 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:10,594 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-02 20:59:10,595 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:59:10,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:10,607 INFO L85 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2022-11-02 20:59:10,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:59:10,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1937515637] [2022-11-02 20:59:10,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:10,623 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:59:10,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:59:10,627 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:59:10,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-02 20:59:10,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:10,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 20:59:10,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:59:10,867 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-02 20:59:10,868 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:59:10,868 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:59:10,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1937515637] [2022-11-02 20:59:10,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1937515637] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:59:10,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:59:10,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:59:10,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365283650] [2022-11-02 20:59:10,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:59:10,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:59:10,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:59:10,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:59:10,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:59:10,907 INFO L87 Difference]: Start difference. First operand has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-02 20:59:11,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:11,037 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-11-02 20:59:11,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:59:11,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2022-11-02 20:59:11,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:11,056 INFO L225 Difference]: With dead ends: 16 [2022-11-02 20:59:11,056 INFO L226 Difference]: Without dead ends: 7 [2022-11-02 20:59:11,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-02 20:59:11,063 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:11,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:59:11,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2022-11-02 20:59:11,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2022-11-02 20:59:11,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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-02 20:59:11,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2022-11-02 20:59:11,094 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2022-11-02 20:59:11,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:11,094 INFO L495 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2022-11-02 20:59:11,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-02 20:59:11,095 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2022-11-02 20:59:11,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-02 20:59:11,096 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:11,096 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-02 20:59:11,117 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:59:11,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:59:11,317 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:59:11,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:11,320 INFO L85 PathProgramCache]: Analyzing trace with hash 889537510, now seen corresponding path program 1 times [2022-11-02 20:59:11,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:59:11,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1976708934] [2022-11-02 20:59:11,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:11,321 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:59:11,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:59:11,327 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:59:11,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-02 20:59:11,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:11,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:59:11,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:59:11,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:59:11,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:59:11,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:59:11,495 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:59:11,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1976708934] [2022-11-02 20:59:11,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1976708934] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:59:11,496 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:59:11,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-11-02 20:59:11,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068831815] [2022-11-02 20:59:11,497 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:59:11,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:59:11,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:59:11,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:59:11,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:59:11,500 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 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-02 20:59:11,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:11,792 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2022-11-02 20:59:11,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:59:11,796 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-02 20:59:11,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:11,797 INFO L225 Difference]: With dead ends: 13 [2022-11-02 20:59:11,797 INFO L226 Difference]: Without dead ends: 10 [2022-11-02 20:59:11,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:59:11,799 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:11,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:59:11,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-11-02 20:59:11,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-11-02 20:59:11,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:11,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2022-11-02 20:59:11,805 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2022-11-02 20:59:11,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:11,805 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2022-11-02 20:59:11,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 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-02 20:59:11,806 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-11-02 20:59:11,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:59:11,806 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:11,806 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2022-11-02 20:59:11,820 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:59:12,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:59:12,015 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:59:12,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:12,016 INFO L85 PathProgramCache]: Analyzing trace with hash 201697478, now seen corresponding path program 2 times [2022-11-02 20:59:12,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:59:12,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2045380890] [2022-11-02 20:59:12,017 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:59:12,017 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:59:12,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:59:12,020 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:59:12,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-02 20:59:12,197 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:59:12,197 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:59:12,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:59:12,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:59:12,265 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:59:12,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:59:12,397 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:59:12,397 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:59:12,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2045380890] [2022-11-02 20:59:12,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2045380890] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:59:12,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:59:12,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-11-02 20:59:12,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605020056] [2022-11-02 20:59:12,398 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:59:12,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:59:12,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:59:12,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:59:12,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:59:12,399 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:13,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:13,261 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-11-02 20:59:13,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:59:13,265 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-02 20:59:13,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:13,266 INFO L225 Difference]: With dead ends: 19 [2022-11-02 20:59:13,266 INFO L226 Difference]: Without dead ends: 16 [2022-11-02 20:59:13,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:59:13,268 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:13,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:59:13,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-11-02 20:59:13,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-11-02 20:59:13,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:13,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-11-02 20:59:13,275 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 9 [2022-11-02 20:59:13,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:13,276 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-11-02 20:59:13,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:13,276 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-11-02 20:59:13,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 20:59:13,277 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:13,277 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2022-11-02 20:59:13,293 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:59:13,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:59:13,493 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:59:13,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:13,494 INFO L85 PathProgramCache]: Analyzing trace with hash -763767610, now seen corresponding path program 3 times [2022-11-02 20:59:13,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:59:13,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1800441838] [2022-11-02 20:59:13,495 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 20:59:13,495 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:59:13,496 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:59:13,502 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:59:13,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f461ed-db09-4ac0-946d-bfba062bee2d/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-02 20:59:13,849 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-02 20:59:13,849 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:59:13,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-02 20:59:13,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:59:57,174 WARN L234 SmtUtils]: Spent 5.98s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 21:00:17,072 WARN L234 SmtUtils]: Spent 6.14s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 21:00:46,559 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 41 refuted. 14 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:00:46,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:01:18,821 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-11-02 21:01:24,901 WARN L833 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2022-11-02 21:01:26,934 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-11-02 21:02:25,602 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-11-02 21:02:32,705 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-11-02 21:02:38,845 WARN L833 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2022-11-02 21:02:40,888 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-11-02 21:02:47,038 WARN L833 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2022-11-02 21:02:54,795 WARN L833 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2022-11-02 21:02:56,850 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-11-02 21:03:03,004 WARN L833 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2022-11-02 21:03:05,059 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-11-02 21:03:05,059 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 3 refuted. 3 times theorem prover too weak. 0 trivial. 49 not checked. [2022-11-02 21:03:05,060 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 21:03:05,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1800441838] [2022-11-02 21:03:05,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1800441838] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:03:05,060 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 21:03:05,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2022-11-02 21:03:05,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565988072] [2022-11-02 21:03:05,061 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 21:03:05,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-02 21:03:05,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 21:03:05,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-02 21:03:05,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=262, Unknown=44, NotChecked=344, Total=756 [2022-11-02 21:03:05,064 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 28 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 27 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:03:07,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:03:09,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:03:11,745 WARN L855 $PredicateComparison]: unable to prove that (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-02 21:03:13,809 WARN L855 $PredicateComparison]: unable to prove that (and (= ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) |c_ULTIMATE.start_main_~main__time~0#1|) (= |c_ULTIMATE.start_main_~main__tick~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from true [2022-11-02 21:03:15,869 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~main__tick~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__time~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-02 21:03:17,927 WARN L855 $PredicateComparison]: unable to prove that (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= |c_ULTIMATE.start_main_~main__tick~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__time~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-02 21:03:19,988 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~main__tick~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__time~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-02 21:03:22,051 WARN L855 $PredicateComparison]: unable to prove that (and (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__time~0#1|) (= |c_ULTIMATE.start_main_~main__tick~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-02 21:03:23,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-02 21:03:25,991 WARN L855 $PredicateComparison]: unable to prove that (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= |c_ULTIMATE.start_main_~main__tick~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__time~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-02 21:03:29,574 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~main__tick~0#1|)) .cse1)) (= |c_ULTIMATE.start_main_~main__tick~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__time~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-02 21:03:31,617 WARN L855 $PredicateComparison]: unable to prove that (and (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__time~0#1|) (= |c_ULTIMATE.start_main_~main__tick~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-02 21:03:33,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-02 21:03:35,685 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|))) (let ((.cse4 (fp.add c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~main__tick~0#1|))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse4 |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse2) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~main__tick~0#1|)) .cse1)) (= |c_ULTIMATE.start_main_~main__time~0#1| (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) .cse3) .cse3) .cse3) .cse3) .cse3) .cse3) .cse3) .cse3) .cse3) .cse3))) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse4) .cse1)))))) is different from false [2022-11-02 21:03:37,755 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|))) (let ((.cse4 (fp.add c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~main__tick~0#1|))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse4 |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse2) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~main__tick~0#1|)) .cse1)) (= |c_ULTIMATE.start_main_~main__time~0#1| (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) .cse3) .cse3) .cse3) .cse3) .cse3) .cse3) .cse3) .cse3) .cse3) .cse3))) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse4) .cse1)))))) is different from true [2022-11-02 21:03:39,801 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~main__tick~0#1|)) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse2) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1|) .cse1))))) is different from false [2022-11-02 21:03:41,844 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~main__tick~0#1|)) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse2) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1|) .cse1))))) is different from true [2022-11-02 21:03:43,878 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~main__tick~0#1|)) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1|) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)))) is different from false [2022-11-02 21:03:45,912 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~main__tick~0#1|)) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1|) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)))) is different from true