./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/filter2_reinit.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/filter2_reinit.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 77348271d6b3efbe553fb980482d4643f648de35ae877e068f35f88b7419ce44 --- 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-2329fc7 [2022-12-14 05:53:06,722 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 05:53:06,723 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 05:53:06,742 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 05:53:06,743 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 05:53:06,744 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 05:53:06,745 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 05:53:06,747 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 05:53:06,748 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 05:53:06,749 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 05:53:06,750 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 05:53:06,751 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 05:53:06,752 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 05:53:06,753 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 05:53:06,754 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 05:53:06,755 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 05:53:06,756 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 05:53:06,757 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 05:53:06,759 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 05:53:06,761 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 05:53:06,762 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 05:53:06,763 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 05:53:06,764 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 05:53:06,765 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 05:53:06,767 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 05:53:06,767 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 05:53:06,767 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 05:53:06,768 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 05:53:06,768 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 05:53:06,769 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 05:53:06,769 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 05:53:06,769 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 05:53:06,770 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 05:53:06,770 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 05:53:06,771 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 05:53:06,771 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 05:53:06,772 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 05:53:06,772 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 05:53:06,772 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 05:53:06,773 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 05:53:06,773 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 05:53:06,774 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 05:53:06,804 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 05:53:06,804 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 05:53:06,804 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 05:53:06,805 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 05:53:06,805 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 05:53:06,805 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 05:53:06,806 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 05:53:06,806 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 05:53:06,806 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 05:53:06,806 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 05:53:06,806 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 05:53:06,806 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 05:53:06,806 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 05:53:06,807 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 05:53:06,807 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 05:53:06,807 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 05:53:06,807 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 05:53:06,807 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 05:53:06,808 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 05:53:06,808 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 05:53:06,808 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 05:53:06,808 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 05:53:06,808 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 05:53:06,809 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 05:53:06,809 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 05:53:06,809 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 05:53:06,809 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 05:53:06,809 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 05:53:06,809 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 05:53:06,809 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 05:53:06,810 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 05:53:06,810 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 05:53:06,810 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 05:53:06,815 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 05:53:06,815 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 05:53:06,815 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 05:53:06,816 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 05:53:06,816 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 05:53:06,816 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 05:53:06,816 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 05:53:06,816 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 05:53:06,816 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_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/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_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 77348271d6b3efbe553fb980482d4643f648de35ae877e068f35f88b7419ce44 [2022-12-14 05:53:06,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 05:53:07,016 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 05:53:07,018 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 05:53:07,018 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 05:53:07,019 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 05:53:07,020 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/float-benchs/filter2_reinit.c [2022-12-14 05:53:09,705 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 05:53:09,844 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 05:53:09,844 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/sv-benchmarks/c/float-benchs/filter2_reinit.c [2022-12-14 05:53:09,849 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/data/0b24f2c07/ba194259cad04f1ca838d2abdbcd3150/FLAG0573f4637 [2022-12-14 05:53:09,860 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/data/0b24f2c07/ba194259cad04f1ca838d2abdbcd3150 [2022-12-14 05:53:09,863 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 05:53:09,864 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 05:53:09,865 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 05:53:09,865 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 05:53:09,867 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 05:53:09,868 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 05:53:09" (1/1) ... [2022-12-14 05:53:09,869 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4352da9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:53:09, skipping insertion in model container [2022-12-14 05:53:09,869 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 05:53:09" (1/1) ... [2022-12-14 05:53:09,874 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 05:53:09,885 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 05:53:09,986 WARN L237 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_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/sv-benchmarks/c/float-benchs/filter2_reinit.c[700,713] [2022-12-14 05:53:09,997 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 05:53:10,004 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 05:53:10,013 WARN L237 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_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/sv-benchmarks/c/float-benchs/filter2_reinit.c[700,713] [2022-12-14 05:53:10,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 05:53:10,026 INFO L208 MainTranslator]: Completed translation [2022-12-14 05:53:10,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:53:10 WrapperNode [2022-12-14 05:53:10,026 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 05:53:10,027 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 05:53:10,027 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 05:53:10,028 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 05:53:10,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:53:10" (1/1) ... [2022-12-14 05:53:10,040 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:53:10" (1/1) ... [2022-12-14 05:53:10,051 INFO L138 Inliner]: procedures = 15, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 58 [2022-12-14 05:53:10,052 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 05:53:10,053 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 05:53:10,053 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 05:53:10,053 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 05:53:10,060 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:53:10" (1/1) ... [2022-12-14 05:53:10,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:53:10" (1/1) ... [2022-12-14 05:53:10,062 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:53:10" (1/1) ... [2022-12-14 05:53:10,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:53:10" (1/1) ... [2022-12-14 05:53:10,067 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:53:10" (1/1) ... [2022-12-14 05:53:10,070 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:53:10" (1/1) ... [2022-12-14 05:53:10,071 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:53:10" (1/1) ... [2022-12-14 05:53:10,072 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:53:10" (1/1) ... [2022-12-14 05:53:10,074 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 05:53:10,075 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 05:53:10,075 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 05:53:10,075 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 05:53:10,076 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:53:10" (1/1) ... [2022-12-14 05:53:10,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 05:53:10,092 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:53:10,103 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 05:53:10,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 05:53:10,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 05:53:10,135 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-12-14 05:53:10,135 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-12-14 05:53:10,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 05:53:10,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 05:53:10,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 05:53:10,190 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 05:53:10,192 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 05:53:10,272 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 05:53:10,302 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 05:53:10,302 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 05:53:10,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 05:53:10 BoogieIcfgContainer [2022-12-14 05:53:10,304 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 05:53:10,306 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 05:53:10,306 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 05:53:10,308 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 05:53:10,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 05:53:09" (1/3) ... [2022-12-14 05:53:10,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b4d4ca2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 05:53:10, skipping insertion in model container [2022-12-14 05:53:10,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:53:10" (2/3) ... [2022-12-14 05:53:10,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b4d4ca2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 05:53:10, skipping insertion in model container [2022-12-14 05:53:10,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 05:53:10" (3/3) ... [2022-12-14 05:53:10,310 INFO L112 eAbstractionObserver]: Analyzing ICFG filter2_reinit.c [2022-12-14 05:53:10,335 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 05:53:10,335 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 05:53:10,388 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 05:53:10,395 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4dba8234, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 05:53:10,395 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-14 05:53:10,399 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 05:53:10,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 05:53:10,407 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:53:10,408 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:53:10,408 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 05:53:10,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:53:10,414 INFO L85 PathProgramCache]: Analyzing trace with hash 2008667769, now seen corresponding path program 1 times [2022-12-14 05:53:10,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:53:10,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803292098] [2022-12-14 05:53:10,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:53:10,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:53:10,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 05:53:10,521 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 05:53:10,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 05:53:10,549 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-12-14 05:53:10,550 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 05:53:10,551 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-14 05:53:10,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 05:53:10,556 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2022-12-14 05:53:10,559 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 05:53:10,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 05:53:10 BoogieIcfgContainer [2022-12-14 05:53:10,572 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 05:53:10,572 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 05:53:10,573 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 05:53:10,573 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 05:53:10,573 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 05:53:10" (3/4) ... [2022-12-14 05:53:10,575 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-14 05:53:10,575 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 05:53:10,576 INFO L158 Benchmark]: Toolchain (without parser) took 712.41ms. Allocated memory is still 199.2MB. Free memory was 147.8MB in the beginning and 156.5MB in the end (delta: -8.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 05:53:10,576 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 111.1MB. Free memory was 81.3MB in the beginning and 81.2MB in the end (delta: 117.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 05:53:10,577 INFO L158 Benchmark]: CACSL2BoogieTranslator took 161.86ms. Allocated memory is still 199.2MB. Free memory was 147.4MB in the beginning and 136.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-14 05:53:10,577 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.59ms. Allocated memory is still 199.2MB. Free memory was 136.9MB in the beginning and 135.6MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 05:53:10,577 INFO L158 Benchmark]: Boogie Preprocessor took 21.34ms. Allocated memory is still 199.2MB. Free memory was 135.6MB in the beginning and 134.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 05:53:10,578 INFO L158 Benchmark]: RCFGBuilder took 229.23ms. Allocated memory is still 199.2MB. Free memory was 134.1MB in the beginning and 121.9MB in the end (delta: 12.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-14 05:53:10,578 INFO L158 Benchmark]: TraceAbstraction took 266.36ms. Allocated memory is still 199.2MB. Free memory was 121.5MB in the beginning and 157.4MB in the end (delta: -36.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 05:53:10,578 INFO L158 Benchmark]: Witness Printer took 2.97ms. Allocated memory is still 199.2MB. Free memory was 157.4MB in the beginning and 156.5MB in the end (delta: 925.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 05:53:10,580 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.12ms. Allocated memory is still 111.1MB. Free memory was 81.3MB in the beginning and 81.2MB in the end (delta: 117.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 161.86ms. Allocated memory is still 199.2MB. Free memory was 147.4MB in the beginning and 136.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.59ms. Allocated memory is still 199.2MB. Free memory was 136.9MB in the beginning and 135.6MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.34ms. Allocated memory is still 199.2MB. Free memory was 135.6MB in the beginning and 134.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 229.23ms. Allocated memory is still 199.2MB. Free memory was 134.1MB in the beginning and 121.9MB in the end (delta: 12.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 266.36ms. Allocated memory is still 199.2MB. Free memory was 121.5MB in the beginning and 157.4MB in the end (delta: -36.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.97ms. Allocated memory is still 199.2MB. Free memory was 157.4MB in the beginning and 156.5MB in the end (delta: 925.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: 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 53, overapproximation of to_real at line 31, overapproximation of someBinaryArithmeticDOUBLEoperation at line 51. Possible FailurePath: [L23] double E, E0, E1, S0, S1, S; [L24] int i; [L26] E = __VERIFIER_nondet_double() [L27] E0 = __VERIFIER_nondet_double() [L28] CALL assume_abort_if_not(E >= 0. && E <= 1.) VAL [\old(cond)=1] [L16] COND FALSE !(!cond) [L28] RET assume_abort_if_not(E >= 0. && E <= 1.) [L29] CALL assume_abort_if_not(E0 >= 0. && E0 <= 1.) VAL [\old(cond)=1] [L16] COND FALSE !(!cond) [L29] RET assume_abort_if_not(E0 >= 0. && E0 <= 1.) [L31] S0 = 0 [L32] S = 0 [L34] i = 0 VAL [i=0] [L34] COND TRUE i <= 1000000 [L36] E1 = E0 [L37] E0 = E [L39] E = __VERIFIER_nondet_double() [L40] CALL assume_abort_if_not(E >= 0. && E <= 1.) VAL [\old(cond)=1] [L16] COND FALSE !(!cond) [L40] RET assume_abort_if_not(E >= 0. && E <= 1.) VAL [E=53, E=53, E=53, i=0] [L42] COND TRUE __VERIFIER_nondet_int() [L43] E1 = E [L44] E0 = E [L45] S0 = E [L46] S = E [L49] S1 = S0 [L50] S0 = S [L51] S = 0.7*E - E0*1.3 + E1*1.1 + S0*1.4 - S1*0.7 [L53] CALL __VERIFIER_assert(S >= -4. && S <= 4.) [L18] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L18] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 1, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 15 NumberOfCodeBlocks, 15 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-12-14 05:53:10,597 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/filter2_reinit.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 77348271d6b3efbe553fb980482d4643f648de35ae877e068f35f88b7419ce44 --- 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-2329fc7 [2022-12-14 05:53:12,537 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 05:53:12,538 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 05:53:12,557 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 05:53:12,557 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 05:53:12,558 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 05:53:12,560 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 05:53:12,561 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 05:53:12,563 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 05:53:12,564 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 05:53:12,565 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 05:53:12,566 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 05:53:12,566 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 05:53:12,567 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 05:53:12,569 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 05:53:12,570 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 05:53:12,571 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 05:53:12,572 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 05:53:12,573 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 05:53:12,575 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 05:53:12,576 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 05:53:12,578 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 05:53:12,579 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 05:53:12,580 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 05:53:12,583 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 05:53:12,584 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 05:53:12,584 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 05:53:12,585 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 05:53:12,586 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 05:53:12,587 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 05:53:12,587 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 05:53:12,588 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 05:53:12,589 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 05:53:12,589 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 05:53:12,590 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 05:53:12,591 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 05:53:12,591 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 05:53:12,592 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 05:53:12,592 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 05:53:12,593 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 05:53:12,593 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 05:53:12,594 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2022-12-14 05:53:12,616 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 05:53:12,616 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 05:53:12,616 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 05:53:12,617 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 05:53:12,617 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 05:53:12,618 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 05:53:12,618 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 05:53:12,618 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 05:53:12,618 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 05:53:12,618 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 05:53:12,619 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 05:53:12,619 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 05:53:12,619 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 05:53:12,620 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 05:53:12,620 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 05:53:12,620 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 05:53:12,620 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 05:53:12,620 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 05:53:12,621 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 05:53:12,621 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 05:53:12,621 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-14 05:53:12,621 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-14 05:53:12,621 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 05:53:12,622 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 05:53:12,622 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 05:53:12,622 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 05:53:12,622 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 05:53:12,622 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-14 05:53:12,622 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 05:53:12,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 05:53:12,623 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 05:53:12,623 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 05:53:12,623 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 05:53:12,624 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-12-14 05:53:12,624 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-14 05:53:12,624 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 05:53:12,624 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 05:53:12,624 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-14 05:53:12,624 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_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/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_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 77348271d6b3efbe553fb980482d4643f648de35ae877e068f35f88b7419ce44 [2022-12-14 05:53:12,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 05:53:12,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 05:53:12,880 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 05:53:12,881 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 05:53:12,882 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 05:53:12,883 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/float-benchs/filter2_reinit.c [2022-12-14 05:53:15,452 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 05:53:15,584 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 05:53:15,584 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/sv-benchmarks/c/float-benchs/filter2_reinit.c [2022-12-14 05:53:15,589 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/data/f70fdc4bb/9b433891b80f4e928b70b599d0d78dcd/FLAG24bde2f56 [2022-12-14 05:53:15,600 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/data/f70fdc4bb/9b433891b80f4e928b70b599d0d78dcd [2022-12-14 05:53:15,602 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 05:53:15,603 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 05:53:15,604 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 05:53:15,604 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 05:53:15,613 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 05:53:15,613 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 05:53:15" (1/1) ... [2022-12-14 05:53:15,614 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@802db98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:53:15, skipping insertion in model container [2022-12-14 05:53:15,615 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 05:53:15" (1/1) ... [2022-12-14 05:53:15,620 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 05:53:15,630 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 05:53:15,733 WARN L237 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_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/sv-benchmarks/c/float-benchs/filter2_reinit.c[700,713] [2022-12-14 05:53:15,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 05:53:15,755 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 05:53:15,764 WARN L237 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_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/sv-benchmarks/c/float-benchs/filter2_reinit.c[700,713] [2022-12-14 05:53:15,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 05:53:15,778 INFO L208 MainTranslator]: Completed translation [2022-12-14 05:53:15,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:53:15 WrapperNode [2022-12-14 05:53:15,779 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 05:53:15,780 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 05:53:15,780 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 05:53:15,780 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 05:53:15,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:53:15" (1/1) ... [2022-12-14 05:53:15,792 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:53:15" (1/1) ... [2022-12-14 05:53:15,804 INFO L138 Inliner]: procedures = 16, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 58 [2022-12-14 05:53:15,804 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 05:53:15,805 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 05:53:15,805 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 05:53:15,805 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 05:53:15,813 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:53:15" (1/1) ... [2022-12-14 05:53:15,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:53:15" (1/1) ... [2022-12-14 05:53:15,815 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:53:15" (1/1) ... [2022-12-14 05:53:15,816 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:53:15" (1/1) ... [2022-12-14 05:53:15,822 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:53:15" (1/1) ... [2022-12-14 05:53:15,826 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:53:15" (1/1) ... [2022-12-14 05:53:15,828 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:53:15" (1/1) ... [2022-12-14 05:53:15,829 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:53:15" (1/1) ... [2022-12-14 05:53:15,831 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 05:53:15,832 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 05:53:15,832 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 05:53:15,833 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 05:53:15,833 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:53:15" (1/1) ... [2022-12-14 05:53:15,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 05:53:15,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:53:15,860 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 05:53:15,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 05:53:15,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 05:53:15,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-14 05:53:15,896 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-12-14 05:53:15,896 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-12-14 05:53:15,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 05:53:15,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 05:53:15,960 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 05:53:15,962 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 05:53:18,281 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 05:53:18,286 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 05:53:18,286 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 05:53:18,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 05:53:18 BoogieIcfgContainer [2022-12-14 05:53:18,288 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 05:53:18,290 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 05:53:18,290 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 05:53:18,292 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 05:53:18,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 05:53:15" (1/3) ... [2022-12-14 05:53:18,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5823248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 05:53:18, skipping insertion in model container [2022-12-14 05:53:18,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:53:15" (2/3) ... [2022-12-14 05:53:18,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5823248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 05:53:18, skipping insertion in model container [2022-12-14 05:53:18,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 05:53:18" (3/3) ... [2022-12-14 05:53:18,295 INFO L112 eAbstractionObserver]: Analyzing ICFG filter2_reinit.c [2022-12-14 05:53:18,308 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 05:53:18,308 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 05:53:18,342 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 05:53:18,346 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5d2fe477, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 05:53:18,347 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-14 05:53:18,350 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 05:53:18,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 05:53:18,357 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:53:18,357 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:53:18,358 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 05:53:18,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:53:18,362 INFO L85 PathProgramCache]: Analyzing trace with hash 526466326, now seen corresponding path program 1 times [2022-12-14 05:53:18,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 05:53:18,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [432341688] [2022-12-14 05:53:18,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:53:18,372 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 05:53:18,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 05:53:18,373 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 05:53:18,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-12-14 05:53:19,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:53:19,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-14 05:53:19,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:53:19,711 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 05:53:19,711 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 05:53:19,712 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 05:53:19,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [432341688] [2022-12-14 05:53:19,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [432341688] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:53:19,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:53:19,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 05:53:19,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007428053] [2022-12-14 05:53:19,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:53:19,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 05:53:19,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 05:53:19,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 05:53:19,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 05:53:19,738 INFO L87 Difference]: Start difference. First operand has 22 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 05:53:19,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:53:19,751 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2022-12-14 05:53:19,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 05:53:19,753 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-12-14 05:53:19,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:53:19,757 INFO L225 Difference]: With dead ends: 41 [2022-12-14 05:53:19,757 INFO L226 Difference]: Without dead ends: 18 [2022-12-14 05:53:19,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 05:53:19,761 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:53:19,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 05:53:19,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-12-14 05:53:19,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-12-14 05:53:19,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 05:53:19,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-12-14 05:53:19,789 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 23 [2022-12-14 05:53:19,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:53:19,789 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-12-14 05:53:19,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 05:53:19,789 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-12-14 05:53:19,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 05:53:19,791 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:53:19,791 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:53:19,816 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-12-14 05:53:19,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 05:53:19,994 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 05:53:19,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:53:19,996 INFO L85 PathProgramCache]: Analyzing trace with hash -398587304, now seen corresponding path program 1 times [2022-12-14 05:53:19,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 05:53:19,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [709107963] [2022-12-14 05:53:19,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:53:19,999 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 05:53:20,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 05:53:20,003 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 05:53:20,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-12-14 05:53:32,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:53:32,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-14 05:53:32,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:54:22,816 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 4.0))) (let ((.cse5 (fp.neg .cse6)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 13.0 10.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 5.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 10.0)))) (or (and (or (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) .cse5)))) (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) .cse6)) (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (let ((.cse7 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)))) (and (fp.leq .cse7 .cse6) (fp.geq .cse7 .cse5) (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53))))))))) is different from false [2022-12-14 05:54:54,462 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 13.0 10.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 5.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 10.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) (fp.neg .cse5))))) (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) .cse5)) (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)))))) is different from false [2022-12-14 05:54:56,509 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 13.0 10.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 5.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 10.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) (fp.neg .cse5))))) (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) .cse5)) (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)))))) is different from true [2022-12-14 05:54:56,510 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 05:54:56,510 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 05:54:56,510 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 05:54:56,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [709107963] [2022-12-14 05:54:56,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [709107963] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:54:56,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:54:56,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 05:54:56,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808791595] [2022-12-14 05:54:56,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:54:56,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 05:54:56,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 05:54:56,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 05:54:56,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=27, Unknown=3, NotChecked=22, Total=72 [2022-12-14 05:54:56,514 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-14 05:54:59,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.51s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-14 05:54:59,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:54:59,677 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-12-14 05:54:59,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 05:54:59,678 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-12-14 05:54:59,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:54:59,679 INFO L225 Difference]: With dead ends: 30 [2022-12-14 05:54:59,679 INFO L226 Difference]: Without dead ends: 28 [2022-12-14 05:54:59,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=25, Invalid=36, Unknown=3, NotChecked=26, Total=90 [2022-12-14 05:54:59,681 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 4 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:54:59,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 45 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 1 Unknown, 34 Unchecked, 3.1s Time] [2022-12-14 05:54:59,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-12-14 05:54:59,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-12-14 05:54:59,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-14 05:54:59,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-12-14 05:54:59,687 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23 [2022-12-14 05:54:59,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:54:59,687 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-12-14 05:54:59,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-14 05:54:59,688 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-12-14 05:54:59,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 05:54:59,688 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:54:59,688 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:54:59,721 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-12-14 05:54:59,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 05:54:59,890 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 05:54:59,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:54:59,892 INFO L85 PathProgramCache]: Analyzing trace with hash -398527722, now seen corresponding path program 1 times [2022-12-14 05:54:59,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 05:54:59,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1991601908] [2022-12-14 05:54:59,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:54:59,894 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 05:54:59,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 05:54:59,898 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 05:54:59,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-12-14 05:55:08,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:55:08,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-14 05:55:08,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:57:53,620 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 10.0))) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 4.0))) (let ((.cse3 (fp.neg .cse2)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 13.0 10.0))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (.cse7 (fp.mul roundNearestTiesToEven .cse9 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 5.0)))) (.cse8 (fp.mul roundNearestTiesToEven .cse9 .cse4)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (and (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| .cse5)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E1~0#1| .cse6)) .cse7) .cse8))) (and (fp.geq |ULTIMATE.start_main_~E1~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse0) (fp.leq .cse1 .cse2) (fp.geq .cse1 .cse3)))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (and (or (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (exists ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| .cse5)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E1~0#1| .cse6)) .cse7) .cse8) .cse3)) (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0))) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse0))) (fp.geq |ULTIMATE.start_main_~E1~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse0))) (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E1~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse0) (exists ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| .cse5)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E1~0#1| .cse6)) .cse7) .cse8) .cse2)) (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0))) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse0)))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)))))) is different from false [2022-12-14 05:58:25,256 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 10.0))) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 13.0 10.0))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (.cse3 (fp.mul roundNearestTiesToEven .cse7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 5.0)))) (.cse4 (fp.mul roundNearestTiesToEven .cse7 .cse0)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (exists ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| .cse1)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E1~0#1| .cse2)) .cse3) .cse4) (fp.neg .cse5))) (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse6))) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse6))) (fp.geq |ULTIMATE.start_main_~E1~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse6))) (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E1~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse6) (exists ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| .cse1)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E1~0#1| .cse2)) .cse3) .cse4) .cse5)) (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse6))) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse6)))))))) is different from false [2022-12-14 05:58:27,302 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 10.0))) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 13.0 10.0))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (.cse3 (fp.mul roundNearestTiesToEven .cse7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 5.0)))) (.cse4 (fp.mul roundNearestTiesToEven .cse7 .cse0)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (exists ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| .cse1)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E1~0#1| .cse2)) .cse3) .cse4) (fp.neg .cse5))) (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse6))) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse6))) (fp.geq |ULTIMATE.start_main_~E1~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse6))) (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E1~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse6) (exists ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| .cse1)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E1~0#1| .cse2)) .cse3) .cse4) .cse5)) (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse6))) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse6)))))))) is different from true [2022-12-14 05:58:27,303 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 05:58:27,303 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 05:58:27,303 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 05:58:27,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1991601908] [2022-12-14 05:58:27,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1991601908] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:58:27,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:58:27,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-14 05:58:27,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460042107] [2022-12-14 05:58:27,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:58:27,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 05:58:27,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 05:58:27,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 05:58:27,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=60, Unknown=3, NotChecked=34, Total=132 [2022-12-14 05:58:27,306 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 12 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 05:58:30,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-14 05:58:32,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-14 05:58:32,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:58:32,996 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-12-14 05:58:32,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 05:58:32,997 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 23 [2022-12-14 05:58:32,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:58:32,998 INFO L225 Difference]: With dead ends: 31 [2022-12-14 05:58:32,998 INFO L226 Difference]: Without dead ends: 29 [2022-12-14 05:58:32,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=40, Invalid=75, Unknown=3, NotChecked=38, Total=156 [2022-12-14 05:58:33,000 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 2 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-12-14 05:58:33,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 72 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 2 Unknown, 37 Unchecked, 5.5s Time] [2022-12-14 05:58:33,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-12-14 05:58:33,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-12-14 05:58:33,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-14 05:58:33,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-12-14 05:58:33,005 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23 [2022-12-14 05:58:33,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:58:33,005 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-12-14 05:58:33,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 05:58:33,005 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-12-14 05:58:33,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 05:58:33,006 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:58:33,006 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:58:33,039 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-12-14 05:58:33,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 05:58:33,208 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 05:58:33,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:58:33,210 INFO L85 PathProgramCache]: Analyzing trace with hash 497959587, now seen corresponding path program 1 times [2022-12-14 05:58:33,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 05:58:33,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1316478649] [2022-12-14 05:58:33,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:58:33,212 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 05:58:33,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 05:58:33,216 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 05:58:33,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-12-14 05:58:45,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:58:45,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-14 05:58:45,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:59:20,074 WARN L837 $PredicateComparison]: unable to prove that (or (and (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 13.0 10.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 5.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 10.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) (fp.neg .cse5))))) (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) .cse5)) (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) is different from false [2022-12-14 05:59:51,806 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 13.0 10.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 5.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 10.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) (fp.neg .cse5))))) (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) .cse5)) (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)))))) is different from false [2022-12-14 05:59:53,854 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 13.0 10.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 5.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 10.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) (fp.neg .cse5))))) (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) .cse5)) (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)))))) is different from true [2022-12-14 05:59:53,854 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 1 not checked. [2022-12-14 05:59:53,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:00:05,607 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~E~0#1|) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 10.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~S0~0#1| .cse2)))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 4.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2022-12-14 06:00:07,805 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~E~0#1|) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 10.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~S0~0#1| .cse2)))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 4.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from true [2022-12-14 06:00:18,920 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~E~0#1|) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 10.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E~0#1| .cse2)))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 4.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from false [2022-12-14 06:00:21,043 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~E~0#1|) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 10.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E~0#1| .cse2)))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 4.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from true [2022-12-14 06:00:50,125 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 10.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0))) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode 4.0)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (forall ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |ULTIMATE.start_main_~E~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse1)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse2)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse3)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse0)) .cse4) (not (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53))) (not (fp.leq |ULTIMATE.start_main_~E~0#1| .cse5)))) (forall ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |ULTIMATE.start_main_~E~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse1)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse2)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse3)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse0)) (fp.neg .cse4)) (not (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53))) (not (fp.leq |ULTIMATE.start_main_~E~0#1| .cse5)))))) is different from false [2022-12-14 06:00:52,363 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 10.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0))) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode 4.0)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (forall ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |ULTIMATE.start_main_~E~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse1)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse2)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse3)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse0)) .cse4) (not (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53))) (not (fp.leq |ULTIMATE.start_main_~E~0#1| .cse5)))) (forall ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |ULTIMATE.start_main_~E~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse1)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse2)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse3)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse0)) (fp.neg .cse4)) (not (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53))) (not (fp.leq |ULTIMATE.start_main_~E~0#1| .cse5)))))) is different from true [2022-12-14 06:00:52,364 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 06:00:52,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1316478649] [2022-12-14 06:00:52,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1316478649] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:00:52,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [543453017] [2022-12-14 06:00:52,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:00:52,365 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 06:00:52,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 06:00:52,366 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 06:00:52,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2022-12-14 06:01:03,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:01:04,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-14 06:01:04,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:01:49,687 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 4.0))) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 10.0))) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0))) (.cse7 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0))) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0))) (.cse1 (fp.neg .cse2)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |ULTIMATE.start_main_~S0~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse5)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse6)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse7)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse4)))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2) (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse3) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)))))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse3) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)) (not (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |ULTIMATE.start_main_~S0~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse5)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse6)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse7)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse4)) .cse2)))) (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |ULTIMATE.start_main_~S0~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse5)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse6)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse7)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse4)) .cse1)) (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse3) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53))))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-12-14 06:02:32,964 WARN L233 SmtUtils]: Spent 9.45s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 06:03:59,417 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_assume_abort_if_not_#in~cond| c_assume_abort_if_not_~cond) (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |ULTIMATE.start_main_~S0~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 10.0)))) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0)))) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0)))) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse2)))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 4.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1) (fp.leq |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-12-14 06:04:18,734 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |ULTIMATE.start_main_~S0~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 10.0)))) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0)))) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0)))) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse2)))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 4.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1) (fp.leq |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53))))) (= c_currentRoundingMode roundNearestTiesToEven) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from false [2022-12-14 06:04:52,182 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.leq |c_ULTIMATE.start_main_~E~0#1| .cse0) (fp.geq |c_ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |ULTIMATE.start_main_~S0~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 10.0)))) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0)))) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0)))) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse3)))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 4.0))) (and (fp.geq .cse1 (fp.neg .cse2)) (fp.leq .cse1 .cse2) (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-12-14 06:05:12,550 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= |c_ULTIMATE.start_main_~E~0#1| |c_ULTIMATE.start_main_~S0~0#1|) (= |c_ULTIMATE.start_main_~E~0#1| |c_ULTIMATE.start_main_~E1~0#1|) (fp.leq |c_ULTIMATE.start_main_~E~0#1| .cse0) (= |c_ULTIMATE.start_main_~S~0#1| |c_ULTIMATE.start_main_~E~0#1|) (= |c_ULTIMATE.start_main_~E~0#1| |c_ULTIMATE.start_main_~E0~0#1|) (fp.geq |c_ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |ULTIMATE.start_main_~S0~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 10.0)))) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0)))) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0)))) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse3)))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 4.0))) (and (fp.geq .cse1 (fp.neg .cse2)) (fp.leq .cse1 .cse2) (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-12-14 06:06:09,996 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 12 not checked. [2022-12-14 06:06:09,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:06:54,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [543453017] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:06:54,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825054104] [2022-12-14 06:06:54,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:06:54,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:06:54,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:06:54,275 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:06:54,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d31a7c-0cb5-4d54-af0a-3d93d99ac1ac/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process