./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur --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 18b0d5e6a0e5bf3511d59ae2b1faedfad3abe1ea74492067ae408dc7e088829e --- 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-38b53e6 [2022-11-25 22:19:56,881 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 22:19:56,884 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 22:19:56,940 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 22:19:56,942 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 22:19:56,946 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 22:19:56,949 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 22:19:56,953 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 22:19:56,956 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 22:19:56,959 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 22:19:56,962 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 22:19:56,964 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 22:19:56,964 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 22:19:56,969 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 22:19:56,971 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 22:19:56,973 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 22:19:56,975 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 22:19:56,976 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 22:19:56,977 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 22:19:56,998 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 22:19:56,999 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 22:19:57,000 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 22:19:57,002 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 22:19:57,002 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 22:19:57,005 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 22:19:57,006 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 22:19:57,006 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 22:19:57,007 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 22:19:57,008 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 22:19:57,009 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 22:19:57,009 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 22:19:57,010 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 22:19:57,011 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 22:19:57,011 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 22:19:57,012 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 22:19:57,013 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 22:19:57,013 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 22:19:57,014 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 22:19:57,014 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 22:19:57,015 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 22:19:57,016 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 22:19:57,016 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-25 22:19:57,035 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 22:19:57,035 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 22:19:57,036 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 22:19:57,036 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 22:19:57,037 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 22:19:57,037 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 22:19:57,037 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 22:19:57,038 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 22:19:57,038 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 22:19:57,038 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 22:19:57,038 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 22:19:57,039 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 22:19:57,039 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 22:19:57,039 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 22:19:57,039 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 22:19:57,040 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 22:19:57,040 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 22:19:57,040 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 22:19:57,041 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 22:19:57,041 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 22:19:57,041 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 22:19:57,041 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 22:19:57,042 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 22:19:57,042 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 22:19:57,042 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 22:19:57,042 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 22:19:57,043 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 22:19:57,043 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 22:19:57,043 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 22:19:57,043 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 22:19:57,044 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 22:19:57,044 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 22:19:57,044 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:19:57,044 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 22:19:57,045 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 22:19:57,045 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 22:19:57,045 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 22:19:57,045 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 22:19:57,045 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 22:19:57,046 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 22:19:57,046 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 22:19:57,046 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_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/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_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur 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 -> 18b0d5e6a0e5bf3511d59ae2b1faedfad3abe1ea74492067ae408dc7e088829e [2022-11-25 22:19:57,340 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 22:19:57,375 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 22:19:57,379 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 22:19:57,380 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 22:19:57,381 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 22:19:57,383 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c [2022-11-25 22:20:00,461 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 22:20:00,644 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 22:20:00,645 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c [2022-11-25 22:20:00,652 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/data/8a2034e8f/51b077eab5254b829073c209ad6b3703/FLAG93668fd53 [2022-11-25 22:20:00,667 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/data/8a2034e8f/51b077eab5254b829073c209ad6b3703 [2022-11-25 22:20:00,670 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 22:20:00,672 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 22:20:00,673 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 22:20:00,673 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 22:20:00,683 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 22:20:00,684 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:20:00" (1/1) ... [2022-11-25 22:20:00,685 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fcd0e50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:20:00, skipping insertion in model container [2022-11-25 22:20:00,686 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:20:00" (1/1) ... [2022-11-25 22:20:00,694 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 22:20:00,720 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 22:20:00,868 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_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c[1464,1477] [2022-11-25 22:20:00,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:20:00,886 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 22:20:00,905 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_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c[1464,1477] [2022-11-25 22:20:00,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:20:00,922 INFO L208 MainTranslator]: Completed translation [2022-11-25 22:20:00,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:20:00 WrapperNode [2022-11-25 22:20:00,922 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 22:20:00,924 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 22:20:00,924 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 22:20:00,924 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 22:20:00,932 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:20:00" (1/1) ... [2022-11-25 22:20:00,940 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:20:00" (1/1) ... [2022-11-25 22:20:00,970 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 80 [2022-11-25 22:20:00,970 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 22:20:00,971 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 22:20:00,971 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 22:20:00,971 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 22:20:00,980 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:20:00" (1/1) ... [2022-11-25 22:20:00,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:20:00" (1/1) ... [2022-11-25 22:20:00,982 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:20:00" (1/1) ... [2022-11-25 22:20:00,982 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:20:00" (1/1) ... [2022-11-25 22:20:00,986 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:20:00" (1/1) ... [2022-11-25 22:20:00,988 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:20:00" (1/1) ... [2022-11-25 22:20:00,989 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:20:00" (1/1) ... [2022-11-25 22:20:00,990 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:20:00" (1/1) ... [2022-11-25 22:20:00,992 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 22:20:00,993 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 22:20:00,993 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 22:20:00,993 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 22:20:00,994 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:20:00" (1/1) ... [2022-11-25 22:20:01,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:20:01,019 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:20:01,034 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 22:20:01,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 22:20:01,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 22:20:01,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 22:20:01,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 22:20:01,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 22:20:01,196 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 22:20:01,198 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 22:20:01,314 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 22:20:01,348 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 22:20:01,348 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 22:20:01,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:20:01 BoogieIcfgContainer [2022-11-25 22:20:01,351 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 22:20:01,354 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 22:20:01,354 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 22:20:01,357 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 22:20:01,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 10:20:00" (1/3) ... [2022-11-25 22:20:01,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21ffc315 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 10:20:01, skipping insertion in model container [2022-11-25 22:20:01,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:20:00" (2/3) ... [2022-11-25 22:20:01,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21ffc315 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 10:20:01, skipping insertion in model container [2022-11-25 22:20:01,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:20:01" (3/3) ... [2022-11-25 22:20:01,361 INFO L112 eAbstractionObserver]: Analyzing ICFG rlim_invariant.c.p+cfa-reducer.c [2022-11-25 22:20:01,380 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 22:20:01,380 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 22:20:01,433 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 22:20:01,440 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;@592c77e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 22:20:01,440 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 22:20:01,444 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 18 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:20:01,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 22:20:01,451 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:20:01,452 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:20:01,452 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:20:01,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:20:01,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1394921896, now seen corresponding path program 1 times [2022-11-25 22:20:01,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:20:01,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706238532] [2022-11-25 22:20:01,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:20:01,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:20:01,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:20:01,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:20:01,788 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:20:01,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706238532] [2022-11-25 22:20:01,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706238532] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:20:01,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:20:01,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 22:20:01,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030859706] [2022-11-25 22:20:01,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:20:01,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 22:20:01,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:20:01,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 22:20:01,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:20:01,856 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 18 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:20:02,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:20:02,051 INFO L93 Difference]: Finished difference Result 89 states and 129 transitions. [2022-11-25 22:20:02,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 22:20:02,055 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-25 22:20:02,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:20:02,066 INFO L225 Difference]: With dead ends: 89 [2022-11-25 22:20:02,067 INFO L226 Difference]: Without dead ends: 73 [2022-11-25 22:20:02,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-25 22:20:02,077 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 120 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:20:02,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 129 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:20:02,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-25 22:20:02,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 19. [2022-11-25 22:20:02,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:20:02,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2022-11-25 22:20:02,124 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 13 [2022-11-25 22:20:02,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:20:02,124 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2022-11-25 22:20:02,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:20:02,125 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2022-11-25 22:20:02,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 22:20:02,125 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:20:02,125 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:20:02,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 22:20:02,126 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:20:02,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:20:02,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1411932557, now seen corresponding path program 1 times [2022-11-25 22:20:02,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:20:02,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686631672] [2022-11-25 22:20:02,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:20:02,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:20:02,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 22:20:02,164 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 22:20:02,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 22:20:02,223 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-25 22:20:02,223 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 22:20:02,225 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-25 22:20:02,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 22:20:02,230 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2022-11-25 22:20:02,234 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 22:20:02,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 10:20:02 BoogieIcfgContainer [2022-11-25 22:20:02,261 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 22:20:02,262 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 22:20:02,262 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 22:20:02,262 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 22:20:02,263 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:20:01" (3/4) ... [2022-11-25 22:20:02,266 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 22:20:02,267 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 22:20:02,268 INFO L158 Benchmark]: Toolchain (without parser) took 1595.92ms. Allocated memory is still 155.2MB. Free memory was 119.8MB in the beginning and 82.7MB in the end (delta: 37.1MB). Peak memory consumption was 34.8MB. Max. memory is 16.1GB. [2022-11-25 22:20:02,268 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 109.1MB. Free memory is still 82.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 22:20:02,269 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.61ms. Allocated memory is still 155.2MB. Free memory was 119.4MB in the beginning and 108.6MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 22:20:02,269 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.92ms. Allocated memory is still 155.2MB. Free memory was 108.6MB in the beginning and 107.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 22:20:02,270 INFO L158 Benchmark]: Boogie Preprocessor took 21.43ms. Allocated memory is still 155.2MB. Free memory was 107.1MB in the beginning and 106.1MB in the end (delta: 928.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 22:20:02,270 INFO L158 Benchmark]: RCFGBuilder took 358.30ms. Allocated memory is still 155.2MB. Free memory was 105.8MB in the beginning and 118.0MB in the end (delta: -12.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 22:20:02,271 INFO L158 Benchmark]: TraceAbstraction took 907.87ms. Allocated memory is still 155.2MB. Free memory was 117.1MB in the beginning and 83.1MB in the end (delta: 34.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-11-25 22:20:02,271 INFO L158 Benchmark]: Witness Printer took 4.82ms. Allocated memory is still 155.2MB. Free memory was 83.1MB in the beginning and 82.7MB in the end (delta: 405.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 22:20:02,274 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.29ms. Allocated memory is still 109.1MB. Free memory is still 82.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 249.61ms. Allocated memory is still 155.2MB. Free memory was 119.4MB in the beginning and 108.6MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.92ms. Allocated memory is still 155.2MB. Free memory was 108.6MB in the beginning and 107.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.43ms. Allocated memory is still 155.2MB. Free memory was 107.1MB in the beginning and 106.1MB in the end (delta: 928.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 358.30ms. Allocated memory is still 155.2MB. Free memory was 105.8MB in the beginning and 118.0MB in the end (delta: -12.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * TraceAbstraction took 907.87ms. Allocated memory is still 155.2MB. Free memory was 117.1MB in the beginning and 83.1MB in the end (delta: 34.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Witness Printer took 4.82ms. Allocated memory is still 155.2MB. Free memory was 83.1MB in the beginning and 82.7MB in the end (delta: 405.9kB). 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: 66]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 48, overapproximation of someBinaryDOUBLEComparisonOperation at line 53, overapproximation of to_real at line 20, overapproximation of someBinaryArithmeticFLOAToperation at line 47. Possible FailurePath: [L1] int __return_main; [L14] float main__X; [L15] float main__Y; [L16] float main__S; [L17] float main__R; [L18] float main__D; [L19] int main__i; [L20] main__Y = 0 [L21] main__i = 0 VAL [__return_main=0, main__i=0] [L23] COND TRUE main__i < 100000 [L25] main__X = __VERIFIER_nondet_float() [L26] main__D = __VERIFIER_nondet_float() [L27] int main____CPAchecker_TMP_0; VAL [__return_main=0, main__D=53, main__i=0, main__X=54] [L28] COND TRUE main__X >= -128.0 VAL [__return_main=0, main__D=53, main__i=0, main__X=54] [L30] COND TRUE main__X <= 128.0 [L32] main____CPAchecker_TMP_0 = 1 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__D=53, main__i=0, main__X=54] [L34] COND TRUE main____CPAchecker_TMP_0 != 0 [L36] int main____CPAchecker_TMP_1; VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__D=53, main__i=0, main__X=54] [L37] COND TRUE main__D >= 0.0 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__D=53, main__i=0, main__X=54] [L39] COND TRUE main__D <= 16.0 [L41] main____CPAchecker_TMP_1 = 1 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__D=53, main__i=0, main__X=54] [L43] COND TRUE main____CPAchecker_TMP_1 != 0 [L45] main__S = main__Y [L46] main__Y = main__X [L47] main__R = main__X - main__S [L48] COND TRUE main__R <= (-main__D) [L50] main__Y = main__S - main__D [L52] int main____CPAchecker_TMP_2; VAL [__return_main=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__D=53, main__i=0, main__S=55, main__X=54, main__Y=54] [L53] COND FALSE !(main__Y >= -129.0) VAL [__return_main=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__D=53, main__i=0, main__S=55, main__X=54, main__Y=54] [L79] main____CPAchecker_TMP_2 = 0 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__D=53, main__i=0, main__S=55, main__X=54, main__Y=54] [L60] int __tmp_1; [L61] __tmp_1 = main____CPAchecker_TMP_2 [L62] int __VERIFIER_assert__cond; [L63] __VERIFIER_assert__cond = __tmp_1 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__D=53, main__i=0, main__S=55, main__X=54, main__Y=54] [L64] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__D=53, main__i=0, main__S=55, main__X=54, main__Y=54] [L66] reach_error() VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__D=53, main__i=0, main__S=55, main__X=54, main__Y=54] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 120 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 120 mSDsluCounter, 129 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 89 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 47 IncrementalHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 40 mSDtfsCounter, 47 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 54 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 26 NumberOfCodeBlocks, 26 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 20 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-25 22:20:02,298 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur --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 18b0d5e6a0e5bf3511d59ae2b1faedfad3abe1ea74492067ae408dc7e088829e --- 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-38b53e6 [2022-11-25 22:20:04,828 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 22:20:04,830 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 22:20:04,871 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 22:20:04,873 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 22:20:04,877 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 22:20:04,878 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 22:20:04,883 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 22:20:04,885 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 22:20:04,886 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 22:20:04,888 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 22:20:04,889 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 22:20:04,889 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 22:20:04,891 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 22:20:04,892 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 22:20:04,893 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 22:20:04,894 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 22:20:04,895 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 22:20:04,897 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 22:20:04,899 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 22:20:04,900 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 22:20:04,905 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 22:20:04,906 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 22:20:04,907 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 22:20:04,910 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 22:20:04,911 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 22:20:04,911 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 22:20:04,912 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 22:20:04,913 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 22:20:04,914 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 22:20:04,914 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 22:20:04,915 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 22:20:04,916 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 22:20:04,917 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 22:20:04,923 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 22:20:04,925 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 22:20:04,926 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 22:20:04,926 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 22:20:04,926 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 22:20:04,927 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 22:20:04,928 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 22:20:04,930 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2022-11-25 22:20:04,966 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 22:20:04,966 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 22:20:04,966 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 22:20:04,967 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 22:20:04,967 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 22:20:04,968 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 22:20:04,968 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 22:20:04,968 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 22:20:04,968 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 22:20:04,968 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 22:20:04,968 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 22:20:04,969 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 22:20:04,969 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 22:20:04,970 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 22:20:04,970 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 22:20:04,970 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 22:20:04,970 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 22:20:04,970 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 22:20:04,970 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 22:20:04,971 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 22:20:04,971 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 22:20:04,971 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 22:20:04,971 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 22:20:04,971 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 22:20:04,971 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 22:20:04,972 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 22:20:04,972 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 22:20:04,972 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 22:20:04,972 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 22:20:04,972 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:20:04,973 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 22:20:04,973 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 22:20:04,973 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 22:20:04,973 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-25 22:20:04,973 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 22:20:04,974 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 22:20:04,974 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 22:20:04,974 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 22:20:04,974 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_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/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_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur 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 -> 18b0d5e6a0e5bf3511d59ae2b1faedfad3abe1ea74492067ae408dc7e088829e [2022-11-25 22:20:05,369 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 22:20:05,398 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 22:20:05,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 22:20:05,402 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 22:20:05,403 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 22:20:05,404 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c [2022-11-25 22:20:08,458 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 22:20:08,703 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 22:20:08,710 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c [2022-11-25 22:20:08,716 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/data/d768f0fcc/d9ff00058e664bacbc7586653b6ec55c/FLAG8f81ec0a3 [2022-11-25 22:20:08,730 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/data/d768f0fcc/d9ff00058e664bacbc7586653b6ec55c [2022-11-25 22:20:08,733 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 22:20:08,735 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 22:20:08,736 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 22:20:08,736 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 22:20:08,740 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 22:20:08,741 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:20:08" (1/1) ... [2022-11-25 22:20:08,742 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a325625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:20:08, skipping insertion in model container [2022-11-25 22:20:08,742 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:20:08" (1/1) ... [2022-11-25 22:20:08,750 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 22:20:08,768 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 22:20:08,947 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_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c[1464,1477] [2022-11-25 22:20:08,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:20:08,970 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 22:20:08,988 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_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c[1464,1477] [2022-11-25 22:20:08,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:20:09,022 INFO L208 MainTranslator]: Completed translation [2022-11-25 22:20:09,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:20:09 WrapperNode [2022-11-25 22:20:09,023 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 22:20:09,024 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 22:20:09,024 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 22:20:09,025 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 22:20:09,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:20:09" (1/1) ... [2022-11-25 22:20:09,041 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:20:09" (1/1) ... [2022-11-25 22:20:09,059 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 81 [2022-11-25 22:20:09,060 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 22:20:09,061 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 22:20:09,061 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 22:20:09,061 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 22:20:09,070 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:20:09" (1/1) ... [2022-11-25 22:20:09,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:20:09" (1/1) ... [2022-11-25 22:20:09,075 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:20:09" (1/1) ... [2022-11-25 22:20:09,077 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:20:09" (1/1) ... [2022-11-25 22:20:09,086 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:20:09" (1/1) ... [2022-11-25 22:20:09,096 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:20:09" (1/1) ... [2022-11-25 22:20:09,101 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:20:09" (1/1) ... [2022-11-25 22:20:09,108 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:20:09" (1/1) ... [2022-11-25 22:20:09,116 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 22:20:09,117 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 22:20:09,118 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 22:20:09,118 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 22:20:09,119 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:20:09" (1/1) ... [2022-11-25 22:20:09,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:20:09,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:20:09,159 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 22:20:09,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 22:20:09,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 22:20:09,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 22:20:09,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 22:20:09,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 22:20:09,304 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 22:20:09,306 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 22:20:10,405 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 22:20:10,411 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 22:20:10,411 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 22:20:10,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:20:10 BoogieIcfgContainer [2022-11-25 22:20:10,413 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 22:20:10,415 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 22:20:10,416 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 22:20:10,419 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 22:20:10,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 10:20:08" (1/3) ... [2022-11-25 22:20:10,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d5b24ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 10:20:10, skipping insertion in model container [2022-11-25 22:20:10,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:20:09" (2/3) ... [2022-11-25 22:20:10,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d5b24ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 10:20:10, skipping insertion in model container [2022-11-25 22:20:10,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:20:10" (3/3) ... [2022-11-25 22:20:10,422 INFO L112 eAbstractionObserver]: Analyzing ICFG rlim_invariant.c.p+cfa-reducer.c [2022-11-25 22:20:10,442 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 22:20:10,442 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 22:20:10,492 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 22:20:10,499 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;@7ef2a1b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 22:20:10,499 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 22:20:10,503 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:20:10,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 22:20:10,510 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:20:10,511 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:20:10,511 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:20:10,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:20:10,517 INFO L85 PathProgramCache]: Analyzing trace with hash -34829450, now seen corresponding path program 1 times [2022-11-25 22:20:10,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:20:10,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1397170564] [2022-11-25 22:20:10,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:20:10,543 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:20:10,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:20:10,554 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:20:10,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-25 22:20:10,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:20:10,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 22:20:10,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:20:10,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:20:10,880 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:20:10,881 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:20:10,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1397170564] [2022-11-25 22:20:10,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1397170564] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:20:10,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:20:10,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:20:10,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587130747] [2022-11-25 22:20:10,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:20:10,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:20:10,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:20:10,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:20:10,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:20:10,943 INFO L87 Difference]: Start difference. First operand has 24 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:20:11,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:20:11,041 INFO L93 Difference]: Finished difference Result 51 states and 72 transitions. [2022-11-25 22:20:11,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 22:20:11,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-25 22:20:11,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:20:11,052 INFO L225 Difference]: With dead ends: 51 [2022-11-25 22:20:11,053 INFO L226 Difference]: Without dead ends: 40 [2022-11-25 22:20:11,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:20:11,061 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 53 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:20:11,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 122 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:20:11,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-25 22:20:11,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 23. [2022-11-25 22:20:11,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:20:11,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2022-11-25 22:20:11,110 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 16 [2022-11-25 22:20:11,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:20:11,111 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2022-11-25 22:20:11,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:20:11,111 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-11-25 22:20:11,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 22:20:11,112 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:20:11,113 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:20:11,128 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/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-11-25 22:20:11,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:20:11,328 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:20:11,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:20:11,329 INFO L85 PathProgramCache]: Analyzing trace with hash -17818789, now seen corresponding path program 1 times [2022-11-25 22:20:11,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:20:11,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1843386968] [2022-11-25 22:20:11,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:20:11,330 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:20:11,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:20:11,332 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:20:11,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-25 22:20:11,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:20:11,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 22:20:11,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:20:20,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:20:20,098 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:20:20,098 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:20:20,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1843386968] [2022-11-25 22:20:20,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1843386968] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:20:20,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:20:20,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 22:20:20,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493788117] [2022-11-25 22:20:20,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:20:20,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 22:20:20,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:20:20,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 22:20:20,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:20:20,102 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:20:25,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:20:32,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:20:34,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:20:41,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:20:43,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:20:45,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:20:48,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:20:50,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:20:53,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:20:53,538 INFO L93 Difference]: Finished difference Result 100 states and 135 transitions. [2022-11-25 22:20:53,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 22:20:53,546 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-25 22:20:53,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:20:53,547 INFO L225 Difference]: With dead ends: 100 [2022-11-25 22:20:53,548 INFO L226 Difference]: Without dead ends: 79 [2022-11-25 22:20:53,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-25 22:20:53,549 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 62 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:20:53,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 88 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 6 Unknown, 0 Unchecked, 30.0s Time] [2022-11-25 22:20:53,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-25 22:20:53,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 34. [2022-11-25 22:20:53,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 33 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:20:53,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 47 transitions. [2022-11-25 22:20:53,568 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 47 transitions. Word has length 16 [2022-11-25 22:20:53,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:20:53,569 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 47 transitions. [2022-11-25 22:20:53,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:20:53,571 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2022-11-25 22:20:53,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 22:20:53,572 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:20:53,572 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:20:53,597 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-25 22:20:53,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:20:53,787 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:20:53,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:20:53,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1271663018, now seen corresponding path program 1 times [2022-11-25 22:20:53,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:20:53,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [830719014] [2022-11-25 22:20:53,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:20:53,788 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:20:53,789 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:20:53,790 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:20:53,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-25 22:20:53,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:20:53,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 22:20:53,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:20:53,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:20:53,913 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:20:53,913 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:20:53,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [830719014] [2022-11-25 22:20:53,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [830719014] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:20:53,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:20:53,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:20:53,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983155804] [2022-11-25 22:20:53,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:20:53,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:20:53,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:20:53,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:20:53,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:20:53,916 INFO L87 Difference]: Start difference. First operand 34 states and 47 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:20:54,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:20:54,126 INFO L93 Difference]: Finished difference Result 56 states and 77 transitions. [2022-11-25 22:20:54,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:20:54,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-25 22:20:54,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:20:54,133 INFO L225 Difference]: With dead ends: 56 [2022-11-25 22:20:54,133 INFO L226 Difference]: Without dead ends: 33 [2022-11-25 22:20:54,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:20:54,135 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 22:20:54,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 22:20:54,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-25 22:20:54,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-11-25 22:20:54,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:20:54,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2022-11-25 22:20:54,143 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 16 [2022-11-25 22:20:54,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:20:54,143 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2022-11-25 22:20:54,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:20:54,144 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2022-11-25 22:20:54,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 22:20:54,145 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:20:54,145 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:20:54,163 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-25 22:20:54,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:20:54,360 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:20:54,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:20:54,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1069421883, now seen corresponding path program 1 times [2022-11-25 22:20:54,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:20:54,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [825148789] [2022-11-25 22:20:54,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:20:54,361 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:20:54,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:20:54,363 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:20:54,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-25 22:20:54,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:20:54,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 22:20:54,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:20:58,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:20:58,991 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:20:58,992 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:20:58,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [825148789] [2022-11-25 22:20:58,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [825148789] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:20:58,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:20:58,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 22:20:58,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453277854] [2022-11-25 22:20:58,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:20:58,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 22:20:58,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:20:58,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 22:20:58,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:20:58,995 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:21:15,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:21:15,243 INFO L93 Difference]: Finished difference Result 83 states and 105 transitions. [2022-11-25 22:21:15,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 22:21:15,253 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-25 22:21:15,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:21:15,254 INFO L225 Difference]: With dead ends: 83 [2022-11-25 22:21:15,254 INFO L226 Difference]: Without dead ends: 63 [2022-11-25 22:21:15,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-25 22:21:15,256 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 58 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:21:15,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 67 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 14.0s Time] [2022-11-25 22:21:15,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-25 22:21:15,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 34. [2022-11-25 22:21:15,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:21:15,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2022-11-25 22:21:15,265 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 17 [2022-11-25 22:21:15,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:21:15,266 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2022-11-25 22:21:15,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:21:15,266 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2022-11-25 22:21:15,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 22:21:15,267 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:21:15,267 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:21:15,280 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/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)] Forceful destruction successful, exit code 0 [2022-11-25 22:21:15,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:21:15,476 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:21:15,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:21:15,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1450538051, now seen corresponding path program 1 times [2022-11-25 22:21:15,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:21:15,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [749077822] [2022-11-25 22:21:15,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:21:15,478 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:21:15,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:21:15,486 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:21:15,536 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-25 22:21:15,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:21:15,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 22:21:15,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:21:19,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:21:19,429 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:21:19,430 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:21:19,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [749077822] [2022-11-25 22:21:19,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [749077822] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:21:19,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:21:19,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 22:21:19,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771600576] [2022-11-25 22:21:19,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:21:19,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 22:21:19,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:21:19,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 22:21:19,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:21:19,432 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:21:33,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-25 22:21:40,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:21:40,271 INFO L93 Difference]: Finished difference Result 128 states and 160 transitions. [2022-11-25 22:21:40,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 22:21:40,282 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-25 22:21:40,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:21:40,284 INFO L225 Difference]: With dead ends: 128 [2022-11-25 22:21:40,284 INFO L226 Difference]: Without dead ends: 108 [2022-11-25 22:21:40,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:21:40,285 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 73 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.2s IncrementalHoareTripleChecker+Time [2022-11-25 22:21:40,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 54 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 16.2s Time] [2022-11-25 22:21:40,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-11-25 22:21:40,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 49. [2022-11-25 22:21:40,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:21:40,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2022-11-25 22:21:40,300 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 17 [2022-11-25 22:21:40,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:21:40,301 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2022-11-25 22:21:40,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:21:40,301 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2022-11-25 22:21:40,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 22:21:40,302 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:21:40,302 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:21:40,312 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-25 22:21:40,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:21:40,503 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:21:40,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:21:40,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1069229389, now seen corresponding path program 1 times [2022-11-25 22:21:40,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:21:40,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1698207876] [2022-11-25 22:21:40,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:21:40,506 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:21:40,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:21:40,511 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:21:40,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-25 22:21:40,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:21:40,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-25 22:21:40,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:21:51,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:21:51,014 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:21:51,014 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:21:51,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1698207876] [2022-11-25 22:21:51,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1698207876] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:21:51,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:21:51,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 22:21:51,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855470751] [2022-11-25 22:21:51,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:21:51,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 22:21:51,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:21:51,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 22:21:51,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-11-25 22:21:51,016 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:22:05,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:22:05,058 INFO L93 Difference]: Finished difference Result 109 states and 136 transitions. [2022-11-25 22:22:05,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 22:22:05,069 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-25 22:22:05,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:22:05,070 INFO L225 Difference]: With dead ends: 109 [2022-11-25 22:22:05,070 INFO L226 Difference]: Without dead ends: 80 [2022-11-25 22:22:05,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-11-25 22:22:05,074 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 91 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2022-11-25 22:22:05,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 36 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 11.3s Time] [2022-11-25 22:22:05,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-25 22:22:05,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 49. [2022-11-25 22:22:05,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:22:05,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2022-11-25 22:22:05,093 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 17 [2022-11-25 22:22:05,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:22:05,094 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2022-11-25 22:22:05,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:22:05,094 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2022-11-25 22:22:05,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 22:22:05,095 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:22:05,095 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:22:05,113 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-25 22:22:05,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:22:05,317 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:22:05,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:22:05,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1175383176, now seen corresponding path program 1 times [2022-11-25 22:22:05,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:22:05,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2089117976] [2022-11-25 22:22:05,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:22:05,318 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:22:05,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:22:05,320 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:22:05,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-25 22:22:05,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:22:05,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 22:22:05,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:22:05,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:22:05,418 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:22:05,418 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:22:05,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2089117976] [2022-11-25 22:22:05,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2089117976] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:22:05,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:22:05,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:22:05,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850597791] [2022-11-25 22:22:05,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:22:05,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:22:05,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:22:05,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:22:05,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:22:05,420 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:22:05,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:22:05,572 INFO L93 Difference]: Finished difference Result 75 states and 95 transitions. [2022-11-25 22:22:05,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:22:05,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-25 22:22:05,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:22:05,574 INFO L225 Difference]: With dead ends: 75 [2022-11-25 22:22:05,574 INFO L226 Difference]: Without dead ends: 35 [2022-11-25 22:22:05,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:22:05,576 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:22:05,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:22:05,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-25 22:22:05,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-11-25 22:22:05,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:22:05,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-11-25 22:22:05,586 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 17 [2022-11-25 22:22:05,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:22:05,587 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-11-25 22:22:05,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:22:05,587 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-11-25 22:22:05,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 22:22:05,588 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:22:05,588 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:22:05,603 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-25 22:22:05,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:22:05,794 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:22:05,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:22:05,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1724506925, now seen corresponding path program 1 times [2022-11-25 22:22:05,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:22:05,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [408635575] [2022-11-25 22:22:05,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:22:05,795 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:22:05,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:22:05,796 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:22:05,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-25 22:22:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:22:05,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-25 22:22:05,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:22:15,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:22:15,168 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:22:15,168 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:22:15,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [408635575] [2022-11-25 22:22:15,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [408635575] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:22:15,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:22:15,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 22:22:15,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247231699] [2022-11-25 22:22:15,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:22:15,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 22:22:15,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:22:15,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 22:22:15,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-11-25 22:22:15,170 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:22:26,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:22:30,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:22:30,755 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2022-11-25 22:22:30,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 22:22:30,766 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-25 22:22:30,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:22:30,766 INFO L225 Difference]: With dead ends: 73 [2022-11-25 22:22:30,766 INFO L226 Difference]: Without dead ends: 51 [2022-11-25 22:22:30,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-11-25 22:22:30,767 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 39 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2022-11-25 22:22:30,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 38 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 11.3s Time] [2022-11-25 22:22:30,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-25 22:22:30,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 33. [2022-11-25 22:22:30,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:22:30,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-11-25 22:22:30,775 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 18 [2022-11-25 22:22:30,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:22:30,775 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-11-25 22:22:30,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:22:30,775 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-11-25 22:22:30,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-25 22:22:30,776 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:22:30,776 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:22:30,787 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-25 22:22:30,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:22:30,978 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:22:30,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:22:30,978 INFO L85 PathProgramCache]: Analyzing trace with hash -66815887, now seen corresponding path program 1 times [2022-11-25 22:22:30,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:22:30,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [292908629] [2022-11-25 22:22:30,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:22:30,979 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:22:30,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:22:30,980 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:22:30,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-25 22:22:31,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:22:31,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-25 22:22:31,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:24:04,633 WARN L837 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~main__R~0#1_8| (_ FloatingPoint 8 24)) (|ULTIMATE.start_main_~main__R~0#1| (_ FloatingPoint 8 24)) (|ULTIMATE.start_main_~main__D~0#1| (_ FloatingPoint 8 24)) (|v_ULTIMATE.start_main_~main__D~0#1_12| (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 16.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven |v_ULTIMATE.start_main_~main__D~0#1_12|)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~main__D~0#1|))) (and (fp.leq .cse0 .cse1) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)) |v_ULTIMATE.start_main_~main__D~0#1_12|) |ULTIMATE.start_main_~main__D~0#1|)) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 129.0)))) (fp.leq .cse2 .cse1) (fp.leq |v_ULTIMATE.start_main_~main__R~0#1_8| (fp.neg |v_ULTIMATE.start_main_~main__D~0#1_12|)) (fp.geq .cse0 (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~main__R~0#1| (fp.neg |ULTIMATE.start_main_~main__D~0#1|)) (fp.geq .cse2 (_ +zero 11 53))))) is different from false [2022-11-25 22:24:06,651 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~main__R~0#1_8| (_ FloatingPoint 8 24)) (|ULTIMATE.start_main_~main__R~0#1| (_ FloatingPoint 8 24)) (|ULTIMATE.start_main_~main__D~0#1| (_ FloatingPoint 8 24)) (|v_ULTIMATE.start_main_~main__D~0#1_12| (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 16.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven |v_ULTIMATE.start_main_~main__D~0#1_12|)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~main__D~0#1|))) (and (fp.leq .cse0 .cse1) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)) |v_ULTIMATE.start_main_~main__D~0#1_12|) |ULTIMATE.start_main_~main__D~0#1|)) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 129.0)))) (fp.leq .cse2 .cse1) (fp.leq |v_ULTIMATE.start_main_~main__R~0#1_8| (fp.neg |v_ULTIMATE.start_main_~main__D~0#1_12|)) (fp.geq .cse0 (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~main__R~0#1| (fp.neg |ULTIMATE.start_main_~main__D~0#1|)) (fp.geq .cse2 (_ +zero 11 53))))) is different from true [2022-11-25 22:25:29,773 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 2 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-25 22:25:29,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:26:43,612 WARN L233 SmtUtils]: Spent 12.59s on a formula simplification. DAG size of input: 20 DAG size of output: 15 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:28:11,521 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 129.0))) (or (forall ((|ULTIMATE.start_main_~main__D~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |ULTIMATE.start_main_~main__D~0#1|))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (not (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 16.0))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__Y~0#1| |ULTIMATE.start_main_~main__D~0#1|)) (fp.neg .cse1))))) (not (fp.leq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__Y~0#1|) .cse1)))) is different from true [2022-11-25 22:28:24,302 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 129.0))) (let ((.cse1 (fp.neg .cse3)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__Y~0#1|))) (or (forall ((|ULTIMATE.start_main_~main__D~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |ULTIMATE.start_main_~main__D~0#1|))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (not (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 16.0))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__Y~0#1| |ULTIMATE.start_main_~main__D~0#1|)) .cse1)))) (not (fp.geq .cse2 .cse1)) (not (fp.leq .cse2 .cse3))))) is different from true [2022-11-25 22:28:53,055 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 129.0)) (.cse4 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__S~0#1| |c_ULTIMATE.start_main_~main__D~0#1|))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode .cse4)) (.cse2 (fp.neg .cse1))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 .cse2)) (forall ((|v_ULTIMATE.start_main_~main__D~0#1_14| (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~main__D~0#1_14|))) (or (not (fp.leq .cse3 ((_ to_fp 11 53) c_currentRoundingMode 16.0))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~main__D~0#1_14|)) .cse2) (not (fp.geq .cse3 (_ +zero 11 53)))))) (forall ((|ULTIMATE.start_main_~main__R~0#1| (_ FloatingPoint 8 24))) (not (fp.leq |ULTIMATE.start_main_~main__R~0#1| (fp.neg |c_ULTIMATE.start_main_~main__D~0#1|))))))) is different from true [2022-11-25 22:29:09,172 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 129.0)) (.cse0 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__Y~0#1| |c_ULTIMATE.start_main_~main__D~0#1|))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode .cse0)) (.cse1 (fp.neg .cse4))) (or (forall ((|v_ULTIMATE.start_main_~main__D~0#1_14| (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~main__D~0#1_14|))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~main__D~0#1_14|)) .cse1) (not (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 16.0))) (not (fp.geq .cse2 (_ +zero 11 53)))))) (not (fp.leq .cse3 .cse4)) (not (fp.geq .cse3 .cse1)) (forall ((|ULTIMATE.start_main_~main__R~0#1| (_ FloatingPoint 8 24))) (not (fp.leq |ULTIMATE.start_main_~main__R~0#1| (fp.neg |c_ULTIMATE.start_main_~main__D~0#1|))))))) is different from true [2022-11-25 22:29:27,861 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode 129.0)) (.cse0 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__Y~0#1| |c_ULTIMATE.start_main_~main__D~0#1|))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 16.0)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode .cse0)) (.cse1 (fp.neg .cse5))) (or (forall ((|v_ULTIMATE.start_main_~main__D~0#1_14| (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~main__D~0#1_14|))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~main__D~0#1_14|)) .cse1) (not (fp.leq .cse2 .cse3)) (not (fp.geq .cse2 (_ +zero 11 53)))))) (not (fp.leq .cse4 .cse5)) (not (fp.leq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__D~0#1|) .cse3)) (not (fp.geq .cse4 .cse1)) (forall ((|ULTIMATE.start_main_~main__R~0#1| (_ FloatingPoint 8 24))) (not (fp.leq |ULTIMATE.start_main_~main__R~0#1| (fp.neg |c_ULTIMATE.start_main_~main__D~0#1|))))))) is different from false [2022-11-25 22:29:29,898 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode 129.0)) (.cse0 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__Y~0#1| |c_ULTIMATE.start_main_~main__D~0#1|))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 16.0)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode .cse0)) (.cse1 (fp.neg .cse5))) (or (forall ((|v_ULTIMATE.start_main_~main__D~0#1_14| (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~main__D~0#1_14|))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~main__D~0#1_14|)) .cse1) (not (fp.leq .cse2 .cse3)) (not (fp.geq .cse2 (_ +zero 11 53)))))) (not (fp.leq .cse4 .cse5)) (not (fp.leq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__D~0#1|) .cse3)) (not (fp.geq .cse4 .cse1)) (forall ((|ULTIMATE.start_main_~main__R~0#1| (_ FloatingPoint 8 24))) (not (fp.leq |ULTIMATE.start_main_~main__R~0#1| (fp.neg |c_ULTIMATE.start_main_~main__D~0#1|))))))) is different from true [2022-11-25 22:29:52,296 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__D~0#1| (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 129.0)) (.cse2 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__Y~0#1| |ULTIMATE.start_main_~main__D~0#1|))) (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode |ULTIMATE.start_main_~main__D~0#1|)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 16.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode .cse2)) (.cse3 (fp.neg .cse1))) (or (not (fp.leq .cse0 .cse1)) (forall ((|v_ULTIMATE.start_main_~main__D~0#1_14| (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~main__D~0#1_14|))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~main__D~0#1_14|)) .cse3) (not (fp.leq .cse4 .cse5)) (not (fp.geq .cse4 (_ +zero 11 53)))))) (not (fp.geq .cse6 (_ +zero 11 53))) (not (fp.leq .cse6 .cse5)) (not (fp.geq .cse0 .cse3)) (forall ((|ULTIMATE.start_main_~main__R~0#1| (_ FloatingPoint 8 24))) (not (fp.leq |ULTIMATE.start_main_~main__R~0#1| (fp.neg |ULTIMATE.start_main_~main__D~0#1|)))))))) is different from false [2022-11-25 22:29:54,332 WARN L859 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__D~0#1| (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 129.0)) (.cse2 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__Y~0#1| |ULTIMATE.start_main_~main__D~0#1|))) (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode |ULTIMATE.start_main_~main__D~0#1|)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 16.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode .cse2)) (.cse3 (fp.neg .cse1))) (or (not (fp.leq .cse0 .cse1)) (forall ((|v_ULTIMATE.start_main_~main__D~0#1_14| (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~main__D~0#1_14|))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~main__D~0#1_14|)) .cse3) (not (fp.leq .cse4 .cse5)) (not (fp.geq .cse4 (_ +zero 11 53)))))) (not (fp.geq .cse6 (_ +zero 11 53))) (not (fp.leq .cse6 .cse5)) (not (fp.geq .cse0 .cse3)) (forall ((|ULTIMATE.start_main_~main__R~0#1| (_ FloatingPoint 8 24))) (not (fp.leq |ULTIMATE.start_main_~main__R~0#1| (fp.neg |ULTIMATE.start_main_~main__D~0#1|)))))))) is different from true [2022-11-25 22:31:44,691 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~main__D~0#1_14| (_ FloatingPoint 8 24)) (|ULTIMATE.start_main_~main__R~0#1| (_ FloatingPoint 8 24)) (|ULTIMATE.start_main_~main__D~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |ULTIMATE.start_main_~main__D~0#1|)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 16.0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~main__D~0#1_14|))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__D~0#1|) |v_ULTIMATE.start_main_~main__D~0#1_14|)) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 129.0))) (not (fp.leq .cse1 .cse2)) (not (fp.leq .cse0 .cse2)) (not (fp.geq .cse1 (_ +zero 11 53))) (not (fp.leq |ULTIMATE.start_main_~main__R~0#1| (fp.neg |ULTIMATE.start_main_~main__D~0#1|)))))) is different from false [2022-11-25 22:31:46,715 WARN L859 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~main__D~0#1_14| (_ FloatingPoint 8 24)) (|ULTIMATE.start_main_~main__R~0#1| (_ FloatingPoint 8 24)) (|ULTIMATE.start_main_~main__D~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |ULTIMATE.start_main_~main__D~0#1|)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 16.0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~main__D~0#1_14|))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__D~0#1|) |v_ULTIMATE.start_main_~main__D~0#1_14|)) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 129.0))) (not (fp.leq .cse1 .cse2)) (not (fp.leq .cse0 .cse2)) (not (fp.geq .cse1 (_ +zero 11 53))) (not (fp.leq |ULTIMATE.start_main_~main__R~0#1| (fp.neg |ULTIMATE.start_main_~main__D~0#1|)))))) is different from true [2022-11-25 22:31:46,716 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-11-25 22:31:46,717 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:31:46,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [292908629] [2022-11-25 22:31:46,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [292908629] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:31:46,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1900906016] [2022-11-25 22:31:46,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:31:46,718 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:31:46,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:31:46,719 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:31:46,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f2cb7-97a0-4221-9d17-72cd93a1d2da/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2022-11-25 22:31:47,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:31:47,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 22:31:47,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:33:29,553 WARN L837 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__R~0#1| (_ FloatingPoint 8 24)) (|ULTIMATE.start_main_~main__D~0#1| (_ FloatingPoint 8 24)) (|v_ULTIMATE.start_main_~main__D~0#1_12| (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 16.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven |v_ULTIMATE.start_main_~main__D~0#1_12|)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~main__D~0#1|))) (and (fp.leq .cse0 .cse1) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)) |v_ULTIMATE.start_main_~main__D~0#1_12|) |ULTIMATE.start_main_~main__D~0#1|)) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 129.0)))) (fp.leq |ULTIMATE.start_main_~main__R~0#1| (fp.neg |v_ULTIMATE.start_main_~main__D~0#1_12|)) (fp.leq .cse2 .cse1) (fp.geq .cse0 (_ +zero 11 53)) (fp.geq .cse2 (_ +zero 11 53))))) is different from false [2022-11-25 22:33:31,573 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__R~0#1| (_ FloatingPoint 8 24)) (|ULTIMATE.start_main_~main__D~0#1| (_ FloatingPoint 8 24)) (|v_ULTIMATE.start_main_~main__D~0#1_12| (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 16.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven |v_ULTIMATE.start_main_~main__D~0#1_12|)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~main__D~0#1|))) (and (fp.leq .cse0 .cse1) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)) |v_ULTIMATE.start_main_~main__D~0#1_12|) |ULTIMATE.start_main_~main__D~0#1|)) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 129.0)))) (fp.leq |ULTIMATE.start_main_~main__R~0#1| (fp.neg |v_ULTIMATE.start_main_~main__D~0#1_12|)) (fp.leq .cse2 .cse1) (fp.geq .cse0 (_ +zero 11 53)) (fp.geq .cse2 (_ +zero 11 53))))) is different from true [2022-11-25 22:34:44,746 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 2 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-25 22:34:44,746 INFO L328 TraceCheckSpWp]: Computing backward predicates...