./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 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/config/TaipanReach.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_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 54d39a6a3598707eb000bd324eee861653a2a39c1655837786308f3da9918a18 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 00:53:55,543 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 00:53:55,545 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 00:53:55,605 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 00:53:55,606 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 00:53:55,611 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 00:53:55,613 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 00:53:55,616 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 00:53:55,619 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 00:53:55,626 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 00:53:55,627 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 00:53:55,629 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 00:53:55,629 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 00:53:55,632 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 00:53:55,634 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 00:53:55,642 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 00:53:55,644 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 00:53:55,646 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 00:53:55,648 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 00:53:55,655 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 00:53:55,657 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 00:53:55,659 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 00:53:55,662 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 00:53:55,663 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 00:53:55,669 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 00:53:55,670 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 00:53:55,670 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 00:53:55,672 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 00:53:55,673 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 00:53:55,675 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 00:53:55,675 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 00:53:55,676 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 00:53:55,678 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 00:53:55,680 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 00:53:55,681 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 00:53:55,682 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 00:53:55,682 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 00:53:55,682 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 00:53:55,683 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 00:53:55,684 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 00:53:55,684 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 00:53:55,686 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-07 00:53:55,733 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 00:53:55,734 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 00:53:55,735 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 00:53:55,736 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 00:53:55,736 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 00:53:55,736 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 00:53:55,736 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-07 00:53:55,736 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 00:53:55,737 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 00:53:55,737 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-07 00:53:55,738 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-07 00:53:55,738 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 00:53:55,739 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-07 00:53:55,739 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-07 00:53:55,739 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-07 00:53:55,740 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 00:53:55,740 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 00:53:55,740 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 00:53:55,740 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 00:53:55,741 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 00:53:55,741 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 00:53:55,741 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 00:53:55,741 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 00:53:55,742 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 00:53:55,742 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 00:53:55,742 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 00:53:55,742 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 00:53:55,742 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 00:53:55,743 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 00:53:55,744 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 00:53:55,744 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 00:53:55,745 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 00:53:55,745 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 00:53:55,745 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 00:53:55,746 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-07 00:53:55,746 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 00:53:55,746 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 00:53:55,746 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 00:53:55,746 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 00:53:55,747 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/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_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 54d39a6a3598707eb000bd324eee861653a2a39c1655837786308f3da9918a18 [2021-11-07 00:53:56,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 00:53:56,099 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 00:53:56,101 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 00:53:56,103 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 00:53:56,103 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 00:53:56,104 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c.p+cfa-reducer.c [2021-11-07 00:53:56,178 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/data/d54d2e62f/8bd56e6b453045e48609bcbbea218149/FLAG411fffac9 [2021-11-07 00:53:56,654 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 00:53:56,655 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c.p+cfa-reducer.c [2021-11-07 00:53:56,678 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/data/d54d2e62f/8bd56e6b453045e48609bcbbea218149/FLAG411fffac9 [2021-11-07 00:53:57,028 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/data/d54d2e62f/8bd56e6b453045e48609bcbbea218149 [2021-11-07 00:53:57,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 00:53:57,035 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 00:53:57,037 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 00:53:57,037 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 00:53:57,041 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 00:53:57,042 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:53:57" (1/1) ... [2021-11-07 00:53:57,044 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62837832 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:57, skipping insertion in model container [2021-11-07 00:53:57,044 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:53:57" (1/1) ... [2021-11-07 00:53:57,052 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 00:53:57,081 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 00:53:57,292 WARN L228 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_e725df16-12ae-4f69-b227-c505a1ea2b40/sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c.p+cfa-reducer.c[2369,2382] [2021-11-07 00:53:57,298 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 00:53:57,307 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 00:53:57,328 WARN L228 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_e725df16-12ae-4f69-b227-c505a1ea2b40/sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c.p+cfa-reducer.c[2369,2382] [2021-11-07 00:53:57,330 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 00:53:57,348 INFO L208 MainTranslator]: Completed translation [2021-11-07 00:53:57,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:57 WrapperNode [2021-11-07 00:53:57,350 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 00:53:57,352 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 00:53:57,352 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 00:53:57,352 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 00:53:57,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:57" (1/1) ... [2021-11-07 00:53:57,369 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:57" (1/1) ... [2021-11-07 00:53:57,396 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 00:53:57,398 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 00:53:57,398 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 00:53:57,398 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 00:53:57,406 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:57" (1/1) ... [2021-11-07 00:53:57,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:57" (1/1) ... [2021-11-07 00:53:57,417 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:57" (1/1) ... [2021-11-07 00:53:57,418 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:57" (1/1) ... [2021-11-07 00:53:57,428 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:57" (1/1) ... [2021-11-07 00:53:57,435 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:57" (1/1) ... [2021-11-07 00:53:57,436 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:57" (1/1) ... [2021-11-07 00:53:57,442 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 00:53:57,443 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 00:53:57,446 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 00:53:57,447 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 00:53:57,448 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:57" (1/1) ... [2021-11-07 00:53:57,455 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 00:53:57,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 00:53:57,493 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 00:53:57,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 00:53:57,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 00:53:57,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 00:53:57,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 00:53:57,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 00:53:57,874 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 00:53:57,874 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-07 00:53:57,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:53:57 BoogieIcfgContainer [2021-11-07 00:53:57,876 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 00:53:57,878 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 00:53:57,879 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 00:53:57,882 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 00:53:57,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:53:57" (1/3) ... [2021-11-07 00:53:57,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23d6879c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:53:57, skipping insertion in model container [2021-11-07 00:53:57,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:57" (2/3) ... [2021-11-07 00:53:57,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23d6879c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:53:57, skipping insertion in model container [2021-11-07 00:53:57,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:53:57" (3/3) ... [2021-11-07 00:53:57,885 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant.c.p+cfa-reducer.c [2021-11-07 00:53:57,890 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 00:53:57,890 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-07 00:53:57,960 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 00:53:57,966 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-07 00:53:57,966 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-07 00:53:57,995 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:53:58,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 00:53:58,000 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:53:58,001 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:53:58,001 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 00:53:58,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:53:58,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1746364850, now seen corresponding path program 1 times [2021-11-07 00:53:58,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:53:58,017 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396616962] [2021-11-07 00:53:58,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:53:58,018 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:53:58,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:53:58,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:53:58,236 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:53:58,236 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396616962] [2021-11-07 00:53:58,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396616962] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:53:58,238 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:53:58,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 00:53:58,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360534960] [2021-11-07 00:53:58,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 00:53:58,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:53:58,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 00:53:58,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 00:53:58,270 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:53:58,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:53:58,349 INFO L93 Difference]: Finished difference Result 43 states and 58 transitions. [2021-11-07 00:53:58,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 00:53:58,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-07 00:53:58,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:53:58,360 INFO L225 Difference]: With dead ends: 43 [2021-11-07 00:53:58,360 INFO L226 Difference]: Without dead ends: 35 [2021-11-07 00:53:58,364 INFO L786 BasicCegarLoop]: 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 [2021-11-07 00:53:58,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-11-07 00:53:58,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 20. [2021-11-07 00:53:58,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 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) [2021-11-07 00:53:58,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2021-11-07 00:53:58,405 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 27 transitions. Word has length 11 [2021-11-07 00:53:58,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:53:58,405 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 27 transitions. [2021-11-07 00:53:58,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:53:58,406 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2021-11-07 00:53:58,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 00:53:58,407 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:53:58,407 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:53:58,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 00:53:58,408 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 00:53:58,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:53:58,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1729354189, now seen corresponding path program 1 times [2021-11-07 00:53:58,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:53:58,412 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143343455] [2021-11-07 00:53:58,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:53:58,413 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:53:58,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 00:53:58,465 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 00:53:58,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 00:53:58,536 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-07 00:53:58,536 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-07 00:53:58,538 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 00:53:58,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 00:53:58,543 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1] [2021-11-07 00:53:58,546 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 00:53:58,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:53:58 BoogieIcfgContainer [2021-11-07 00:53:58,595 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 00:53:58,597 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 00:53:58,597 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 00:53:58,597 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 00:53:58,598 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:53:57" (3/4) ... [2021-11-07 00:53:58,601 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-07 00:53:58,602 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 00:53:58,604 INFO L168 Benchmark]: Toolchain (without parser) took 1568.18 ms. Allocated memory is still 96.5 MB. Free memory was 56.1 MB in the beginning and 42.7 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.8 MB. Max. memory is 16.1 GB. [2021-11-07 00:53:58,605 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 96.5 MB. Free memory is still 72.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 00:53:58,606 INFO L168 Benchmark]: CACSL2BoogieTranslator took 313.42 ms. Allocated memory is still 96.5 MB. Free memory was 55.9 MB in the beginning and 45.1 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-11-07 00:53:58,608 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.98 ms. Allocated memory is still 96.5 MB. Free memory was 45.1 MB in the beginning and 43.6 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 00:53:58,609 INFO L168 Benchmark]: Boogie Preprocessor took 44.95 ms. Allocated memory is still 96.5 MB. Free memory was 43.6 MB in the beginning and 42.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 00:53:58,614 INFO L168 Benchmark]: RCFGBuilder took 433.39 ms. Allocated memory is still 96.5 MB. Free memory was 42.4 MB in the beginning and 68.6 MB in the end (delta: -26.2 MB). Peak memory consumption was 6.5 MB. Max. memory is 16.1 GB. [2021-11-07 00:53:58,615 INFO L168 Benchmark]: TraceAbstraction took 717.09 ms. Allocated memory is still 96.5 MB. Free memory was 68.3 MB in the beginning and 43.0 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. [2021-11-07 00:53:58,616 INFO L168 Benchmark]: Witness Printer took 5.79 ms. Allocated memory is still 96.5 MB. Free memory was 43.0 MB in the beginning and 42.7 MB in the end (delta: 312.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 00:53:58,624 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.19 ms. Allocated memory is still 96.5 MB. Free memory is still 72.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 313.42 ms. Allocated memory is still 96.5 MB. Free memory was 55.9 MB in the beginning and 45.1 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 44.98 ms. Allocated memory is still 96.5 MB. Free memory was 45.1 MB in the beginning and 43.6 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 44.95 ms. Allocated memory is still 96.5 MB. Free memory was 43.6 MB in the beginning and 42.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 433.39 ms. Allocated memory is still 96.5 MB. Free memory was 42.4 MB in the beginning and 68.6 MB in the end (delta: -26.2 MB). Peak memory consumption was 6.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 717.09 ms. Allocated memory is still 96.5 MB. Free memory was 68.3 MB in the beginning and 43.0 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. * Witness Printer took 5.79 ms. Allocated memory is still 96.5 MB. Free memory was 43.0 MB in the beginning and 42.7 MB in the end (delta: 312.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * 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 someBinaryArithmeticDOUBLEoperation at line 85, overapproximation of someUnaryDOUBLEoperation at line 42, overapproximation of someBinaryDOUBLEComparisonOperation at line 88. Possible FailurePath: [L1] int __return_main; [L11] double _EPS = 0.0000010; [L14] double __return_125; [L17] double main__d; [L18] double main__r; [L19] main__d = 1.0 VAL [__return_125=0, __return_main=0, _EPS=1/1000000] [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; [L35] COND FALSE !(SqrtR__Input <= 1.0) [L139] SqrtR__xn = 1.0 / SqrtR__Input [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, _EPS=1/1000000] [L44] COND FALSE !(SqrtR__residu > SqrtR__lsup) VAL [__return_125=0, __return_main=0, _EPS=1/1000000] [L126] COND FALSE !(SqrtR__residu < SqrtR__linf) [L132] SqrtR____CPAchecker_TMP_0 = 0 VAL [__return_125=0, __return_main=0, _EPS=1/1000000] [L49] SqrtR__cond = SqrtR____CPAchecker_TMP_0 [L50] SqrtR__i = 0 VAL [__return_125=0, __return_main=0, _EPS=1/1000000] [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=49, __return_main=0, _EPS=1/1000000] [L88] COND FALSE !(main__r >= 1.0) VAL [__return_125=49, __return_main=0, _EPS=1/1000000] [L114] main____CPAchecker_TMP_0 = 0 VAL [__return_125=49, __return_main=0, _EPS=1/1000000] [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=49, __return_main=0, _EPS=1/1000000] [L99] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_125=49, __return_main=0, _EPS=1/1000000] [L101] reach_error() VAL [__return_125=49, __return_main=0, _EPS=1/1000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 47 SDtfs, 41 SDslu, 48 SDs, 0 SdLazy, 15 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, 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=20occurred 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, 15 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 14 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 [2021-11-07 00:53:58,683 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/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/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/config/TaipanReach.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_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 54d39a6a3598707eb000bd324eee861653a2a39c1655837786308f3da9918a18 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 00:54:01,164 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 00:54:01,167 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 00:54:01,227 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 00:54:01,228 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 00:54:01,229 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 00:54:01,231 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 00:54:01,234 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 00:54:01,237 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 00:54:01,238 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 00:54:01,239 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 00:54:01,241 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 00:54:01,243 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 00:54:01,246 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 00:54:01,248 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 00:54:01,249 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 00:54:01,251 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 00:54:01,252 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 00:54:01,254 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 00:54:01,257 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 00:54:01,259 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 00:54:01,261 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 00:54:01,262 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 00:54:01,263 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 00:54:01,267 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 00:54:01,268 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 00:54:01,268 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 00:54:01,269 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 00:54:01,270 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 00:54:01,271 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 00:54:01,272 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 00:54:01,273 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 00:54:01,274 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 00:54:01,275 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 00:54:01,276 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 00:54:01,276 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 00:54:01,277 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 00:54:01,278 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 00:54:01,278 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 00:54:01,279 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 00:54:01,280 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 00:54:01,281 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-11-07 00:54:01,306 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 00:54:01,306 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 00:54:01,310 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 00:54:01,311 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 00:54:01,312 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 00:54:01,312 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 00:54:01,312 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 00:54:01,312 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 00:54:01,313 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 00:54:01,314 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 00:54:01,315 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 00:54:01,315 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 00:54:01,316 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 00:54:01,316 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 00:54:01,316 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 00:54:01,316 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 00:54:01,317 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 00:54:01,317 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-07 00:54:01,317 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-07 00:54:01,317 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 00:54:01,317 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 00:54:01,318 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 00:54:01,318 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 00:54:01,318 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 00:54:01,319 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-07 00:54:01,319 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 00:54:01,319 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 00:54:01,319 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 00:54:01,320 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 00:54:01,320 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 00:54:01,320 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-07 00:54:01,320 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-07 00:54:01,321 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 00:54:01,321 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 00:54:01,321 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 00:54:01,321 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/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_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 54d39a6a3598707eb000bd324eee861653a2a39c1655837786308f3da9918a18 [2021-11-07 00:54:01,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 00:54:01,708 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 00:54:01,711 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 00:54:01,712 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 00:54:01,713 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 00:54:01,714 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c.p+cfa-reducer.c [2021-11-07 00:54:01,795 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/data/2fd9003b6/d3baf8daae4b4806949fedf49e43a9cd/FLAG176b8a0df [2021-11-07 00:54:02,363 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 00:54:02,364 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c.p+cfa-reducer.c [2021-11-07 00:54:02,375 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/data/2fd9003b6/d3baf8daae4b4806949fedf49e43a9cd/FLAG176b8a0df [2021-11-07 00:54:02,728 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/data/2fd9003b6/d3baf8daae4b4806949fedf49e43a9cd [2021-11-07 00:54:02,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 00:54:02,738 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 00:54:02,742 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 00:54:02,742 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 00:54:02,746 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 00:54:02,747 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:54:02" (1/1) ... [2021-11-07 00:54:02,748 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55505069 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:02, skipping insertion in model container [2021-11-07 00:54:02,749 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:54:02" (1/1) ... [2021-11-07 00:54:02,757 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 00:54:02,783 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 00:54:02,979 WARN L228 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_e725df16-12ae-4f69-b227-c505a1ea2b40/sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c.p+cfa-reducer.c[2369,2382] [2021-11-07 00:54:02,985 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 00:54:02,998 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 00:54:03,020 WARN L228 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_e725df16-12ae-4f69-b227-c505a1ea2b40/sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c.p+cfa-reducer.c[2369,2382] [2021-11-07 00:54:03,023 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 00:54:03,088 INFO L208 MainTranslator]: Completed translation [2021-11-07 00:54:03,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:03 WrapperNode [2021-11-07 00:54:03,089 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 00:54:03,090 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 00:54:03,091 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 00:54:03,091 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 00:54:03,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:03" (1/1) ... [2021-11-07 00:54:03,122 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:03" (1/1) ... [2021-11-07 00:54:03,154 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 00:54:03,155 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 00:54:03,155 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 00:54:03,156 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 00:54:03,164 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:03" (1/1) ... [2021-11-07 00:54:03,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:03" (1/1) ... [2021-11-07 00:54:03,172 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:03" (1/1) ... [2021-11-07 00:54:03,173 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:03" (1/1) ... [2021-11-07 00:54:03,192 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:03" (1/1) ... [2021-11-07 00:54:03,196 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:03" (1/1) ... [2021-11-07 00:54:03,204 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:03" (1/1) ... [2021-11-07 00:54:03,211 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 00:54:03,212 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 00:54:03,215 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 00:54:03,215 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 00:54:03,216 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:03" (1/1) ... [2021-11-07 00:54:03,222 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 00:54:03,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 00:54:03,253 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 00:54:03,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 00:54:03,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-07 00:54:03,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 00:54:03,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 00:54:03,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 00:54:12,700 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 00:54:12,700 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-07 00:54:12,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:54:12 BoogieIcfgContainer [2021-11-07 00:54:12,703 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 00:54:12,705 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 00:54:12,705 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 00:54:12,708 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 00:54:12,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:54:02" (1/3) ... [2021-11-07 00:54:12,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ef4275 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:54:12, skipping insertion in model container [2021-11-07 00:54:12,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:03" (2/3) ... [2021-11-07 00:54:12,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ef4275 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:54:12, skipping insertion in model container [2021-11-07 00:54:12,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:54:12" (3/3) ... [2021-11-07 00:54:12,712 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant.c.p+cfa-reducer.c [2021-11-07 00:54:12,718 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 00:54:12,718 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-07 00:54:12,800 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 00:54:12,807 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-07 00:54:12,808 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-07 00:54:12,820 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) [2021-11-07 00:54:12,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-07 00:54:12,826 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:54:12,826 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:54:12,827 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 00:54:12,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:54:12,833 INFO L85 PathProgramCache]: Analyzing trace with hash -2001896247, now seen corresponding path program 1 times [2021-11-07 00:54:12,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 00:54:12,846 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2048526096] [2021-11-07 00:54:12,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:54:12,847 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 00:54:12,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 00:54:12,858 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 00:54:12,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-07 00:54:15,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:54:15,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-07 00:54:15,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 00:54:15,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:54:15,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 00:54:16,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:54:16,202 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 00:54:16,202 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2048526096] [2021-11-07 00:54:16,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2048526096] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 00:54:16,203 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:54:16,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-07 00:54:16,204 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310554806] [2021-11-07 00:54:16,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 00:54:16,208 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 00:54:16,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 00:54:16,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 00:54:16,224 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 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:54:39,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:54:39,665 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2021-11-07 00:54:39,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 00:54:39,668 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-11-07 00:54:39,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:54:39,677 INFO L225 Difference]: With dead ends: 50 [2021-11-07 00:54:39,677 INFO L226 Difference]: Without dead ends: 25 [2021-11-07 00:54:39,679 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-07 00:54:39,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-11-07 00:54:39,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2021-11-07 00:54:39,715 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) [2021-11-07 00:54:39,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2021-11-07 00:54:39,717 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 14 [2021-11-07 00:54:39,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:54:39,718 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2021-11-07 00:54:39,718 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:54:39,718 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2021-11-07 00:54:39,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-07 00:54:39,719 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:54:39,719 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:54:39,752 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-11-07 00:54:39,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 00:54:39,920 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 00:54:39,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:54:39,921 INFO L85 PathProgramCache]: Analyzing trace with hash 939018830, now seen corresponding path program 1 times [2021-11-07 00:54:39,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 00:54:39,922 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1619689147] [2021-11-07 00:54:39,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:54:39,922 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 00:54:39,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 00:54:39,935 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 00:54:39,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-07 00:54:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:54:41,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-07 00:54:41,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 00:54:42,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:54:42,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 00:54:48,858 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~SqrtR__xn~0 c_ULTIMATE.start_main_~SqrtR__xn~0))) (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 [2021-11-07 00:54:50,933 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~SqrtR__xn~0 c_ULTIMATE.start_main_~SqrtR__xn~0))) (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 [2021-11-07 00:55:05,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:55:05,044 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 00:55:05,045 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1619689147] [2021-11-07 00:55:05,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1619689147] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 00:55:05,045 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:55:05,045 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-11-07 00:55:05,046 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738593693] [2021-11-07 00:55:05,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-07 00:55:05,047 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 00:55:05,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 00:55:05,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=27, Unknown=2, NotChecked=10, Total=56 [2021-11-07 00:55:05,050 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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) [2021-11-07 00:55:07,319 WARN L860 $PredicateComparison]: unable to prove that (and (let ((.cse0 (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~SqrtR__xn~0 c_ULTIMATE.start_main_~SqrtR__xn~0))) (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_~_EPS~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0))) (= c_currentRoundingMode roundNearestTiesToEven) (= ((_ to_fp 11 53) c_currentRoundingMode 1.0) c_ULTIMATE.start_main_~SqrtR__xn~0)) is different from true [2021-11-07 00:55:55,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:55:55,276 INFO L93 Difference]: Finished difference Result 68 states and 91 transitions. [2021-11-07 00:55:55,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 00:55:55,279 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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 [2021-11-07 00:55:55,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:55:55,280 INFO L225 Difference]: With dead ends: 68 [2021-11-07 00:55:55,280 INFO L226 Difference]: Without dead ends: 49 [2021-11-07 00:55:55,281 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=19, Invalid=28, Unknown=3, NotChecked=22, Total=72 [2021-11-07 00:55:55,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-11-07 00:55:55,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 25. [2021-11-07 00:55:55,287 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) [2021-11-07 00:55:55,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2021-11-07 00:55:55,289 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 14 [2021-11-07 00:55:55,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:55:55,299 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2021-11-07 00:55:55,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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) [2021-11-07 00:55:55,300 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2021-11-07 00:55:55,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-07 00:55:55,302 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:55:55,302 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:55:55,334 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-07 00:55:55,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 00:55:55,511 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 00:55:55,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:55:55,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1251138159, now seen corresponding path program 1 times [2021-11-07 00:55:55,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 00:55:55,513 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [342075629] [2021-11-07 00:55:55,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:55:55,513 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 00:55:55,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 00:55:55,523 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 00:55:55,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-07 00:55:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:55:56,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-07 00:55:56,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 00:55:57,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:55:57,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 00:55:57,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:55:57,682 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 00:55:57,683 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [342075629] [2021-11-07 00:55:57,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [342075629] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 00:55:57,683 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:55:57,683 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-07 00:55:57,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39231073] [2021-11-07 00:55:57,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 00:55:57,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 00:55:57,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 00:55:57,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 00:55:57,686 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:06,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:56:06,245 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2021-11-07 00:56:06,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 00:56:06,246 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-11-07 00:56:06,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:56:06,247 INFO L225 Difference]: With dead ends: 46 [2021-11-07 00:56:06,247 INFO L226 Difference]: Without dead ends: 27 [2021-11-07 00:56:06,248 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-07 00:56:06,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-11-07 00:56:06,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-11-07 00:56:06,253 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) [2021-11-07 00:56:06,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2021-11-07 00:56:06,254 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 14 [2021-11-07 00:56:06,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:56:06,255 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2021-11-07 00:56:06,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:06,256 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2021-11-07 00:56:06,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 00:56:06,257 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:56:06,257 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:56:06,290 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-11-07 00:56:06,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 00:56:06,461 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 00:56:06,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:56:06,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1124243894, now seen corresponding path program 1 times [2021-11-07 00:56:06,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 00:56:06,463 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1079563936] [2021-11-07 00:56:06,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:56:06,464 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 00:56:06,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 00:56:06,468 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 00:56:06,473 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-07 00:56:10,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:56:10,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-07 00:56:10,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 00:56:12,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:56:12,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 00:56:20,121 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~SqrtR__xn~0 (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 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0) (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) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) ((_ 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)) (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse0 .cse0))))) is different from false [2021-11-07 00:56:22,568 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~SqrtR__xn~0 (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 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0) (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) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) ((_ 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)) (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse0 .cse0))))) is different from true [2021-11-07 00:56:48,362 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (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 .cse1) .cse1) (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) .cse1) .cse1))))) ((_ 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 .cse1)) (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse0 .cse0)))))) is different from false [2021-11-07 00:56:50,566 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (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 .cse1) .cse1) (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) .cse1) .cse1))))) ((_ 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 .cse1)) (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse0 .cse0)))))) is different from true [2021-11-07 00:56:57,207 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (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 .cse1) .cse1) (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) .cse1) .cse1))))) ((_ 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 .cse1)) (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse0 .cse0)))))) is different from false [2021-11-07 00:56:59,437 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (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 .cse1) .cse1) (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) .cse1) .cse1))))) ((_ 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 .cse1)) (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse0 .cse0)))))) is different from true [2021-11-07 00:57:01,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:57:01,358 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 00:57:01,359 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1079563936] [2021-11-07 00:57:01,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1079563936] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 00:57:01,359 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:57:01,359 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2021-11-07 00:57:01,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648183364] [2021-11-07 00:57:01,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 00:57:01,360 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 00:57:01,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 00:57:01,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=48, Unknown=6, NotChecked=48, Total=132 [2021-11-07 00:57:01,362 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:57:03,749 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= c_ULTIMATE.start_main_~main__d~0 .cse0) (= c_~_EPS~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0))) (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse1 (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 .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) .cse0) .cse0))))) ((_ 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 .cse1 .cse0)) (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse1 .cse1))))))) is different from true [2021-11-07 00:57:05,988 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (let ((.cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (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 .cse1) .cse1) (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) .cse1) .cse1))))) ((_ 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 .cse1)) (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse0 .cse0))))) (= c_~_EPS~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0))) (= .cse1 c_ULTIMATE.start_main_~SqrtR__Input~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-07 00:57:08,403 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (let ((.cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~SqrtR__xn~0 (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 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0) (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) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) ((_ 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)) (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse0 .cse0))))) (= c_~_EPS~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0))) (= .cse1 c_ULTIMATE.start_main_~SqrtR__Input~0) (= c_currentRoundingMode roundNearestTiesToEven) (= .cse1 c_ULTIMATE.start_main_~SqrtR__xn~0))) is different from true [2021-11-07 00:58:07,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:58:07,072 INFO L93 Difference]: Finished difference Result 78 states and 102 transitions. [2021-11-07 00:58:07,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-07 00:58:07,087 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-11-07 00:58:07,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:58:07,090 INFO L225 Difference]: With dead ends: 78 [2021-11-07 00:58:07,090 INFO L226 Difference]: Without dead ends: 57 [2021-11-07 00:58:07,090 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 23.3s TimeCoverageRelationStatistics Valid=36, Invalid=51, Unknown=9, NotChecked=114, Total=210 [2021-11-07 00:58:07,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-11-07 00:58:07,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 31. [2021-11-07 00:58:07,098 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) [2021-11-07 00:58:07,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2021-11-07 00:58:07,099 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 18 [2021-11-07 00:58:07,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:58:07,100 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2021-11-07 00:58:07,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:07,100 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2021-11-07 00:58:07,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 00:58:07,101 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:58:07,101 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:58:07,165 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-07 00:58:07,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 00:58:07,304 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 00:58:07,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:58:07,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1669842835, now seen corresponding path program 1 times [2021-11-07 00:58:07,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 00:58:07,306 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [118070867] [2021-11-07 00:58:07,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:58:07,306 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 00:58:07,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 00:58:07,307 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 00:58:07,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-07 00:58:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:58:11,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-07 00:58:11,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 00:58:11,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 00:58:11,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 00:58:12,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 00:58:12,218 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 00:58:12,218 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [118070867] [2021-11-07 00:58:12,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [118070867] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 00:58:12,219 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:58:12,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-07 00:58:12,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103027854] [2021-11-07 00:58:12,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 00:58:12,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 00:58:12,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 00:58:12,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 00:58:12,221 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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) [2021-11-07 00:58:18,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:58:18,829 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2021-11-07 00:58:18,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 00:58:18,830 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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 [2021-11-07 00:58:18,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:58:18,831 INFO L225 Difference]: With dead ends: 64 [2021-11-07 00:58:18,832 INFO L226 Difference]: Without dead ends: 62 [2021-11-07 00:58:18,832 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-11-07 00:58:18,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-11-07 00:58:18,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 33. [2021-11-07 00:58:18,845 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) [2021-11-07 00:58:18,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2021-11-07 00:58:18,847 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 18 [2021-11-07 00:58:18,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:58:18,848 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2021-11-07 00:58:18,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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) [2021-11-07 00:58:18,850 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2021-11-07 00:58:18,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 00:58:18,851 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:58:18,851 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:58:18,918 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-07 00:58:19,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 00:58:19,063 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 00:58:19,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:58:19,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1686853496, now seen corresponding path program 1 times [2021-11-07 00:58:19,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 00:58:19,065 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2141260673] [2021-11-07 00:58:19,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:58:19,065 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 00:58:19,065 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 00:58:19,066 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 00:58:19,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-07 00:58:22,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:58:22,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-07 00:58:22,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 00:58:27,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:58:27,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 00:58:34,584 WARN L838 $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) .cse0)) is different from false [2021-11-07 00:58:36,795 WARN L860 $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) .cse0)) is different from true [2021-11-07 00:58:54,137 WARN L207 SmtUtils]: Spent 5.19 s on a formula simplification that was a NOOP. DAG size: 26 [2021-11-07 00:58:56,728 WARN L838 $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 (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 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0) (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) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))) .cse0)) is different from false [2021-11-07 00:58:59,387 WARN L860 $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 (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 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0) (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) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))) .cse0)) is different from true [2021-11-07 00:59:04,610 WARN L207 SmtUtils]: Spent 5.22 s on a formula simplification that was a NOOP. DAG size: 26 [2021-11-07 00:59:09,844 WARN L207 SmtUtils]: Spent 5.23 s on a formula simplification that was a NOOP. DAG size: 26 [2021-11-07 00:59:15,027 WARN L207 SmtUtils]: Spent 5.17 s on a formula simplification that was a NOOP. DAG size: 26 [2021-11-07 00:59:20,254 WARN L207 SmtUtils]: Spent 5.22 s on a formula simplification that was a NOOP. DAG size: 26 [2021-11-07 00:59:27,418 WARN L838 $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 .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) .cse0) .cse0))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))) .cse0)) is different from false [2021-11-07 00:59:29,803 WARN L860 $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 .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) .cse0) .cse0))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))) .cse0)) is different from true [2021-11-07 00:59:36,993 WARN L838 $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 .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) .cse0) .cse0))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))) .cse0)) is different from false [2021-11-07 00:59:39,385 WARN L860 $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 .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) .cse0) .cse0))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))) .cse0)) is different from true [2021-11-07 00:59:39,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-07 00:59:39,399 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 00:59:39,399 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2141260673] [2021-11-07 00:59:39,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2141260673] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 00:59:39,400 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [584048330] [2021-11-07 00:59:39,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:59:39,400 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-07 00:59:39,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/cvc4 [2021-11-07 00:59:39,402 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-07 00:59:39,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2021-11-07 00:59:44,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:59:44,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-07 00:59:44,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 00:59:45,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:59:45,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:00:08,085 WARN L207 SmtUtils]: Spent 5.16 s on a formula simplification that was a NOOP. DAG size: 26 [2021-11-07 01:00:13,244 WARN L207 SmtUtils]: Spent 5.16 s on a formula simplification that was a NOOP. DAG size: 26 [2021-11-07 01:00:18,409 WARN L207 SmtUtils]: Spent 5.16 s on a formula simplification that was a NOOP. DAG size: 26 [2021-11-07 01:00:23,666 WARN L207 SmtUtils]: Spent 5.25 s on a formula simplification that was a NOOP. DAG size: 26 [2021-11-07 01:00:28,916 WARN L207 SmtUtils]: Spent 5.24 s on a formula simplification that was a NOOP. DAG size: 26 [2021-11-07 01:00:38,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-07 01:00:38,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [584048330] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:00:38,442 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385440237] [2021-11-07 01:00:38,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:38,443 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:00:38,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:00:38,451 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:00:38,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-07 01:02:55,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:02:56,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-07 01:02:56,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:03:17,982 WARN L207 SmtUtils]: Spent 10.16 s on a formula simplification that was a NOOP. DAG size: 16 [2021-11-07 01:03:19,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:19,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:03:42,132 WARN L207 SmtUtils]: Spent 5.17 s on a formula simplification that was a NOOP. DAG size: 26 [2021-11-07 01:03:47,326 WARN L207 SmtUtils]: Spent 5.19 s on a formula simplification that was a NOOP. DAG size: 26 [2021-11-07 01:03:52,511 WARN L207 SmtUtils]: Spent 5.18 s on a formula simplification that was a NOOP. DAG size: 26 [2021-11-07 01:03:58,546 WARN L207 SmtUtils]: Spent 6.03 s on a formula simplification that was a NOOP. DAG size: 4 [2021-11-07 01:04:03,745 WARN L207 SmtUtils]: Spent 5.20 s on a formula simplification that was a NOOP. DAG size: 26 [2021-11-07 01:04:06,332 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((ULTIMATE.start_main_~SqrtR__residu~0 (_ FloatingPoint 11 53))) (not (fp.gt ULTIMATE.start_main_~SqrtR__residu~0 c_ULTIMATE.start_main_~SqrtR__lsup~0))) (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 (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 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0) (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) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))) .cse0))) is different from false [2021-11-07 01:04:08,922 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((ULTIMATE.start_main_~SqrtR__residu~0 (_ FloatingPoint 11 53))) (not (fp.gt ULTIMATE.start_main_~SqrtR__residu~0 c_ULTIMATE.start_main_~SqrtR__lsup~0))) (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 (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 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0) (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) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))) .cse0))) is different from true [2021-11-07 01:04:14,913 WARN L207 SmtUtils]: Spent 5.98 s on a formula simplification that was a NOOP. DAG size: 8 [2021-11-07 01:04:20,076 WARN L207 SmtUtils]: Spent 5.16 s on a formula simplification that was a NOOP. DAG size: 26 [2021-11-07 01:04:22,652 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((ULTIMATE.start_main_~SqrtR__residu~0 (_ FloatingPoint 11 53))) (not (fp.gt ULTIMATE.start_main_~SqrtR__residu~0 (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~SqrtR__xn~0 c_ULTIMATE.start_main_~SqrtR__xn~0))))) (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 (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 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0) (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) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))) .cse0))) is different from false [2021-11-07 01:04:25,237 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((ULTIMATE.start_main_~SqrtR__residu~0 (_ FloatingPoint 11 53))) (not (fp.gt ULTIMATE.start_main_~SqrtR__residu~0 (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~SqrtR__xn~0 c_ULTIMATE.start_main_~SqrtR__xn~0))))) (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 (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 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0) (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) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))) .cse0))) is different from true [2021-11-07 01:04:35,316 WARN L207 SmtUtils]: Spent 5.34 s on a formula simplification that was a NOOP. DAG size: 9 [2021-11-07 01:04:37,687 WARN L838 $PredicateComparison]: unable to prove that (or (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 .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) .cse0) .cse0))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))) .cse0)) (forall ((ULTIMATE.start_main_~SqrtR__residu~0 (_ FloatingPoint 11 53))) (not (fp.gt ULTIMATE.start_main_~SqrtR__residu~0 (fp.mul c_currentRoundingMode c_~_EPS~0 (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode .cse1 .cse1))))))) is different from false [2021-11-07 01:04:40,046 WARN L860 $PredicateComparison]: unable to prove that (or (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 .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) .cse0) .cse0))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))) .cse0)) (forall ((ULTIMATE.start_main_~SqrtR__residu~0 (_ FloatingPoint 11 53))) (not (fp.gt ULTIMATE.start_main_~SqrtR__residu~0 (fp.mul c_currentRoundingMode c_~_EPS~0 (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode .cse1 .cse1))))))) is different from true [2021-11-07 01:04:45,442 WARN L207 SmtUtils]: Spent 5.37 s on a formula simplification that was a NOOP. DAG size: 9 [2021-11-07 01:04:52,571 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((ULTIMATE.start_main_~SqrtR__residu~0 (_ FloatingPoint 11 53))) (not (fp.gt ULTIMATE.start_main_~SqrtR__residu~0 (fp.mul c_currentRoundingMode c_~_EPS~0 (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode .cse0 .cse0)))))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.geq (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (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 .cse1) .cse1) (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) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))) .cse1))) is different from false [2021-11-07 01:04:54,949 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((ULTIMATE.start_main_~SqrtR__residu~0 (_ FloatingPoint 11 53))) (not (fp.gt ULTIMATE.start_main_~SqrtR__residu~0 (fp.mul c_currentRoundingMode c_~_EPS~0 (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode .cse0 .cse0)))))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.geq (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (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 .cse1) .cse1) (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) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))) .cse1))) is different from true [2021-11-07 01:04:55,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-07 01:04:55,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385440237] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:04:55,007 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2021-11-07 01:04:55,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 9, 9] total 22 [2021-11-07 01:04:55,008 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690704166] [2021-11-07 01:04:55,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-07 01:04:55,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 01:04:55,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-07 01:04:55,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=134, Unknown=17, NotChecked=248, Total=462 [2021-11-07 01:04:55,010 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 states have internal predecessors, (43), 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) [2021-11-07 01:04:59,947 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (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 .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) .cse0) .cse0))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))) .cse0))) (and (= c_ULTIMATE.start_main_~main__d~0 .cse0) (= c_~_EPS~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0))) (or (forall ((ULTIMATE.start_main_~SqrtR__residu~0 (_ FloatingPoint 11 53))) (not (fp.gt ULTIMATE.start_main_~SqrtR__residu~0 (fp.mul c_currentRoundingMode c_~_EPS~0 (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode .cse1 .cse1)))))) .cse2) (= c_currentRoundingMode roundNearestTiesToEven) .cse2))) is different from true [2021-11-07 01:05:02,364 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.geq (fp.div c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 (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 .cse2) .cse2) (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) .cse2) .cse2))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))) .cse2))) (and .cse0 (= c_~_EPS~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0))) (or .cse0 (forall ((ULTIMATE.start_main_~SqrtR__residu~0 (_ FloatingPoint 11 53))) (not (fp.gt ULTIMATE.start_main_~SqrtR__residu~0 (fp.mul c_currentRoundingMode c_~_EPS~0 (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode .cse1 .cse1))))))) (= .cse2 c_ULTIMATE.start_main_~SqrtR__Input~0) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2021-11-07 01:05:05,017 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.geq (fp.div c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~SqrtR__xn~0 (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 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0) (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) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))) .cse0))) (and (= c_~_EPS~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0))) (= .cse0 c_ULTIMATE.start_main_~SqrtR__Input~0) (or (forall ((ULTIMATE.start_main_~SqrtR__residu~0 (_ FloatingPoint 11 53))) (not (fp.gt ULTIMATE.start_main_~SqrtR__residu~0 (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~SqrtR__xn~0 c_ULTIMATE.start_main_~SqrtR__xn~0))))) .cse1) (= c_currentRoundingMode roundNearestTiesToEven) (= .cse0 c_ULTIMATE.start_main_~SqrtR__xn~0) .cse1))) is different from true [2021-11-07 01:05:07,623 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.geq (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~SqrtR__xn~0 (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 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0) (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) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))) .cse1))) (and (= c_ULTIMATE.start_main_~SqrtR__lsup~0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~SqrtR__xn~0 c_ULTIMATE.start_main_~SqrtR__xn~0))) (or (forall ((ULTIMATE.start_main_~SqrtR__residu~0 (_ FloatingPoint 11 53))) (not (fp.gt ULTIMATE.start_main_~SqrtR__residu~0 c_ULTIMATE.start_main_~SqrtR__lsup~0))) .cse0) (= .cse1 c_ULTIMATE.start_main_~SqrtR__Input~0) (= c_currentRoundingMode roundNearestTiesToEven) (= .cse1 c_ULTIMATE.start_main_~SqrtR__xn~0) .cse0))) is different from true [2021-11-07 01:05:10,221 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= .cse0 c_ULTIMATE.start_main_~SqrtR__Input~0) (= c_currentRoundingMode roundNearestTiesToEven) (= .cse0 c_ULTIMATE.start_main_~SqrtR__xn~0) (fp.geq (fp.div c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~SqrtR__xn~0 (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 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0) (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) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))) .cse0))) is different from true [2021-11-07 01:05:12,503 WARN L860 $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) .cse0) (= c_ULTIMATE.start_main_~SqrtR__xnp1~0 (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_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-07 01:06:10,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:06:10,232 INFO L93 Difference]: Finished difference Result 72 states and 94 transitions. [2021-11-07 01:06:10,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 01:06:10,329 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 states have internal predecessors, (43), 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 [2021-11-07 01:06:10,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:06:10,330 INFO L225 Difference]: With dead ends: 72 [2021-11-07 01:06:10,330 INFO L226 Difference]: Without dead ends: 49 [2021-11-07 01:06:10,331 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 75.7s TimeCoverageRelationStatistics Valid=75, Invalid=140, Unknown=23, NotChecked=518, Total=756 [2021-11-07 01:06:10,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-11-07 01:06:10,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 38. [2021-11-07 01:06:10,339 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) [2021-11-07 01:06:10,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2021-11-07 01:06:10,340 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 18 [2021-11-07 01:06:10,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:06:10,341 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions. [2021-11-07 01:06:10,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 states have internal predecessors, (43), 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) [2021-11-07 01:06:10,341 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2021-11-07 01:06:10,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-07 01:06:10,342 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:06:10,342 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:06:10,558 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forcibly destroying the process [2021-11-07 01:06:10,577 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-07 01:06:10,591 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2021-11-07 01:06:10,833 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-07 01:06:10,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/cvc4 --incremental --print-success --lang smt,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 01:06:10,978 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:06:10,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:06:10,979 INFO L85 PathProgramCache]: Analyzing trace with hash 885500251, now seen corresponding path program 1 times [2021-11-07 01:06:10,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 01:06:10,979 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [551420990] [2021-11-07 01:06:10,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:06:10,979 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 01:06:10,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 01:06:10,982 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 01:06:10,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-07 01:06:14,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:06:14,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-07 01:06:14,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:06:17,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:06:17,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:06:25,973 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~SqrtR__xn~0 (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 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0) (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) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)))) (fp.lt (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~SqrtR__xn~0)) (fp.neg (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse0 .cse0)))))) is different from false [2021-11-07 01:06:28,414 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~SqrtR__xn~0 (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 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0) (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) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)))) (fp.lt (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~SqrtR__xn~0)) (fp.neg (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse0 .cse0)))))) is different from true [2021-11-07 01:06:54,600 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (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 .cse1) .cse1) (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) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)))) (fp.lt (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode .cse0 .cse1)) (fp.neg (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse0 .cse0))))))) is different from false [2021-11-07 01:06:56,820 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (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 .cse1) .cse1) (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) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)))) (fp.lt (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode .cse0 .cse1)) (fp.neg (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse0 .cse0))))))) is different from true [2021-11-07 01:07:03,528 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (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 .cse1) .cse1) (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) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)))) (fp.lt (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode .cse0 .cse1)) (fp.neg (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse0 .cse0))))))) is different from false [2021-11-07 01:07:05,753 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (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 .cse1) .cse1) (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) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)))) (fp.lt (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode .cse0 .cse1)) (fp.neg (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse0 .cse0))))))) is different from true [2021-11-07 01:07:08,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:07:08,024 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 01:07:08,025 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [551420990] [2021-11-07 01:07:08,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [551420990] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:07:08,025 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:07:08,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2021-11-07 01:07:08,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756344023] [2021-11-07 01:07:08,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:07:08,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 01:07:08,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:07:08,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=48, Unknown=6, NotChecked=48, Total=132 [2021-11-07 01:07:08,028 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. Second operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 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) [2021-11-07 01:07:10,409 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= c_ULTIMATE.start_main_~main__d~0 .cse0) (= c_~_EPS~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0))) (not (let ((.cse1 (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 .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) .cse0) .cse0))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)))) (fp.lt (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode .cse1 .cse0)) (fp.neg (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse1 .cse1)))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-07 01:07:12,666 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= c_~_EPS~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0))) (= .cse0 c_ULTIMATE.start_main_~SqrtR__Input~0) (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse1 (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 .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) .cse0) .cse0))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)))) (fp.lt (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode .cse1 .cse0)) (fp.neg (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse1 .cse1)))))))) is different from true [2021-11-07 01:07:15,141 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (let ((.cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~SqrtR__xn~0 (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 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0) (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) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)))) (fp.lt (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~SqrtR__xn~0)) (fp.neg (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse0 .cse0)))))) (= c_~_EPS~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0))) (= .cse1 c_ULTIMATE.start_main_~SqrtR__Input~0) (= c_currentRoundingMode roundNearestTiesToEven) (= .cse1 c_ULTIMATE.start_main_~SqrtR__xn~0))) is different from true [2021-11-07 01:07:34,030 WARN L228 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2021-11-07 01:07:34,035 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2021-11-07 01:07:34,082 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-11-07 01:07:34,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 01:07:34,232 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_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:312) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:158) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPrecondition(IncrementalHoareTripleChecker.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:269) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:281) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.releaseLock(ProtectiveHoareTripleChecker.java:93) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.releaseLock(EfficientHoareTripleChecker.java:162) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:201) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:886) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:783) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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: java.io.IOException: Broken pipe at java.base/java.io.FileOutputStream.writeBytes(Native Method) at java.base/java.io.FileOutputStream.write(FileOutputStream.java:354) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:318) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:153) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:251) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:257) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:156) ... 35 more [2021-11-07 01:07:34,234 INFO L168 Benchmark]: Toolchain (without parser) took 811496.52 ms. Allocated memory was 58.7 MB in the beginning and 71.3 MB in the end (delta: 12.6 MB). Free memory was 37.2 MB in the beginning and 25.7 MB in the end (delta: 11.5 MB). Peak memory consumption was 23.9 MB. Max. memory is 16.1 GB. [2021-11-07 01:07:34,235 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 58.7 MB. Free memory is still 40.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 01:07:34,235 INFO L168 Benchmark]: CACSL2BoogieTranslator took 347.95 ms. Allocated memory is still 58.7 MB. Free memory was 37.1 MB in the beginning and 42.0 MB in the end (delta: -4.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-11-07 01:07:34,236 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.72 ms. Allocated memory is still 58.7 MB. Free memory was 42.0 MB in the beginning and 40.3 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 01:07:34,236 INFO L168 Benchmark]: Boogie Preprocessor took 56.54 ms. Allocated memory is still 58.7 MB. Free memory was 40.3 MB in the beginning and 39.0 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 01:07:34,236 INFO L168 Benchmark]: RCFGBuilder took 9490.29 ms. Allocated memory is still 58.7 MB. Free memory was 39.0 MB in the beginning and 28.1 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-11-07 01:07:34,237 INFO L168 Benchmark]: TraceAbstraction took 801528.98 ms. Allocated memory was 58.7 MB in the beginning and 71.3 MB in the end (delta: 12.6 MB). Free memory was 27.7 MB in the beginning and 25.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 16.2 MB. Max. memory is 16.1 GB. [2021-11-07 01:07:34,239 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.29 ms. Allocated memory is still 58.7 MB. Free memory is still 40.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 347.95 ms. Allocated memory is still 58.7 MB. Free memory was 37.1 MB in the beginning and 42.0 MB in the end (delta: -4.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 63.72 ms. Allocated memory is still 58.7 MB. Free memory was 42.0 MB in the beginning and 40.3 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 56.54 ms. Allocated memory is still 58.7 MB. Free memory was 40.3 MB in the beginning and 39.0 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 9490.29 ms. Allocated memory is still 58.7 MB. Free memory was 39.0 MB in the beginning and 28.1 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 801528.98 ms. Allocated memory was 58.7 MB in the beginning and 71.3 MB in the end (delta: 12.6 MB). Free memory was 27.7 MB in the beginning and 25.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 16.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:312) 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_e725df16-12ae-4f69-b227-c505a1ea2b40/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken