./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 54d39a6a3598707eb000bd324eee861653a2a39c1655837786308f3da9918a18 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 17:11:19,444 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 17:11:19,446 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 17:11:19,458 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 17:11:19,458 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 17:11:19,459 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 17:11:19,460 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 17:11:19,461 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 17:11:19,462 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 17:11:19,462 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 17:11:19,463 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 17:11:19,463 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 17:11:19,464 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 17:11:19,464 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 17:11:19,465 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 17:11:19,466 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 17:11:19,466 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 17:11:19,467 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 17:11:19,468 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 17:11:19,469 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 17:11:19,470 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 17:11:19,472 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 17:11:19,473 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 17:11:19,474 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 17:11:19,477 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 17:11:19,477 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 17:11:19,477 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 17:11:19,478 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 17:11:19,478 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 17:11:19,479 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 17:11:19,479 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 17:11:19,479 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 17:11:19,480 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 17:11:19,480 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 17:11:19,481 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 17:11:19,481 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 17:11:19,481 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 17:11:19,481 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 17:11:19,482 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 17:11:19,482 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 17:11:19,482 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 17:11:19,483 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 17:11:19,496 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 17:11:19,497 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 17:11:19,497 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 17:11:19,497 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 17:11:19,497 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 17:11:19,497 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 17:11:19,498 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 17:11:19,498 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 17:11:19,498 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 17:11:19,498 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 17:11:19,498 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 17:11:19,498 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 17:11:19,498 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 17:11:19,499 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 17:11:19,499 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 17:11:19,499 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 17:11:19,499 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 17:11:19,499 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 17:11:19,499 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 17:11:19,499 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 17:11:19,499 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 17:11:19,499 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 17:11:19,499 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 17:11:19,500 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 17:11:19,500 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 17:11:19,500 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 17:11:19,500 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 17:11:19,500 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 17:11:19,500 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 17:11:19,500 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 17:11:19,500 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 17:11:19,500 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 17:11:19,500 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 17:11:19,500 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 17:11:19,501 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 17:11:19,501 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/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_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 54d39a6a3598707eb000bd324eee861653a2a39c1655837786308f3da9918a18 [2022-12-13 17:11:19,684 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 17:11:19,705 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 17:11:19,707 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 17:11:19,708 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 17:11:19,709 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 17:11:19,710 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c.p+cfa-reducer.c [2022-12-13 17:11:22,294 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 17:11:22,419 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 17:11:22,420 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c.p+cfa-reducer.c [2022-12-13 17:11:22,424 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/data/cf1258307/d2c023354c5e4674be984aaf9bd4ed2c/FLAG8027a7aec [2022-12-13 17:11:22,437 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/data/cf1258307/d2c023354c5e4674be984aaf9bd4ed2c [2022-12-13 17:11:22,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 17:11:22,441 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 17:11:22,442 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 17:11:22,442 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 17:11:22,445 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 17:11:22,446 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:11:22" (1/1) ... [2022-12-13 17:11:22,447 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@162c3c29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:11:22, skipping insertion in model container [2022-12-13 17:11:22,447 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:11:22" (1/1) ... [2022-12-13 17:11:22,452 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 17:11:22,467 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 17:11:22,599 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_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c.p+cfa-reducer.c[2369,2382] [2022-12-13 17:11:22,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 17:11:22,615 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 17:11:22,631 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_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c.p+cfa-reducer.c[2369,2382] [2022-12-13 17:11:22,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 17:11:22,646 INFO L208 MainTranslator]: Completed translation [2022-12-13 17:11:22,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:11:22 WrapperNode [2022-12-13 17:11:22,646 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 17:11:22,647 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 17:11:22,647 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 17:11:22,647 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 17:11:22,653 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:11:22" (1/1) ... [2022-12-13 17:11:22,658 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:11:22" (1/1) ... [2022-12-13 17:11:22,671 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 92 [2022-12-13 17:11:22,671 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 17:11:22,672 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 17:11:22,672 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 17:11:22,672 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 17:11:22,678 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:11:22" (1/1) ... [2022-12-13 17:11:22,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:11:22" (1/1) ... [2022-12-13 17:11:22,679 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:11:22" (1/1) ... [2022-12-13 17:11:22,679 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:11:22" (1/1) ... [2022-12-13 17:11:22,682 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:11:22" (1/1) ... [2022-12-13 17:11:22,683 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:11:22" (1/1) ... [2022-12-13 17:11:22,684 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:11:22" (1/1) ... [2022-12-13 17:11:22,685 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:11:22" (1/1) ... [2022-12-13 17:11:22,686 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 17:11:22,686 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 17:11:22,686 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 17:11:22,686 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 17:11:22,687 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:11:22" (1/1) ... [2022-12-13 17:11:22,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 17:11:22,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:11:22,709 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 17:11:22,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 17:11:22,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 17:11:22,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 17:11:22,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 17:11:22,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 17:11:22,791 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 17:11:22,792 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 17:11:22,881 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 17:11:22,886 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 17:11:22,886 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 17:11:22,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:11:22 BoogieIcfgContainer [2022-12-13 17:11:22,888 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 17:11:22,890 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 17:11:22,891 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 17:11:22,894 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 17:11:22,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 05:11:22" (1/3) ... [2022-12-13 17:11:22,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25456abb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:11:22, skipping insertion in model container [2022-12-13 17:11:22,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:11:22" (2/3) ... [2022-12-13 17:11:22,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25456abb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:11:22, skipping insertion in model container [2022-12-13 17:11:22,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:11:22" (3/3) ... [2022-12-13 17:11:22,896 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant.c.p+cfa-reducer.c [2022-12-13 17:11:22,914 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 17:11:22,914 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 17:11:22,964 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 17:11:22,970 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2750623b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 17:11:22,971 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 17:11:22,975 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:11:22,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-13 17:11:22,983 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:11:22,984 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:11:22,984 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:11:22,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:11:22,988 INFO L85 PathProgramCache]: Analyzing trace with hash -2001896247, now seen corresponding path program 1 times [2022-12-13 17:11:22,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:11:22,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030078200] [2022-12-13 17:11:22,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:11:22,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:11:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:11:23,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-12-13 17:11:23,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:11:23,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030078200] [2022-12-13 17:11:23,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030078200] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:11:23,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:11:23,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:11:23,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518452457] [2022-12-13 17:11:23,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:11:23,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 17:11:23,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:11:23,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 17:11:23,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:11:23,197 INFO L87 Difference]: Start difference. First operand has 24 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:11:23,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:11:23,246 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-12-13 17:11:23,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 17:11:23,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-12-13 17:11:23,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:11:23,253 INFO L225 Difference]: With dead ends: 51 [2022-12-13 17:11:23,254 INFO L226 Difference]: Without dead ends: 40 [2022-12-13 17:11:23,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-12-13 17:11:23,258 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 49 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 114 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-12-13 17:11:23,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 114 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:11:23,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-12-13 17:11:23,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 23. [2022-12-13 17:11:23,280 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-12-13 17:11:23,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2022-12-13 17:11:23,281 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 14 [2022-12-13 17:11:23,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:11:23,282 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2022-12-13 17:11:23,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:11:23,282 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-12-13 17:11:23,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-13 17:11:23,283 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:11:23,283 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:11:23,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 17:11:23,283 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:11:23,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:11:23,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1984885586, now seen corresponding path program 1 times [2022-12-13 17:11:23,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:11:23,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861374598] [2022-12-13 17:11:23,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:11:23,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:11:23,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:11:23,296 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:11:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:11:23,315 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:11:23,316 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 17:11:23,317 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-13 17:11:23,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 17:11:23,321 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2022-12-13 17:11:23,324 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 17:11:23,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 05:11:23 BoogieIcfgContainer [2022-12-13 17:11:23,340 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 17:11:23,340 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 17:11:23,340 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 17:11:23,341 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 17:11:23,341 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:11:22" (3/4) ... [2022-12-13 17:11:23,343 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 17:11:23,343 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 17:11:23,344 INFO L158 Benchmark]: Toolchain (without parser) took 903.45ms. Allocated memory is still 121.6MB. Free memory was 82.6MB in the beginning and 74.9MB in the end (delta: 7.7MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2022-12-13 17:11:23,344 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 121.6MB. Free memory is still 94.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 17:11:23,345 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.89ms. Allocated memory is still 121.6MB. Free memory was 82.6MB in the beginning and 71.4MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 17:11:23,345 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.02ms. Allocated memory is still 121.6MB. Free memory was 71.4MB in the beginning and 70.1MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 17:11:23,345 INFO L158 Benchmark]: Boogie Preprocessor took 14.14ms. Allocated memory is still 121.6MB. Free memory was 70.1MB in the beginning and 68.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 17:11:23,346 INFO L158 Benchmark]: RCFGBuilder took 201.54ms. Allocated memory is still 121.6MB. Free memory was 68.7MB in the beginning and 58.4MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 17:11:23,346 INFO L158 Benchmark]: TraceAbstraction took 449.42ms. Allocated memory is still 121.6MB. Free memory was 57.9MB in the beginning and 75.4MB in the end (delta: -17.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 17:11:23,346 INFO L158 Benchmark]: Witness Printer took 3.27ms. Allocated memory is still 121.6MB. Free memory is still 74.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 17:11:23,348 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.19ms. Allocated memory is still 121.6MB. Free memory is still 94.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 204.89ms. Allocated memory is still 121.6MB. Free memory was 82.6MB in the beginning and 71.4MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.02ms. Allocated memory is still 121.6MB. Free memory was 71.4MB in the beginning and 70.1MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 14.14ms. Allocated memory is still 121.6MB. Free memory was 70.1MB in the beginning and 68.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 201.54ms. Allocated memory is still 121.6MB. Free memory was 68.7MB in the beginning and 58.4MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 449.42ms. Allocated memory is still 121.6MB. Free memory was 57.9MB in the beginning and 75.4MB in the end (delta: -17.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.27ms. Allocated memory is still 121.6MB. Free memory is still 74.9MB. 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: 101]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 88, overapproximation of someBinaryArithmeticDOUBLEoperation at line 85, overapproximation of someUnaryDOUBLEoperation at line 42. Possible FailurePath: [L1] int __return_main; [L11] double _EPS = 0.0000010; [L14] double __return_125; VAL [__return_125=0, __return_main=0, _EPS=1/1000000] [L17] double main__d; [L18] double main__r; [L19] main__d = 1.0 VAL [__return_125=0, __return_main=0, _EPS=1/1000000, main__d=1] [L21] COND TRUE main__d <= 20.0 [L24] double __tmp_1; [L25] __tmp_1 = main__d [L26] double SqrtR__Input; [L27] SqrtR__Input = __tmp_1 [L28] double SqrtR__xn; [L29] double SqrtR__xnp1; [L30] double SqrtR__residu; [L31] double SqrtR__lsup; [L32] double SqrtR__linf; [L33] int SqrtR__i; [L34] int SqrtR__cond; VAL [__return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR__Input=1] [L35] COND FALSE !(SqrtR__Input <= 1.0) [L139] SqrtR__xn = 1.0 / SqrtR__Input VAL [__return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR__Input=1] [L39] SqrtR__xnp1 = SqrtR__xn [L40] SqrtR__residu = (2.0 * _EPS) * (SqrtR__xn + SqrtR__xnp1) [L41] SqrtR__lsup = _EPS * (SqrtR__xn + SqrtR__xnp1) [L42] SqrtR__linf = -SqrtR__lsup [L43] int SqrtR____CPAchecker_TMP_0; VAL [__return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR__Input=1, SqrtR__xn=54, SqrtR__xnp1=54] [L44] COND FALSE !(SqrtR__residu > SqrtR__lsup) VAL [__return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR__Input=1, SqrtR__xn=54, SqrtR__xnp1=54] [L126] COND FALSE !(SqrtR__residu < SqrtR__linf) [L132] SqrtR____CPAchecker_TMP_0 = 0 VAL [__return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR____CPAchecker_TMP_0=0, SqrtR__Input=1, SqrtR__xn=54, SqrtR__xnp1=54] [L49] SqrtR__cond = SqrtR____CPAchecker_TMP_0 [L50] SqrtR__i = 0 VAL [__return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=54, SqrtR__xnp1=54] [L52] COND FALSE !(!(SqrtR__cond == 0)) [L85] __return_125 = 1.0 / SqrtR__xnp1 [L86] main__r = __return_125 [L87] int main____CPAchecker_TMP_0; VAL [__return_125=53, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, main__r=53, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=54, SqrtR__xnp1=54] [L88] COND FALSE !(main__r >= 1.0) VAL [__return_125=53, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, main__r=53, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=54, SqrtR__xnp1=54] [L114] main____CPAchecker_TMP_0 = 0 VAL [__return_125=53, __return_main=0, __tmp_1=1, _EPS=1/1000000, main____CPAchecker_TMP_0=0, main__d=1, main__r=53, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=54, SqrtR__xnp1=54] [L95] int __tmp_2; [L96] __tmp_2 = main____CPAchecker_TMP_0 [L97] int __VERIFIER_assert__cond; [L98] __VERIFIER_assert__cond = __tmp_2 VAL [__return_125=53, __return_main=0, __tmp_1=1, __tmp_2=0, __VERIFIER_assert__cond=0, _EPS=1/1000000, main____CPAchecker_TMP_0=0, main__d=1, main__r=53, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=54, SqrtR__xnp1=54] [L99] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_125=53, __return_main=0, __tmp_1=1, __tmp_2=0, __VERIFIER_assert__cond=0, _EPS=1/1000000, main____CPAchecker_TMP_0=0, main__d=1, main__r=53, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=54, SqrtR__xnp1=54] [L101] reach_error() VAL [__return_125=53, __return_main=0, __tmp_1=1, __tmp_2=0, __VERIFIER_assert__cond=0, _EPS=1/1000000, main____CPAchecker_TMP_0=0, main__d=1, main__r=53, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=54, SqrtR__xnp1=54] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 49 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 49 mSDsluCounter, 114 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 58 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15 IncrementalHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 56 mSDtfsCounter, 15 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=0, InterpolantAutomatonStates: 5, 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, 17 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 13 ConstructedInterpolants, 0 QuantifiedInterpolants, 17 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-12-13 17:11:23,363 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 54d39a6a3598707eb000bd324eee861653a2a39c1655837786308f3da9918a18 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 17:11:25,029 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 17:11:25,031 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 17:11:25,057 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 17:11:25,057 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 17:11:25,059 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 17:11:25,061 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 17:11:25,064 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 17:11:25,067 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 17:11:25,068 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 17:11:25,069 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 17:11:25,071 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 17:11:25,072 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 17:11:25,073 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 17:11:25,075 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 17:11:25,077 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 17:11:25,078 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 17:11:25,079 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 17:11:25,082 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 17:11:25,085 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 17:11:25,088 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 17:11:25,089 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 17:11:25,091 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 17:11:25,092 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 17:11:25,099 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 17:11:25,100 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 17:11:25,100 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 17:11:25,102 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 17:11:25,102 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 17:11:25,104 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 17:11:25,104 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 17:11:25,105 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 17:11:25,106 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 17:11:25,107 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 17:11:25,108 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 17:11:25,109 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 17:11:25,109 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 17:11:25,109 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 17:11:25,110 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 17:11:25,111 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 17:11:25,111 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 17:11:25,112 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-12-13 17:11:25,134 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 17:11:25,134 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 17:11:25,134 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 17:11:25,135 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 17:11:25,135 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 17:11:25,136 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 17:11:25,136 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 17:11:25,136 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 17:11:25,137 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 17:11:25,137 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 17:11:25,137 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 17:11:25,137 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 17:11:25,137 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 17:11:25,138 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 17:11:25,138 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 17:11:25,138 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 17:11:25,138 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 17:11:25,138 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 17:11:25,139 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 17:11:25,139 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 17:11:25,139 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 17:11:25,139 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 17:11:25,139 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 17:11:25,139 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 17:11:25,140 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 17:11:25,140 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 17:11:25,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 17:11:25,140 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 17:11:25,141 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 17:11:25,141 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 17:11:25,141 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 17:11:25,146 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 17:11:25,147 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 17:11:25,147 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 17:11:25,147 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 17:11:25,147 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 17:11:25,147 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 17:11:25,147 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 17:11:25,148 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/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_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 54d39a6a3598707eb000bd324eee861653a2a39c1655837786308f3da9918a18 [2022-12-13 17:11:25,379 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 17:11:25,394 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 17:11:25,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 17:11:25,396 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 17:11:25,396 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 17:11:25,397 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c.p+cfa-reducer.c [2022-12-13 17:11:27,913 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 17:11:28,061 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 17:11:28,062 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c.p+cfa-reducer.c [2022-12-13 17:11:28,067 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/data/8a971efeb/5968dd2879d741538371028022365c38/FLAG9cb17adcb [2022-12-13 17:11:28,469 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/data/8a971efeb/5968dd2879d741538371028022365c38 [2022-12-13 17:11:28,471 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 17:11:28,472 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 17:11:28,473 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 17:11:28,473 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 17:11:28,476 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 17:11:28,476 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:11:28" (1/1) ... [2022-12-13 17:11:28,477 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5191b11d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:11:28, skipping insertion in model container [2022-12-13 17:11:28,477 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:11:28" (1/1) ... [2022-12-13 17:11:28,482 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 17:11:28,497 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 17:11:28,618 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_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c.p+cfa-reducer.c[2369,2382] [2022-12-13 17:11:28,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 17:11:28,638 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 17:11:28,655 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_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c.p+cfa-reducer.c[2369,2382] [2022-12-13 17:11:28,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 17:11:28,670 INFO L208 MainTranslator]: Completed translation [2022-12-13 17:11:28,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:11:28 WrapperNode [2022-12-13 17:11:28,671 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 17:11:28,672 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 17:11:28,672 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 17:11:28,672 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 17:11:28,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:11:28" (1/1) ... [2022-12-13 17:11:28,685 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:11:28" (1/1) ... [2022-12-13 17:11:28,702 INFO L138 Inliner]: procedures = 16, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 93 [2022-12-13 17:11:28,703 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 17:11:28,703 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 17:11:28,703 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 17:11:28,704 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 17:11:28,710 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:11:28" (1/1) ... [2022-12-13 17:11:28,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:11:28" (1/1) ... [2022-12-13 17:11:28,713 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:11:28" (1/1) ... [2022-12-13 17:11:28,713 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:11:28" (1/1) ... [2022-12-13 17:11:28,719 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:11:28" (1/1) ... [2022-12-13 17:11:28,721 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:11:28" (1/1) ... [2022-12-13 17:11:28,722 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:11:28" (1/1) ... [2022-12-13 17:11:28,723 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:11:28" (1/1) ... [2022-12-13 17:11:28,725 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 17:11:28,729 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 17:11:28,729 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 17:11:28,730 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 17:11:28,730 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:11:28" (1/1) ... [2022-12-13 17:11:28,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 17:11:28,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:11:28,761 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 17:11:28,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 17:11:28,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 17:11:28,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-13 17:11:28,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 17:11:28,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 17:11:28,846 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 17:11:28,848 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 17:11:38,110 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 17:11:38,117 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 17:11:38,117 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 17:11:38,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:11:38 BoogieIcfgContainer [2022-12-13 17:11:38,119 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 17:11:38,121 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 17:11:38,121 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 17:11:38,124 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 17:11:38,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 05:11:28" (1/3) ... [2022-12-13 17:11:38,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9c2817e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:11:38, skipping insertion in model container [2022-12-13 17:11:38,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:11:28" (2/3) ... [2022-12-13 17:11:38,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9c2817e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:11:38, skipping insertion in model container [2022-12-13 17:11:38,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:11:38" (3/3) ... [2022-12-13 17:11:38,126 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant.c.p+cfa-reducer.c [2022-12-13 17:11:38,142 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 17:11:38,142 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 17:11:38,176 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 17:11:38,181 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@dd3908d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 17:11:38,181 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 17:11:38,184 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:11:38,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-13 17:11:38,188 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:11:38,189 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:11:38,189 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:11:38,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:11:38,193 INFO L85 PathProgramCache]: Analyzing trace with hash -2001896247, now seen corresponding path program 1 times [2022-12-13 17:11:38,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 17:11:38,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [70103440] [2022-12-13 17:11:38,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:11:38,203 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 17:11:38,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 17:11:38,204 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 17:11:38,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-12-13 17:11:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:11:40,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 17:11:40,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:11:40,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:11:40,377 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:11:40,378 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 17:11:40,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [70103440] [2022-12-13 17:11:40,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [70103440] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:11:40,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:11:40,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:11:40,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723771021] [2022-12-13 17:11:40,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:11:40,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 17:11:40,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 17:11:40,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 17:11:40,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:11:40,408 INFO L87 Difference]: Start difference. First operand has 24 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:11:42,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:11:45,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.71s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:11:46,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:11:49,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.40s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:11:51,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:11:55,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:11:57,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:11:59,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:12:01,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:12:01,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:12:01,739 INFO L93 Difference]: Finished difference Result 49 states and 69 transitions. [2022-12-13 17:12:01,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 17:12:01,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-12-13 17:12:01,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:12:01,821 INFO L225 Difference]: With dead ends: 49 [2022-12-13 17:12:01,821 INFO L226 Difference]: Without dead ends: 24 [2022-12-13 17:12:01,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:12:01,825 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 3 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.2s IncrementalHoareTripleChecker+Time [2022-12-13 17:12:01,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 66 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 8 Unknown, 0 Unchecked, 21.2s Time] [2022-12-13 17:12:01,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-12-13 17:12:01,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2022-12-13 17:12:01,846 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-12-13 17:12:01,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2022-12-13 17:12:01,848 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 14 [2022-12-13 17:12:01,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:12:01,848 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2022-12-13 17:12:01,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:12:01,848 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-12-13 17:12:01,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-13 17:12:01,848 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:12:01,849 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:12:01,887 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-12-13 17:12:02,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 17:12:02,051 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:12:02,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:12:02,053 INFO L85 PathProgramCache]: Analyzing trace with hash 939018830, now seen corresponding path program 1 times [2022-12-13 17:12:02,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 17:12:02,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [760599124] [2022-12-13 17:12:02,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:12:02,056 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 17:12:02,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 17:12:02,060 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 17:12:02,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-12-13 17:12:03,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:03,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 17:12:03,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:12:04,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:12:04,158 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:12:04,159 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 17:12:04,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [760599124] [2022-12-13 17:12:04,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [760599124] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:12:04,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:12:04,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:12:04,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444892912] [2022-12-13 17:12:04,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:12:04,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:12:04,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 17:12:04,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:12:04,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:12:04,162 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:12:06,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:12:09,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:12:12,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:12:14,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:12:17,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:12:20,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:12:22,931 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 [] [2022-12-13 17:12:25,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.67s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:12:26,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:12:26,286 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2022-12-13 17:12:26,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 17:12:26,288 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-12-13 17:12:26,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:12:26,289 INFO L225 Difference]: With dead ends: 55 [2022-12-13 17:12:26,289 INFO L226 Difference]: Without dead ends: 36 [2022-12-13 17:12:26,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:12:26,290 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 13 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:12:26,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 56 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 8 Unknown, 0 Unchecked, 22.1s Time] [2022-12-13 17:12:26,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-12-13 17:12:26,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 25. [2022-12-13 17:12:26,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:12:26,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2022-12-13 17:12:26,296 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 14 [2022-12-13 17:12:26,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:12:26,296 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-12-13 17:12:26,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:12:26,296 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-12-13 17:12:26,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-13 17:12:26,297 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:12:26,297 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:12:26,329 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 17:12:26,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 17:12:26,499 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:12:26,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:12:26,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1251138159, now seen corresponding path program 1 times [2022-12-13 17:12:26,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 17:12:26,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [30148510] [2022-12-13 17:12:26,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:12:26,503 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 17:12:26,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 17:12:26,506 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 17:12:26,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-12-13 17:12:27,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:27,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 17:12:27,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:12:28,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:12:28,047 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:12:28,047 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 17:12:28,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [30148510] [2022-12-13 17:12:28,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [30148510] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:12:28,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:12:28,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:12:28,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334495673] [2022-12-13 17:12:28,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:12:28,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 17:12:28,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 17:12:28,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 17:12:28,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:12:28,051 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:12:30,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:12:33,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:12:36,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:12:36,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:12:36,842 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2022-12-13 17:12:36,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 17:12:36,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-12-13 17:12:36,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:12:36,844 INFO L225 Difference]: With dead ends: 46 [2022-12-13 17:12:36,844 INFO L226 Difference]: Without dead ends: 27 [2022-12-13 17:12:36,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:12:36,846 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-12-13 17:12:36,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 73 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 3 Unknown, 0 Unchecked, 8.7s Time] [2022-12-13 17:12:36,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-12-13 17:12:36,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-12-13 17:12:36,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 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-12-13 17:12:36,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2022-12-13 17:12:36,853 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 14 [2022-12-13 17:12:36,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:12:36,853 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-12-13 17:12:36,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:12:36,854 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-12-13 17:12:36,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-13 17:12:36,854 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:12:36,854 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:12:36,885 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 17:12:37,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 17:12:37,057 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:12:37,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:12:37,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1124243894, now seen corresponding path program 1 times [2022-12-13 17:12:37,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 17:12:37,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1434860501] [2022-12-13 17:12:37,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:12:37,062 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 17:12:37,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 17:12:37,063 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 17:12:37,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-12-13 17:12:39,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:40,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 17:12:40,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:12:42,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:12:42,020 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:12:42,021 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 17:12:42,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1434860501] [2022-12-13 17:12:42,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1434860501] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:12:42,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:12:42,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 17:12:42,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401098899] [2022-12-13 17:12:42,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:12:42,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:12:42,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 17:12:42,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:12:42,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:12:42,023 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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-12-13 17:12:44,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:12:46,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:12:50,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:12:52,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:12:55,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:12:58,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:13:02,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:13:04,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:13:06,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:13:07,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:13:07,438 INFO L93 Difference]: Finished difference Result 56 states and 75 transitions. [2022-12-13 17:13:07,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 17:13:07,440 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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-12-13 17:13:07,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:13:07,441 INFO L225 Difference]: With dead ends: 56 [2022-12-13 17:13:07,441 INFO L226 Difference]: Without dead ends: 35 [2022-12-13 17:13:07,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-12-13 17:13:07,443 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 23 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.2s IncrementalHoareTripleChecker+Time [2022-12-13 17:13:07,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 70 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 9 Unknown, 0 Unchecked, 24.2s Time] [2022-12-13 17:13:07,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-12-13 17:13:07,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2022-12-13 17:13:07,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3) internal successors, (39), 30 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-12-13 17:13:07,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2022-12-13 17:13:07,452 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 18 [2022-12-13 17:13:07,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:13:07,452 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-12-13 17:13:07,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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-12-13 17:13:07,453 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-12-13 17:13:07,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-13 17:13:07,453 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:13:07,454 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:13:07,516 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-12-13 17:13:07,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 17:13:07,656 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:13:07,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:13:07,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1669842835, now seen corresponding path program 1 times [2022-12-13 17:13:07,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 17:13:07,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1034826577] [2022-12-13 17:13:07,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:13:07,660 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 17:13:07,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 17:13:07,663 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 17:13:07,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/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-12-13 17:13:10,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:13:10,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 17:13:10,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:13:10,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 17:13:10,959 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:13:10,960 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 17:13:10,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1034826577] [2022-12-13 17:13:10,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1034826577] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:13:10,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:13:10,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:13:10,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199493750] [2022-12-13 17:13:10,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:13:10,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 17:13:10,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 17:13:10,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 17:13:10,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:13:10,962 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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-12-13 17:13:13,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.59s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:13:17,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:13:17,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:13:17,382 INFO L93 Difference]: Finished difference Result 54 states and 70 transitions. [2022-12-13 17:13:17,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 17:13:17,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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-12-13 17:13:17,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:13:17,385 INFO L225 Difference]: With dead ends: 54 [2022-12-13 17:13:17,385 INFO L226 Difference]: Without dead ends: 52 [2022-12-13 17:13:17,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:13:17,386 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 43 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-12-13 17:13:17,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 98 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 1 Unknown, 0 Unchecked, 6.3s Time] [2022-12-13 17:13:17,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-12-13 17:13:17,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 33. [2022-12-13 17:13:17,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.28125) internal successors, (41), 32 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-12-13 17:13:17,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2022-12-13 17:13:17,395 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 18 [2022-12-13 17:13:17,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:13:17,395 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2022-12-13 17:13:17,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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-12-13 17:13:17,395 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-12-13 17:13:17,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-13 17:13:17,396 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:13:17,396 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:13:17,466 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 17:13:17,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 17:13:17,597 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:13:17,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:13:17,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1686853496, now seen corresponding path program 1 times [2022-12-13 17:13:17,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 17:13:17,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1679966757] [2022-12-13 17:13:17,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:13:17,600 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 17:13:17,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 17:13:17,603 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 17:13:17,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/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-12-13 17:13:20,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:13:20,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 17:13:20,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:13:39,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:13:39,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:13:45,736 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.geq (fp.div c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~SqrtR__xnp1~0#1|) .cse0)) is different from false [2022-12-13 17:13:47,955 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.geq (fp.div c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~SqrtR__xnp1~0#1|) .cse0)) is different from true [2022-12-13 17:14:03,622 WARN L233 SmtUtils]: Spent 5.11s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 17:14:06,184 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.geq (fp.div c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~SqrtR__xn~0#1| (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~SqrtR__Input~0#1| |c_ULTIMATE.start_main_~SqrtR__xn~0#1|) |c_ULTIMATE.start_main_~SqrtR__xn~0#1|) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~SqrtR__Input~0#1|) |c_ULTIMATE.start_main_~SqrtR__xn~0#1|) |c_ULTIMATE.start_main_~SqrtR__xn~0#1|))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))) .cse0)) is different from false [2022-12-13 17:14:08,751 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.geq (fp.div c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~SqrtR__xn~0#1| (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~SqrtR__Input~0#1| |c_ULTIMATE.start_main_~SqrtR__xn~0#1|) |c_ULTIMATE.start_main_~SqrtR__xn~0#1|) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~SqrtR__Input~0#1|) |c_ULTIMATE.start_main_~SqrtR__xn~0#1|) |c_ULTIMATE.start_main_~SqrtR__xn~0#1|))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))) .cse0)) is different from true [2022-12-13 17:14:13,869 WARN L233 SmtUtils]: Spent 5.12s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 17:14:19,005 WARN L233 SmtUtils]: Spent 5.13s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 17:14:24,137 WARN L233 SmtUtils]: Spent 5.13s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 17:14:29,287 WARN L233 SmtUtils]: Spent 5.15s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 17:14:36,524 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.geq (fp.div c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~SqrtR__Input~0#1| .cse0) .cse0) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~SqrtR__Input~0#1|) .cse0) .cse0))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))) .cse0)) is different from false [2022-12-13 17:14:38,920 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.geq (fp.div c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~SqrtR__Input~0#1| .cse0) .cse0) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~SqrtR__Input~0#1|) .cse0) .cse0))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))) .cse0)) is different from true [2022-12-13 17:14:46,129 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.geq (fp.div c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~main__d~0#1| .cse0) .cse0) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~main__d~0#1|) .cse0) .cse0))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))) .cse0)) is different from false [2022-12-13 17:14:48,542 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.geq (fp.div c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~main__d~0#1| .cse0) .cse0) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~main__d~0#1|) .cse0) .cse0))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))) .cse0)) is different from true [2022-12-13 17:14:48,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-13 17:14:48,557 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 17:14:48,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1679966757] [2022-12-13 17:14:48,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1679966757] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:14:48,558 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:14:48,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2022-12-13 17:14:48,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969901668] [2022-12-13 17:14:48,558 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:14:48,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 17:14:48,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 17:14:48,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 17:14:48,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=44, Unknown=14, NotChecked=68, Total=156 [2022-12-13 17:14:48,559 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 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-12-13 17:14:50,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:14:53,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:14:56,168 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq (fp.div c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~main__d~0#1| .cse0) .cse0) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~main__d~0#1|) .cse0) .cse0))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))) .cse0) (= |c_ULTIMATE.start_main_~main__d~0#1| .cse0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-12-13 17:14:58,747 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= |c_ULTIMATE.start_main_~SqrtR__Input~0#1| .cse0) (fp.geq (fp.div c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~SqrtR__Input~0#1| .cse0) .cse0) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~SqrtR__Input~0#1|) .cse0) .cse0))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))) .cse0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-12-13 17:15:01,178 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= |c_ULTIMATE.start_main_~SqrtR__Input~0#1| .cse0) (fp.geq (fp.div c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~SqrtR__Input~0#1| .cse0) .cse0) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~SqrtR__Input~0#1|) .cse0) .cse0))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))) .cse0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-12-13 17:15:03,696 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq (fp.div c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~SqrtR__xn~0#1| (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~SqrtR__Input~0#1| |c_ULTIMATE.start_main_~SqrtR__xn~0#1|) |c_ULTIMATE.start_main_~SqrtR__xn~0#1|) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~SqrtR__Input~0#1|) |c_ULTIMATE.start_main_~SqrtR__xn~0#1|) |c_ULTIMATE.start_main_~SqrtR__xn~0#1|))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))) .cse0) (= |c_ULTIMATE.start_main_~SqrtR__Input~0#1| .cse0) (= |c_ULTIMATE.start_main_~SqrtR__xn~0#1| .cse0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-12-13 17:15:06,309 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq (fp.div c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~SqrtR__xn~0#1| (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~SqrtR__Input~0#1| |c_ULTIMATE.start_main_~SqrtR__xn~0#1|) |c_ULTIMATE.start_main_~SqrtR__xn~0#1|) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~SqrtR__Input~0#1|) |c_ULTIMATE.start_main_~SqrtR__xn~0#1|) |c_ULTIMATE.start_main_~SqrtR__xn~0#1|))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))) .cse0) (= |c_ULTIMATE.start_main_~SqrtR__Input~0#1| .cse0) (= |c_ULTIMATE.start_main_~SqrtR__xn~0#1| .cse0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-12-13 17:15:08,555 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq (fp.div c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~SqrtR__xnp1~0#1|) .cse0) (= (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse0) .cse0) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) .cse0) .cse0) .cse0))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)) |c_ULTIMATE.start_main_~SqrtR__xnp1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-12-13 17:15:11,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:15:13,262 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 [] [2022-12-13 17:15:15,279 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 [] [2022-12-13 17:15:17,312 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 [] [2022-12-13 17:15:20,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.42s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:15:22,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:15:24,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:15:26,770 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 [] [2022-12-13 17:15:31,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:15:35,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:15:38,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.84s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:15:40,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:15:42,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:15:44,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:15:44,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:15:44,295 INFO L93 Difference]: Finished difference Result 72 states and 94 transitions. [2022-12-13 17:15:44,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 17:15:44,375 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 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-12-13 17:15:44,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:15:44,377 INFO L225 Difference]: With dead ends: 72 [2022-12-13 17:15:44,377 INFO L226 Difference]: Without dead ends: 49 [2022-12-13 17:15:44,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 52.6s TimeCoverageRelationStatistics Valid=38, Invalid=46, Unknown=20, NotChecked=168, Total=272 [2022-12-13 17:15:44,380 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 13 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 170 IncrementalHoareTripleChecker+Unchecked, 40.3s IncrementalHoareTripleChecker+Time [2022-12-13 17:15:44,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 154 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 16 Unknown, 170 Unchecked, 40.3s Time] [2022-12-13 17:15:44,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-12-13 17:15:44,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 38. [2022-12-13 17:15:44,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:44,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2022-12-13 17:15:44,386 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 18 [2022-12-13 17:15:44,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:15:44,386 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions. [2022-12-13 17:15:44,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 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-12-13 17:15:44,386 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-12-13 17:15:44,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-13 17:15:44,387 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:15:44,387 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:15:44,451 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/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-12-13 17:15:44,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 17:15:44,589 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:15:44,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:15:44,590 INFO L85 PathProgramCache]: Analyzing trace with hash 885500251, now seen corresponding path program 1 times [2022-12-13 17:15:44,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 17:15:44,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1240219647] [2022-12-13 17:15:44,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:15:44,591 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 17:15:44,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 17:15:44,594 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 17:15:44,597 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/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-12-13 17:15:47,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:47,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 17:15:47,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:15:51,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:15:51,321 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:15:51,322 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 17:15:51,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1240219647] [2022-12-13 17:15:51,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1240219647] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:15:51,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:15:51,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 17:15:51,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746069844] [2022-12-13 17:15:51,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:15:51,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:15:51,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 17:15:51,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:15:51,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:15:51,325 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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-12-13 17:15:54,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:15:58,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:16:01,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:16:04,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.40s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:16:06,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:16:10,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.68s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:16:12,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:16:14,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:16:15,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:16:15,025 INFO L93 Difference]: Finished difference Result 64 states and 82 transitions. [2022-12-13 17:16:15,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 17:16:15,027 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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 19 [2022-12-13 17:16:15,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:16:15,027 INFO L225 Difference]: With dead ends: 64 [2022-12-13 17:16:15,027 INFO L226 Difference]: Without dead ends: 41 [2022-12-13 17:16:15,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-13 17:16:15,029 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.7s IncrementalHoareTripleChecker+Time [2022-12-13 17:16:15,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 58 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 8 Unknown, 0 Unchecked, 22.7s Time] [2022-12-13 17:16:15,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-12-13 17:16:15,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2022-12-13 17:16:15,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 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-12-13 17:16:15,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2022-12-13 17:16:15,035 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 19 [2022-12-13 17:16:15,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:16:15,036 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2022-12-13 17:16:15,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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-12-13 17:16:15,036 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-12-13 17:16:15,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 17:16:15,037 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:16:15,037 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:16:15,100 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 17:16:15,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 17:16:15,239 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:16:15,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:16:15,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1075575453, now seen corresponding path program 1 times [2022-12-13 17:16:15,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 17:16:15,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1711745479] [2022-12-13 17:16:15,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:16:15,242 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 17:16:15,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 17:16:15,244 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 17:16:15,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/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-12-13 17:16:19,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:16:20,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 17:16:20,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:16:20,468 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:16:20,469 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:16:20,469 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 17:16:20,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1711745479] [2022-12-13 17:16:20,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1711745479] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:16:20,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:16:20,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:16:20,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878942488] [2022-12-13 17:16:20,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:16:20,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 17:16:20,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 17:16:20,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 17:16:20,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:16:20,473 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:16:23,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:16:25,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:16:29,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:16:29,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:16:29,426 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2022-12-13 17:16:29,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 17:16:29,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-13 17:16:29,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:16:29,429 INFO L225 Difference]: With dead ends: 63 [2022-12-13 17:16:29,429 INFO L226 Difference]: Without dead ends: 40 [2022-12-13 17:16:29,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:16:29,431 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-12-13 17:16:29,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 73 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 3 Unknown, 0 Unchecked, 8.7s Time] [2022-12-13 17:16:29,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-12-13 17:16:29,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-12-13 17:16:29,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:16:29,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2022-12-13 17:16:29,441 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 22 [2022-12-13 17:16:29,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:16:29,442 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2022-12-13 17:16:29,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:16:29,442 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2022-12-13 17:16:29,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-13 17:16:29,443 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:16:29,443 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:16:29,536 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/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-12-13 17:16:29,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 17:16:29,644 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:16:29,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:16:29,645 INFO L85 PathProgramCache]: Analyzing trace with hash 13709678, now seen corresponding path program 1 times [2022-12-13 17:16:29,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 17:16:29,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1206322232] [2022-12-13 17:16:29,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:16:29,645 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 17:16:29,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 17:16:29,646 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 17:16:29,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/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-12-13 17:16:34,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:16:34,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 17:16:34,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:16:47,277 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 17:16:47,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:16:53,998 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~SqrtR__xn~0#1| |c_ULTIMATE.start_main_~SqrtR__xn~0#1|))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse0) (fp.mul c_currentRoundingMode c_~_EPS~0 .cse0))) is different from false [2022-12-13 17:16:56,084 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~SqrtR__xn~0#1| |c_ULTIMATE.start_main_~SqrtR__xn~0#1|))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse0) (fp.mul c_currentRoundingMode c_~_EPS~0 .cse0))) is different from true [2022-12-13 17:17:03,162 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) |c_ULTIMATE.start_main_~SqrtR__Input~0#1|))) (fp.add c_currentRoundingMode .cse1 .cse1)))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse0) (fp.mul c_currentRoundingMode c_~_EPS~0 .cse0))) is different from false [2022-12-13 17:17:05,502 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) |c_ULTIMATE.start_main_~SqrtR__Input~0#1|))) (fp.add c_currentRoundingMode .cse1 .cse1)))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse0) (fp.mul c_currentRoundingMode c_~_EPS~0 .cse0))) is different from true [2022-12-13 17:17:12,584 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) |c_ULTIMATE.start_main_~main__d~0#1|))) (fp.add c_currentRoundingMode .cse1 .cse1)))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse0) (fp.mul c_currentRoundingMode c_~_EPS~0 .cse0))) is different from false [2022-12-13 17:17:14,964 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) |c_ULTIMATE.start_main_~main__d~0#1|))) (fp.add c_currentRoundingMode .cse1 .cse1)))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse0) (fp.mul c_currentRoundingMode c_~_EPS~0 .cse0))) is different from true [2022-12-13 17:17:22,036 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__d~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode .cse1 .cse1)))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse0) (fp.mul c_currentRoundingMode c_~_EPS~0 .cse0))) is different from false [2022-12-13 17:17:24,418 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__d~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode .cse1 .cse1)))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse0) (fp.mul c_currentRoundingMode c_~_EPS~0 .cse0))) is different from true [2022-12-13 17:18:43,768 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2022-12-13 17:18:43,768 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 17:18:43,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1206322232] [2022-12-13 17:18:43,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1206322232] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:18:43,769 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:18:43,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2022-12-13 17:18:43,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049234183] [2022-12-13 17:18:43,769 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:18:43,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 17:18:43,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 17:18:43,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 17:18:43,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=60, Unknown=11, NotChecked=76, Total=182 [2022-12-13 17:18:43,770 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 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-12-13 17:18:45,957 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 [] [2022-12-13 17:18:48,735 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse0 (let ((.cse1 (fp.div c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__d~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode .cse1 .cse1)))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse0) (fp.mul c_currentRoundingMode c_~_EPS~0 .cse0))) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) c_~_EPS~0) (= |c_ULTIMATE.start_main_~main__d~0#1| .cse2) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-12-13 17:18:51,107 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse0 (let ((.cse1 (fp.div c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~main__d~0#1|))) (fp.add c_currentRoundingMode .cse1 .cse1)))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse0) (fp.mul c_currentRoundingMode c_~_EPS~0 .cse0))) (= |c_ULTIMATE.start_main_~main__d~0#1| (fp.add c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) c_~_EPS~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-12-13 17:18:53,480 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse0 (let ((.cse1 (fp.div c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~SqrtR__Input~0#1|))) (fp.add c_currentRoundingMode .cse1 .cse1)))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse0) (fp.mul c_currentRoundingMode c_~_EPS~0 .cse0))) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) c_~_EPS~0) (= |c_ULTIMATE.start_main_~SqrtR__Input~0#1| (fp.add c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-12-13 17:18:56,916 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~SqrtR__xn~0#1| (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.div c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse1 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~SqrtR__xn~0#1| |c_ULTIMATE.start_main_~SqrtR__xn~0#1|))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse1) (fp.mul c_currentRoundingMode c_~_EPS~0 .cse1))) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) c_~_EPS~0) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-12-13 17:18:59,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:19:01,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:19:03,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:19:05,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:19:07,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:19:09,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:19:11,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:19:13,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:19:16,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:19:18,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:19:21,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:19:23,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:19:27,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.61s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:19:29,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:19:31,317 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 [] [2022-12-13 17:19:33,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:19:35,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:19:37,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:19:39,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:19:41,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:19:45,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:19:48,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.72s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:19:50,625 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 [] [2022-12-13 17:19:52,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:19:54,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:19:56,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:19:59,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:20:00,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:20:05,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:20:07,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:20:09,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:20:11,466 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 [] [2022-12-13 17:20:13,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:20:15,503 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 [] [2022-12-13 17:20:17,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:20:19,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:20:19,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:20:19,804 INFO L93 Difference]: Finished difference Result 90 states and 111 transitions. [2022-12-13 17:20:19,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 17:20:19,833 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 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 29 [2022-12-13 17:20:19,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:20:19,833 INFO L225 Difference]: With dead ends: 90 [2022-12-13 17:20:19,834 INFO L226 Difference]: Without dead ends: 65 [2022-12-13 17:20:19,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 48.7s TimeCoverageRelationStatistics Valid=43, Invalid=64, Unknown=15, NotChecked=184, Total=306 [2022-12-13 17:20:19,835 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 20 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 33 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 82.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 33 IncrementalHoareTripleChecker+Unknown, 197 IncrementalHoareTripleChecker+Unchecked, 85.4s IncrementalHoareTripleChecker+Time [2022-12-13 17:20:19,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 92 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 33 Unknown, 197 Unchecked, 85.4s Time] [2022-12-13 17:20:19,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-12-13 17:20:19,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 46. [2022-12-13 17:20:19,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 45 states have internal predecessors, (55), 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-12-13 17:20:19,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2022-12-13 17:20:19,848 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 29 [2022-12-13 17:20:19,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:20:19,848 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2022-12-13 17:20:19,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 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-12-13 17:20:19,848 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2022-12-13 17:20:19,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-13 17:20:19,849 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:20:19,850 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:20:19,937 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 17:20:20,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 17:20:20,051 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:20:20,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:20:20,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1340342541, now seen corresponding path program 1 times [2022-12-13 17:20:20,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 17:20:20,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [804571354] [2022-12-13 17:20:20,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:20:20,054 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 17:20:20,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 17:20:20,057 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 17:20:20,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-12-13 17:20:24,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:20:24,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 17:20:24,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:20:27,930 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 17:20:27,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:20:39,075 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 17:20:39,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 17:20:39,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [804571354] [2022-12-13 17:20:39,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [804571354] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:20:39,076 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:20:39,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2022-12-13 17:20:39,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264283111] [2022-12-13 17:20:39,077 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:20:39,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 17:20:39,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 17:20:39,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 17:20:39,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-13 17:20:39,078 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:20:41,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:20:43,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:20:45,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:20:47,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:20:51,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:20:53,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:20:55,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:20:57,302 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 [] [2022-12-13 17:21:00,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.83s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:21:04,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.70s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:21:06,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.48s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:21:08,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:21:10,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:21:14,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:21:16,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:21:18,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:21:21,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:21:23,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:21:26,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:21:26,173 INFO L93 Difference]: Finished difference Result 71 states and 88 transitions. [2022-12-13 17:21:26,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 17:21:26,174 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-13 17:21:26,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:21:26,175 INFO L225 Difference]: With dead ends: 71 [2022-12-13 17:21:26,175 INFO L226 Difference]: Without dead ends: 46 [2022-12-13 17:21:26,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-12-13 17:21:26,176 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 46.7s IncrementalHoareTripleChecker+Time [2022-12-13 17:21:26,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 108 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 17 Unknown, 0 Unchecked, 46.7s Time] [2022-12-13 17:21:26,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-12-13 17:21:26,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-12-13 17:21:26,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.2) internal successors, (54), 45 states have internal predecessors, (54), 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-12-13 17:21:26,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2022-12-13 17:21:26,180 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 29 [2022-12-13 17:21:26,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:21:26,180 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2022-12-13 17:21:26,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:21:26,181 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-12-13 17:21:26,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-12-13 17:21:26,181 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:21:26,181 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:21:26,275 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-12-13 17:21:26,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 17:21:26,383 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:21:26,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:21:26,384 INFO L85 PathProgramCache]: Analyzing trace with hash -426284202, now seen corresponding path program 1 times [2022-12-13 17:21:26,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 17:21:26,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [318850462] [2022-12-13 17:21:26,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:21:26,386 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 17:21:26,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 17:21:26,389 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 17:21:26,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-12-13 17:21:32,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:21:33,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 17:21:33,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:21:33,695 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-13 17:21:33,696 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:21:33,696 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 17:21:33,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [318850462] [2022-12-13 17:21:33,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [318850462] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:21:33,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:21:33,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:21:33,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060882707] [2022-12-13 17:21:33,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:21:33,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 17:21:33,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 17:21:33,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 17:21:33,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:21:33,700 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-12-13 17:21:37,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.43s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:21:39,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:21:42,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.70s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:21:46,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:21:46,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:21:46,147 INFO L93 Difference]: Finished difference Result 72 states and 89 transitions. [2022-12-13 17:21:46,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 17:21:46,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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 33 [2022-12-13 17:21:46,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:21:46,558 INFO L225 Difference]: With dead ends: 72 [2022-12-13 17:21:46,558 INFO L226 Difference]: Without dead ends: 47 [2022-12-13 17:21:46,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:21:46,559 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2022-12-13 17:21:46,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 76 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 4 Unknown, 0 Unchecked, 12.2s Time] [2022-12-13 17:21:46,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-12-13 17:21:46,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2022-12-13 17:21:46,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.2) internal successors, (54), 45 states have internal predecessors, (54), 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-12-13 17:21:46,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2022-12-13 17:21:46,565 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 33 [2022-12-13 17:21:46,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:21:46,565 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2022-12-13 17:21:46,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-12-13 17:21:46,566 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-12-13 17:21:46,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-12-13 17:21:46,567 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:21:46,567 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:21:46,687 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-12-13 17:21:46,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 17:21:46,768 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:21:46,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:21:46,769 INFO L85 PathProgramCache]: Analyzing trace with hash 119314739, now seen corresponding path program 1 times [2022-12-13 17:21:46,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 17:21:46,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1568102213] [2022-12-13 17:21:46,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:21:46,770 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 17:21:46,770 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 17:21:46,772 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 17:21:46,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/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 (13)] Waiting until timeout for monitored process [2022-12-13 17:21:53,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:21:53,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 17:21:53,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:22:11,077 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) c_~_EPS~0) (= |c_ULTIMATE.start_main_~SqrtR__Input~0#1| (fp.add c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (= |c_ULTIMATE.start_main_~SqrtR__xn~0#1| (fp.div c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~SqrtR__Input~0#1|)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-12-13 17:22:13,320 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) c_~_EPS~0) (= |c_ULTIMATE.start_main_~SqrtR__Input~0#1| (fp.add c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (= |c_ULTIMATE.start_main_~SqrtR__xn~0#1| (fp.div c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~SqrtR__Input~0#1|)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-12-13 17:22:44,002 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2022-12-13 17:22:44,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:22:51,747 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~SqrtR__xn~0#1| (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~SqrtR__Input~0#1| |c_ULTIMATE.start_main_~SqrtR__xn~0#1|) |c_ULTIMATE.start_main_~SqrtR__xn~0#1|) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~SqrtR__Input~0#1|) |c_ULTIMATE.start_main_~SqrtR__xn~0#1|) |c_ULTIMATE.start_main_~SqrtR__xn~0#1|))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)))) (fp.gt (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~SqrtR__xn~0#1|)) (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse0 .cse0)))) is different from false [2022-12-13 17:22:54,179 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~SqrtR__xn~0#1| (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~SqrtR__Input~0#1| |c_ULTIMATE.start_main_~SqrtR__xn~0#1|) |c_ULTIMATE.start_main_~SqrtR__xn~0#1|) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~SqrtR__Input~0#1|) |c_ULTIMATE.start_main_~SqrtR__xn~0#1|) |c_ULTIMATE.start_main_~SqrtR__xn~0#1|))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)))) (fp.gt (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~SqrtR__xn~0#1|)) (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse0 .cse0)))) is different from true [2022-12-13 17:23:19,118 WARN L233 SmtUtils]: Spent 5.37s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 17:23:21,321 WARN L230 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-12-13 17:23:21,321 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2022-12-13 17:23:21,321 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 17:23:21,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1568102213] [2022-12-13 17:23:21,322 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-12-13 17:23:21,442 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/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 (13)] Forceful destruction successful, exit code 0 [2022-12-13 17:23:21,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 17:23:21,524 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:828) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:772) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:346) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:306) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:582) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 45 more [2022-12-13 17:23:21,528 INFO L158 Benchmark]: Toolchain (without parser) took 713055.16ms. Allocated memory is still 69.2MB. Free memory was 47.4MB in the beginning and 23.4MB in the end (delta: 24.0MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. [2022-12-13 17:23:21,528 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 54.5MB. Free memory is still 33.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 17:23:21,528 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.10ms. Allocated memory is still 69.2MB. Free memory was 47.2MB in the beginning and 35.5MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-12-13 17:23:21,528 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.04ms. Allocated memory is still 69.2MB. Free memory was 35.5MB in the beginning and 33.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 17:23:21,529 INFO L158 Benchmark]: Boogie Preprocessor took 25.36ms. Allocated memory is still 69.2MB. Free memory was 33.9MB in the beginning and 50.0MB in the end (delta: -16.1MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2022-12-13 17:23:21,529 INFO L158 Benchmark]: RCFGBuilder took 9389.78ms. Allocated memory is still 69.2MB. Free memory was 50.0MB in the beginning and 39.0MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 17:23:21,529 INFO L158 Benchmark]: TraceAbstraction took 703406.30ms. Allocated memory is still 69.2MB. Free memory was 38.2MB in the beginning and 23.4MB in the end (delta: 14.8MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2022-12-13 17:23:21,531 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.10ms. Allocated memory is still 54.5MB. Free memory is still 33.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 198.10ms. Allocated memory is still 69.2MB. Free memory was 47.2MB in the beginning and 35.5MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.04ms. Allocated memory is still 69.2MB. Free memory was 35.5MB in the beginning and 33.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.36ms. Allocated memory is still 69.2MB. Free memory was 33.9MB in the beginning and 50.0MB in the end (delta: -16.1MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * RCFGBuilder took 9389.78ms. Allocated memory is still 69.2MB. Free memory was 50.0MB in the beginning and 39.0MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 703406.30ms. Allocated memory is still 69.2MB. Free memory was 38.2MB in the beginning and 23.4MB in the end (delta: 14.8MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b2bc1be-f92e-4783-b67f-9b4aa19501b3/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")