./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_0662b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a428630b-096e-4adb-8df5-f86ca8e87ecb/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a428630b-096e-4adb-8df5-f86ca8e87ecb/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a428630b-096e-4adb-8df5-f86ca8e87ecb/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a428630b-096e-4adb-8df5-f86ca8e87ecb/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0662b.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a428630b-096e-4adb-8df5-f86ca8e87ecb/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a428630b-096e-4adb-8df5-f86ca8e87ecb/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 427f5a1297639616b7c4f6533641105ea064cfe8 ............................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a428630b-096e-4adb-8df5-f86ca8e87ecb/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a428630b-096e-4adb-8df5-f86ca8e87ecb/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a428630b-096e-4adb-8df5-f86ca8e87ecb/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a428630b-096e-4adb-8df5-f86ca8e87ecb/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0662b.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a428630b-096e-4adb-8df5-f86ca8e87ecb/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a428630b-096e-4adb-8df5-f86ca8e87ecb/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 427f5a1297639616b7c4f6533641105ea064cfe8 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: NullPointerException: null --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:26:35,011 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:26:35,012 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:26:35,026 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:26:35,029 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:26:35,031 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:26:35,033 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:26:35,040 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:26:35,042 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:26:35,043 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:26:35,044 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:26:35,045 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:26:35,046 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:26:35,047 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:26:35,047 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:26:35,048 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:26:35,049 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:26:35,050 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:26:35,052 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:26:35,054 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:26:35,055 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:26:35,061 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:26:35,063 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:26:35,065 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:26:35,067 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:26:35,070 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:26:35,071 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:26:35,072 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:26:35,073 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:26:35,074 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:26:35,075 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:26:35,076 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:26:35,076 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:26:35,077 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:26:35,077 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:26:35,078 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:26:35,078 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:26:35,078 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:26:35,079 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:26:35,079 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:26:35,080 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:26:35,081 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a428630b-096e-4adb-8df5-f86ca8e87ecb/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:26:35,101 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:26:35,102 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:26:35,103 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:26:35,103 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:26:35,108 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:26:35,108 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:26:35,109 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:26:35,109 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:26:35,109 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:26:35,109 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:26:35,111 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:26:35,111 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:26:35,111 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:26:35,111 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:26:35,112 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:26:35,112 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:26:35,112 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:26:35,113 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:26:35,113 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:26:35,113 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:26:35,113 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:26:35,114 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:26:35,114 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:26:35,114 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:26:35,115 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:26:35,115 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:26:35,115 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:26:35,115 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:26:35,116 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-vcloud-master/worker/run_dir_a428630b-096e-4adb-8df5-f86ca8e87ecb/bin/uautomizer 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(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 427f5a1297639616b7c4f6533641105ea064cfe8 [2019-11-15 23:26:35,158 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:26:35,175 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:26:35,178 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:26:35,180 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:26:35,180 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:26:35,181 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a428630b-096e-4adb-8df5-f86ca8e87ecb/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_0662b.c [2019-11-15 23:26:35,244 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a428630b-096e-4adb-8df5-f86ca8e87ecb/bin/uautomizer/data/864238f1b/4510d458a92543908a22cb7ba07d9be7/FLAG099dc2cb6 [2019-11-15 23:26:35,674 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:26:35,676 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a428630b-096e-4adb-8df5-f86ca8e87ecb/sv-benchmarks/c/float-newlib/double_req_bl_0662b.c [2019-11-15 23:26:35,685 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a428630b-096e-4adb-8df5-f86ca8e87ecb/bin/uautomizer/data/864238f1b/4510d458a92543908a22cb7ba07d9be7/FLAG099dc2cb6 [2019-11-15 23:26:35,996 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a428630b-096e-4adb-8df5-f86ca8e87ecb/bin/uautomizer/data/864238f1b/4510d458a92543908a22cb7ba07d9be7 [2019-11-15 23:26:35,998 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:26:35,999 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:26:36,000 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:26:36,000 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:26:36,003 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:26:36,004 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:26:35" (1/1) ... [2019-11-15 23:26:36,007 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39974b1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:36, skipping insertion in model container [2019-11-15 23:26:36,007 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:26:35" (1/1) ... [2019-11-15 23:26:36,014 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:26:36,062 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:26:36,387 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:26:36,394 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:26:36,451 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:26:36,476 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:26:36,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:36 WrapperNode [2019-11-15 23:26:36,477 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:26:36,478 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:26:36,478 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:26:36,478 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:26:36,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:36" (1/1) ... [2019-11-15 23:26:36,501 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:36" (1/1) ... [2019-11-15 23:26:36,544 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:26:36,545 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:26:36,545 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:26:36,545 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:26:36,554 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:36" (1/1) ... [2019-11-15 23:26:36,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:36" (1/1) ... [2019-11-15 23:26:36,563 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:36" (1/1) ... [2019-11-15 23:26:36,563 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:36" (1/1) ... [2019-11-15 23:26:36,588 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:36" (1/1) ... [2019-11-15 23:26:36,598 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:36" (1/1) ... [2019-11-15 23:26:36,602 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:36" (1/1) ... [2019-11-15 23:26:36,609 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:26:36,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:26:36,610 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:26:36,610 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:26:36,611 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a428630b-096e-4adb-8df5-f86ca8e87ecb/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:26:36,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:26:36,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-11-15 23:26:36,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:26:36,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-15 23:26:36,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:26:36,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:26:36,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:26:36,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2019-11-15 23:26:36,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:26:37,414 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:26:37,414 INFO L284 CfgBuilder]: Removed 44 assume(true) statements. [2019-11-15 23:26:37,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:26:37 BoogieIcfgContainer [2019-11-15 23:26:37,416 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:26:37,417 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:26:37,417 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:26:37,420 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:26:37,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:26:35" (1/3) ... [2019-11-15 23:26:37,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@426a456c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:26:37, skipping insertion in model container [2019-11-15 23:26:37,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:36" (2/3) ... [2019-11-15 23:26:37,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@426a456c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:26:37, skipping insertion in model container [2019-11-15 23:26:37,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:26:37" (3/3) ... [2019-11-15 23:26:37,423 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_0662b.c [2019-11-15 23:26:37,433 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:26:37,440 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:26:37,453 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:26:37,491 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:26:37,491 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:26:37,491 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:26:37,491 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:26:37,491 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:26:37,492 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:26:37,492 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:26:37,492 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:26:37,517 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states. [2019-11-15 23:26:37,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-15 23:26:37,525 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:26:37,526 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:26:37,528 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:26:37,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:37,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1059427896, now seen corresponding path program 1 times [2019-11-15 23:26:37,542 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:37,542 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165425287] [2019-11-15 23:26:37,543 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:37,543 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:37,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:37,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:26:37,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:26:37,704 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165425287] [2019-11-15 23:26:37,705 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:26:37,705 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:26:37,705 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80787281] [2019-11-15 23:26:37,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-15 23:26:37,709 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:26:37,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 23:26:37,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 23:26:37,722 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 2 states. [2019-11-15 23:26:37,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:26:37,749 INFO L93 Difference]: Finished difference Result 227 states and 382 transitions. [2019-11-15 23:26:37,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 23:26:37,751 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-11-15 23:26:37,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:26:37,763 INFO L225 Difference]: With dead ends: 227 [2019-11-15 23:26:37,763 INFO L226 Difference]: Without dead ends: 111 [2019-11-15 23:26:37,767 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 23:26:37,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-15 23:26:37,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-11-15 23:26:37,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-15 23:26:37,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2019-11-15 23:26:37,819 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 11 [2019-11-15 23:26:37,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:26:37,819 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2019-11-15 23:26:37,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-15 23:26:37,820 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2019-11-15 23:26:37,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-15 23:26:37,821 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:26:37,822 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:26:37,822 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:26:37,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:37,822 INFO L82 PathProgramCache]: Analyzing trace with hash -7417919, now seen corresponding path program 1 times [2019-11-15 23:26:37,823 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:37,823 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082770560] [2019-11-15 23:26:37,823 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:37,823 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:37,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:38,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:38,083 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:26:38,088 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 23:26:38,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:26:38 BoogieIcfgContainer [2019-11-15 23:26:38,157 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:26:38,158 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:26:38,158 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:26:38,159 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:26:38,159 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:26:37" (3/4) ... [2019-11-15 23:26:38,163 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 23:26:38,163 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:26:38,165 INFO L168 Benchmark]: Toolchain (without parser) took 2165.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 946.1 MB in the beginning and 1.0 GB in the end (delta: -58.4 MB). Peak memory consumption was 69.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:26:38,166 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:26:38,168 INFO L168 Benchmark]: CACSL2BoogieTranslator took 477.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -163.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:26:38,168 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:26:38,169 INFO L168 Benchmark]: Boogie Preprocessor took 64.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:26:38,170 INFO L168 Benchmark]: RCFGBuilder took 806.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.7 MB). Peak memory consumption was 56.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:26:38,171 INFO L168 Benchmark]: TraceAbstraction took 740.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 41.6 MB). Peak memory consumption was 41.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:26:38,171 INFO L168 Benchmark]: Witness Printer took 5.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:26:38,180 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.53 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 477.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -163.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 64.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 806.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.7 MB). Peak memory consumption was 56.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 740.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 41.6 MB). Peak memory consumption was 41.6 MB. Max. memory is 11.5 GB. * Witness Printer took 5.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 260]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 162, overapproximation of someUnaryDOUBLEoperation at line 52, overapproximation of bitwiseAnd at line 160, overapproximation of someBinaryArithmeticDOUBLEoperation at line 163, overapproximation of someBinaryDOUBLEComparisonOperation at line 259. Possible FailurePath: [L37-L42] static const double atanhi_atan[] = { 4.63647609000806093515e-01, 7.85398163397448278999e-01, 9.82793723247329054082e-01, 1.57079632679489655800e+00, }; [L44-L49] static const double atanlo_atan[] = { 2.26987774529616870924e-17, 3.06161699786838301793e-17, 1.39033110312309984516e-17, 6.12323399573676603587e-17, }; [L51-L58] static const double aT_atan[] = { 3.33333333333329318027e-01, -1.99999999998764832476e-01, 1.42857142725034663711e-01, -1.11111104054623557880e-01, 9.09088713343650656196e-02, -7.69187620504482999495e-02, 6.66107313738753120669e-02, -5.83357013379057348645e-02, 4.97687799461593236017e-02, -3.65315727442169155270e-02, 1.62858201153657823623e-02, }; [L60-L62] static const double one_atan = 1.0, pi_o_4 = 7.8539816339744827900E-01, pi_o_2 = 1.5707963267948965580E+00, pi = 3.1415926535897931160E+00, huge_atan = 1.0e300; [L139-L140] static const double tiny_atan2 = 1.0e-300, zero_atan2 = 0.0, pi_lo_atan2 = 1.2246467991473531772E-16; VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L251] double x = 0.0; [L252] double y = __VERIFIER_nondet_double(); [L254] COND TRUE y < 0.0 [L143] double z; [L144] __int32_t k, m, hx, hy, ix, iy; [L145] __uint32_t lx, ly; VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L148] ieee_double_shape_type ew_u; [L149] ew_u.value = (x) [L150] EXPR ew_u.parts.msw [L150] (hx) = ew_u.parts.msw [L151] EXPR ew_u.parts.lsw [L151] (lx) = ew_u.parts.lsw [L153] ix = hx & 0x7fffffff VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L155] ieee_double_shape_type ew_u; [L156] ew_u.value = (y) [L157] EXPR ew_u.parts.msw [L157] (hy) = ew_u.parts.msw [L158] EXPR ew_u.parts.lsw [L158] (ly) = ew_u.parts.lsw [L160] iy = hy & 0x7fffffff VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L161-L162] COND TRUE ((ix | ((lx | -lx) >> 31)) > 0x7ff00000) || ((iy | ((ly | -ly) >> 31)) > 0x7ff00000) [L163] return x + y; VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L256] double res = __ieee754_atan2(y, x); [L259] COND TRUE res != -pi_o_2 VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L260] __VERIFIER_error() VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 115 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 164 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=0, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 100 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, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-15 23:26:40,470 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:26:40,472 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:26:40,492 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:26:40,493 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:26:40,494 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:26:40,496 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:26:40,507 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:26:40,511 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:26:40,514 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:26:40,516 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:26:40,518 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:26:40,519 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:26:40,520 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:26:40,521 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:26:40,523 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:26:40,524 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:26:40,526 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:26:40,529 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:26:40,533 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:26:40,536 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:26:40,538 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:26:40,540 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:26:40,542 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:26:40,546 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:26:40,546 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:26:40,546 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:26:40,548 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:26:40,548 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:26:40,551 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:26:40,551 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:26:40,552 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:26:40,553 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:26:40,554 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:26:40,555 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:26:40,555 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:26:40,556 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:26:40,556 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:26:40,557 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:26:40,559 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:26:40,560 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:26:40,561 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a428630b-096e-4adb-8df5-f86ca8e87ecb/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-15 23:26:40,590 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:26:40,601 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:26:40,602 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:26:40,602 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:26:40,602 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:26:40,603 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:26:40,603 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:26:40,603 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:26:40,603 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:26:40,604 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:26:40,604 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:26:40,604 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:26:40,604 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 23:26:40,605 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 23:26:40,605 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:26:40,605 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:26:40,605 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:26:40,606 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:26:40,606 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:26:40,607 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:26:40,607 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:26:40,607 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:26:40,607 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:26:40,608 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:26:40,608 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:26:40,608 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:26:40,609 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 23:26:40,609 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 23:26:40,610 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:26:40,610 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 23:26:40,610 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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-vcloud-master/worker/run_dir_a428630b-096e-4adb-8df5-f86ca8e87ecb/bin/uautomizer 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(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 427f5a1297639616b7c4f6533641105ea064cfe8 [2019-11-15 23:26:40,659 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:26:40,674 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:26:40,676 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:26:40,678 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:26:40,678 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:26:40,679 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a428630b-096e-4adb-8df5-f86ca8e87ecb/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_0662b.c [2019-11-15 23:26:40,733 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a428630b-096e-4adb-8df5-f86ca8e87ecb/bin/uautomizer/data/50619126d/a91f9059da034bf898a97a1c1f52f2bb/FLAG00258571e [2019-11-15 23:26:41,129 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:26:41,130 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a428630b-096e-4adb-8df5-f86ca8e87ecb/sv-benchmarks/c/float-newlib/double_req_bl_0662b.c [2019-11-15 23:26:41,137 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a428630b-096e-4adb-8df5-f86ca8e87ecb/bin/uautomizer/data/50619126d/a91f9059da034bf898a97a1c1f52f2bb/FLAG00258571e [2019-11-15 23:26:41,562 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a428630b-096e-4adb-8df5-f86ca8e87ecb/bin/uautomizer/data/50619126d/a91f9059da034bf898a97a1c1f52f2bb [2019-11-15 23:26:41,564 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:26:41,565 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:26:41,575 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:26:41,575 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:26:41,579 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:26:41,580 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:26:41" (1/1) ... [2019-11-15 23:26:41,582 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34074b27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:41, skipping insertion in model container [2019-11-15 23:26:41,582 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:26:41" (1/1) ... [2019-11-15 23:26:41,590 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:26:41,639 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:26:42,049 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:26:42,072 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:26:42,157 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:26:42,189 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:26:42,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:42 WrapperNode [2019-11-15 23:26:42,190 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:26:42,191 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:26:42,191 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:26:42,191 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:26:42,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:42" (1/1) ... [2019-11-15 23:26:42,217 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:42" (1/1) ... [2019-11-15 23:26:42,272 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:26:42,272 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:26:42,273 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:26:42,273 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:26:42,280 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:42" (1/1) ... [2019-11-15 23:26:42,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:42" (1/1) ... [2019-11-15 23:26:42,291 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:42" (1/1) ... [2019-11-15 23:26:42,291 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:42" (1/1) ... [2019-11-15 23:26:42,321 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:42" (1/1) ... [2019-11-15 23:26:42,344 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:42" (1/1) ... [2019-11-15 23:26:42,349 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:42" (1/1) ... [2019-11-15 23:26:42,365 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:26:42,372 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:26:42,372 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:26:42,372 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:26:42,373 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a428630b-096e-4adb-8df5-f86ca8e87ecb/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:26:42,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2019-11-15 23:26:42,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-11-15 23:26:42,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:26:42,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2019-11-15 23:26:42,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 23:26:42,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:26:42,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:26:42,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 23:26:42,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:27:19,798 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:27:19,798 INFO L284 CfgBuilder]: Removed 44 assume(true) statements. [2019-11-15 23:27:19,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:27:19 BoogieIcfgContainer [2019-11-15 23:27:19,800 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:27:19,801 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:27:19,801 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:27:19,804 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:27:19,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:26:41" (1/3) ... [2019-11-15 23:27:19,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3700f61f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:27:19, skipping insertion in model container [2019-11-15 23:27:19,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:42" (2/3) ... [2019-11-15 23:27:19,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3700f61f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:27:19, skipping insertion in model container [2019-11-15 23:27:19,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:27:19" (3/3) ... [2019-11-15 23:27:19,808 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_0662b.c [2019-11-15 23:27:19,819 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:27:19,828 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:27:19,841 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:27:19,867 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:27:19,867 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:27:19,867 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:27:19,867 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:27:19,868 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:27:19,868 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:27:19,868 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:27:19,869 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:27:19,886 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states. [2019-11-15 23:27:19,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-15 23:27:19,893 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:27:19,894 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:27:19,896 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:27:19,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:19,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1059427896, now seen corresponding path program 1 times [2019-11-15 23:27:19,914 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:27:19,915 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1118246034] [2019-11-15 23:27:19,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a428630b-096e-4adb-8df5-f86ca8e87ecb/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-15 23:27:20,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:27:20,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-15 23:27:20,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:27:20,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:27:20,329 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:27:20,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:27:20,334 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1118246034] [2019-11-15 23:27:20,334 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:27:20,334 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-15 23:27:20,335 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608082960] [2019-11-15 23:27:20,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-15 23:27:20,339 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:27:20,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 23:27:20,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 23:27:20,354 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 2 states. [2019-11-15 23:27:20,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:27:20,384 INFO L93 Difference]: Finished difference Result 227 states and 382 transitions. [2019-11-15 23:27:20,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 23:27:20,385 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-11-15 23:27:20,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:27:20,398 INFO L225 Difference]: With dead ends: 227 [2019-11-15 23:27:20,398 INFO L226 Difference]: Without dead ends: 111 [2019-11-15 23:27:20,402 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 23:27:20,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-15 23:27:20,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-11-15 23:27:20,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-15 23:27:20,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2019-11-15 23:27:20,447 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 11 [2019-11-15 23:27:20,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:27:20,448 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2019-11-15 23:27:20,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-15 23:27:20,448 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2019-11-15 23:27:20,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-15 23:27:20,449 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:27:20,449 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:27:20,652 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-15 23:27:20,652 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:27:20,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:20,653 INFO L82 PathProgramCache]: Analyzing trace with hash -7417919, now seen corresponding path program 1 times [2019-11-15 23:27:20,653 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:27:20,654 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [936539074] [2019-11-15 23:27:20,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a428630b-096e-4adb-8df5-f86ca8e87ecb/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-15 23:27:21,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:27:21,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-15 23:27:21,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:27:21,337 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2019-11-15 23:27:21,374 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-11-15 23:27:21,375 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:27:21,403 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:27:21,417 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:27:21,418 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2019-11-15 23:27:21,419 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:27:21,425 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:27:21,426 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:27:21,464 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:27:21,466 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:27:21,466 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:61, output treesize:33 [2019-11-15 23:27:21,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:27:21,881 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:27:22,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:27:22,212 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:27:22,213 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 61 [2019-11-15 23:27:22,257 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:27:22,258 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 41 [2019-11-15 23:27:22,259 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:27:22,290 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:27:22,313 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2019-11-15 23:27:22,314 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:27:22,340 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:27:22,341 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:27:22,368 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:27:22,369 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 44 [2019-11-15 23:27:22,402 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:27:22,402 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2019-11-15 23:27:22,403 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 23:27:22,424 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:27:22,425 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:27:22,462 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:27:22,463 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-11-15 23:27:22,464 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:108, output treesize:50 [2019-11-15 23:27:22,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:27:23,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:27:23,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:27:23,086 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [936539074] [2019-11-15 23:27:23,086 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:27:23,086 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2019-11-15 23:27:23,087 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605358362] [2019-11-15 23:27:23,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 23:27:23,088 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:27:23,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 23:27:23,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:27:23,089 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand 14 states. [2019-11-15 23:27:24,219 WARN L191 SmtUtils]: Spent 587.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-15 23:27:25,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:27:25,716 INFO L93 Difference]: Finished difference Result 167 states and 236 transitions. [2019-11-15 23:27:26,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:27:26,110 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2019-11-15 23:27:26,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:27:26,112 INFO L225 Difference]: With dead ends: 167 [2019-11-15 23:27:26,112 INFO L226 Difference]: Without dead ends: 68 [2019-11-15 23:27:26,114 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-11-15 23:27:26,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-15 23:27:26,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-15 23:27:26,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-15 23:27:26,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 85 transitions. [2019-11-15 23:27:26,127 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 85 transitions. Word has length 13 [2019-11-15 23:27:26,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:27:26,128 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 85 transitions. [2019-11-15 23:27:26,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 23:27:26,128 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 85 transitions. [2019-11-15 23:27:26,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 23:27:26,129 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:27:26,129 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:27:26,344 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-15 23:27:26,344 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:27:26,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:26,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1226339013, now seen corresponding path program 1 times [2019-11-15 23:27:26,345 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:27:26,345 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1135710144] [2019-11-15 23:27:26,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a428630b-096e-4adb-8df5-f86ca8e87ecb/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-15 23:27:26,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:27:26,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:27:26,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:27:26,882 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-11-15 23:27:27,177 WARN L191 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-11-15 23:27:27,430 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-11-15 23:27:27,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:27:27,434 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:27:29,720 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-11-15 23:27:29,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:27:29,725 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1135710144] [2019-11-15 23:27:29,725 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:27:29,725 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-15 23:27:29,726 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961587162] [2019-11-15 23:27:29,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:27:29,726 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:27:29,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:27:29,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:27:29,727 INFO L87 Difference]: Start difference. First operand 68 states and 85 transitions. Second operand 10 states. [2019-11-15 23:27:30,179 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-11-15 23:27:30,567 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-11-15 23:27:31,916 WARN L191 SmtUtils]: Spent 405.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-11-15 23:27:32,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:27:32,985 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2019-11-15 23:27:32,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:27:32,986 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-11-15 23:27:32,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:27:32,987 INFO L225 Difference]: With dead ends: 72 [2019-11-15 23:27:32,987 INFO L226 Difference]: Without dead ends: 66 [2019-11-15 23:27:32,988 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:27:32,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-15 23:27:32,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-11-15 23:27:32,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-15 23:27:32,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2019-11-15 23:27:32,998 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 18 [2019-11-15 23:27:32,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:27:32,999 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2019-11-15 23:27:32,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:27:32,999 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2019-11-15 23:27:33,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 23:27:33,000 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:27:33,000 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:27:33,216 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-15 23:27:33,216 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:27:33,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:33,216 INFO L82 PathProgramCache]: Analyzing trace with hash 48409528, now seen corresponding path program 1 times [2019-11-15 23:27:33,217 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:27:33,217 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1553941783] [2019-11-15 23:27:33,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a428630b-096e-4adb-8df5-f86ca8e87ecb/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-15 23:27:33,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:27:33,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:27:33,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:27:33,942 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-11-15 23:27:34,103 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-11-15 23:27:34,337 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-11-15 23:27:34,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:27:34,341 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:27:37,024 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-11-15 23:27:37,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:27:37,028 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1553941783] [2019-11-15 23:27:37,028 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:27:37,028 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-15 23:27:37,028 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292586222] [2019-11-15 23:27:37,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:27:37,029 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:27:37,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:27:37,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:27:37,030 INFO L87 Difference]: Start difference. First operand 66 states and 82 transitions. Second operand 10 states. [2019-11-15 23:27:37,735 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-11-15 23:27:38,593 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-11-15 23:27:39,139 WARN L191 SmtUtils]: Spent 339.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-11-15 23:27:40,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:27:40,075 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2019-11-15 23:27:40,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:27:40,076 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-15 23:27:40,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:27:40,078 INFO L225 Difference]: With dead ends: 70 [2019-11-15 23:27:40,078 INFO L226 Difference]: Without dead ends: 64 [2019-11-15 23:27:40,078 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:27:40,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-15 23:27:40,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-11-15 23:27:40,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-15 23:27:40,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2019-11-15 23:27:40,088 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 20 [2019-11-15 23:27:40,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:27:40,088 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2019-11-15 23:27:40,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:27:40,088 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2019-11-15 23:27:40,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 23:27:40,089 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:27:40,090 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:27:40,304 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-15 23:27:40,304 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:27:40,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:40,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1297758981, now seen corresponding path program 1 times [2019-11-15 23:27:40,305 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:27:40,305 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1959341524] [2019-11-15 23:27:40,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a428630b-096e-4adb-8df5-f86ca8e87ecb/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-15 23:27:40,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:27:40,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 23:27:40,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:27:41,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:27:41,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:27:41,905 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:27:41,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:27:42,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:27:42,235 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1959341524] [2019-11-15 23:27:42,235 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:27:42,235 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8, 9] imperfect sequences [] total 14 [2019-11-15 23:27:42,235 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639378287] [2019-11-15 23:27:42,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 23:27:42,236 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:27:42,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 23:27:42,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:27:42,236 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 14 states. [2019-11-15 23:27:44,400 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 15 [2019-11-15 23:27:49,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:27:49,076 INFO L93 Difference]: Finished difference Result 83 states and 100 transitions. [2019-11-15 23:27:49,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:27:49,077 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2019-11-15 23:27:49,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:27:49,078 INFO L225 Difference]: With dead ends: 83 [2019-11-15 23:27:49,078 INFO L226 Difference]: Without dead ends: 79 [2019-11-15 23:27:49,079 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2019-11-15 23:27:49,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-15 23:27:49,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 68. [2019-11-15 23:27:49,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-15 23:27:49,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 84 transitions. [2019-11-15 23:27:49,088 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 84 transitions. Word has length 21 [2019-11-15 23:27:49,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:27:49,089 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 84 transitions. [2019-11-15 23:27:49,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 23:27:49,089 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2019-11-15 23:27:49,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 23:27:49,090 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:27:49,090 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:27:49,290 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-15 23:27:49,291 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:27:49,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:49,291 INFO L82 PathProgramCache]: Analyzing trace with hash -394512707, now seen corresponding path program 1 times [2019-11-15 23:27:49,291 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:27:49,292 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [707364100] [2019-11-15 23:27:49,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a428630b-096e-4adb-8df5-f86ca8e87ecb/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-15 23:27:49,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:27:49,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 23:27:49,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:27:50,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:27:50,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:27:50,083 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:27:50,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:27:50,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:27:50,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:27:50,309 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [707364100] [2019-11-15 23:27:50,309 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:27:50,309 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2019-11-15 23:27:50,309 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623558146] [2019-11-15 23:27:50,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-15 23:27:50,310 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:27:50,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 23:27:50,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:27:50,310 INFO L87 Difference]: Start difference. First operand 68 states and 84 transitions. Second operand 13 states. [2019-11-15 23:27:52,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:27:52,941 INFO L93 Difference]: Finished difference Result 76 states and 90 transitions. [2019-11-15 23:27:52,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:27:52,941 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-11-15 23:27:52,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:27:52,942 INFO L225 Difference]: With dead ends: 76 [2019-11-15 23:27:52,942 INFO L226 Difference]: Without dead ends: 68 [2019-11-15 23:27:52,943 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2019-11-15 23:27:52,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-15 23:27:52,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2019-11-15 23:27:52,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-15 23:27:52,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2019-11-15 23:27:52,951 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 24 [2019-11-15 23:27:52,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:27:52,951 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2019-11-15 23:27:52,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-15 23:27:52,952 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2019-11-15 23:27:52,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 23:27:52,953 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:27:52,953 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:27:53,153 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-15 23:27:53,153 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:27:53,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:53,154 INFO L82 PathProgramCache]: Analyzing trace with hash -2912589, now seen corresponding path program 1 times [2019-11-15 23:27:53,154 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:27:53,154 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [693460962] [2019-11-15 23:27:53,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a428630b-096e-4adb-8df5-f86ca8e87ecb/bin/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-15 23:27:53,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:27:53,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 23:27:53,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:27:53,856 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-11-15 23:27:54,353 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-11-15 23:27:54,368 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2019-11-15 23:27:54,375 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:27:54,380 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:27:54,381 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:27:54,636 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-11-15 23:27:54,637 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:27:54,637 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:27:54,638 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:106, output treesize:67 [2019-11-15 23:27:54,865 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-15 23:27:55,176 WARN L191 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-15 23:27:55,465 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-15 23:27:55,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:27:55,478 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:27:55,674 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2019-11-15 23:27:55,678 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:27:55,682 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:27:55,682 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:27:55,696 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:27:55,696 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:27:55,697 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:72, output treesize:36 [2019-11-15 23:28:00,974 WARN L191 SmtUtils]: Spent 735.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-11-15 23:28:00,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:28:00,997 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [693460962] [2019-11-15 23:28:00,998 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:00,998 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 13 [2019-11-15 23:28:00,998 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16960285] [2019-11-15 23:28:00,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 23:28:00,999 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:28:00,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 23:28:00,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:28:01,000 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand 14 states. [2019-11-15 23:28:01,895 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-11-15 23:28:02,161 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-11-15 23:28:02,774 WARN L191 SmtUtils]: Spent 499.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-15 23:28:03,671 WARN L191 SmtUtils]: Spent 779.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-15 23:28:04,091 WARN L191 SmtUtils]: Spent 360.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-15 23:28:04,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:28:04,268 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2019-11-15 23:28:04,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:28:04,268 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-11-15 23:28:04,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:28:04,269 INFO L225 Difference]: With dead ends: 73 [2019-11-15 23:28:04,269 INFO L226 Difference]: Without dead ends: 61 [2019-11-15 23:28:04,270 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2019-11-15 23:28:04,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-15 23:28:04,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-11-15 23:28:04,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-15 23:28:04,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2019-11-15 23:28:04,278 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 27 [2019-11-15 23:28:04,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:28:04,278 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2019-11-15 23:28:04,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 23:28:04,279 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2019-11-15 23:28:04,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 23:28:04,280 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:28:04,281 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:28:04,496 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-15 23:28:04,496 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:28:04,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:04,497 INFO L82 PathProgramCache]: Analyzing trace with hash -490549731, now seen corresponding path program 1 times [2019-11-15 23:28:04,497 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:28:04,497 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [494329418] [2019-11-15 23:28:04,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a428630b-096e-4adb-8df5-f86ca8e87ecb/bin/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-15 23:28:05,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:05,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-15 23:28:05,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:28:05,956 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2019-11-15 23:28:05,969 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2019-11-15 23:28:05,970 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:28:05,973 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:28:05,974 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:28:05,997 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:28:05,998 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 23:28:05,998 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:67, output treesize:37 [2019-11-15 23:28:06,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:28:06,673 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:28:07,227 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2019-11-15 23:28:07,232 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-15 23:28:07,232 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:28:07,235 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:28:07,235 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:28:07,244 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:28:07,245 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:28:07,245 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:35 [2019-11-15 23:28:41,152 WARN L191 SmtUtils]: Spent 2.42 s on a formula simplification that was a NOOP. DAG size: 33 [2019-11-15 23:28:43,594 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_16 (_ BitVec 32)) (ULTIMATE.start___ieee754_atan2_~y (_ FloatingPoint 11 53)) (|v_skolemized_q#valueAsBitvector_36| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_35| (_ BitVec 64))) (or (not (= (fp.div roundNearestTiesToEven ULTIMATE.start___ieee754_atan2_~y c_ULTIMATE.start_main_~x~0) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_35|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_35|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_35|)))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_36|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_36|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_36|)) (let ((.cse0 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_35|)) v_arrayElimCell_16))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (bvsge (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_36|)) (_ bv1141899264 32)))) is different from true [2019-11-15 23:28:43,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:28:43,614 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [494329418] [2019-11-15 23:28:43,614 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:43,614 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [] total 20 [2019-11-15 23:28:43,614 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715357142] [2019-11-15 23:28:43,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-15 23:28:43,615 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:28:43,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-15 23:28:43,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=4, NotChecked=34, Total=380 [2019-11-15 23:28:43,616 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 20 states. [2019-11-15 23:28:49,099 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-11-15 23:28:49,549 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-15 23:28:50,376 WARN L191 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-15 23:28:51,183 WARN L191 SmtUtils]: Spent 559.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-15 23:28:51,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:28:51,883 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2019-11-15 23:28:51,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:28:51,895 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2019-11-15 23:28:51,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:28:51,896 INFO L225 Difference]: With dead ends: 74 [2019-11-15 23:28:51,896 INFO L226 Difference]: Without dead ends: 44 [2019-11-15 23:28:51,897 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 40.9s TimeCoverageRelationStatistics Valid=175, Invalid=527, Unknown=4, NotChecked=50, Total=756 [2019-11-15 23:28:51,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-15 23:28:51,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-11-15 23:28:51,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-15 23:28:51,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2019-11-15 23:28:51,906 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 36 [2019-11-15 23:28:51,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:28:51,907 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2019-11-15 23:28:51,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-15 23:28:51,907 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2019-11-15 23:28:51,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 23:28:51,908 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:28:51,909 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:28:52,115 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-15 23:28:52,115 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:28:52,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:52,116 INFO L82 PathProgramCache]: Analyzing trace with hash 70268002, now seen corresponding path program 1 times [2019-11-15 23:28:52,116 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:28:52,116 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1306126810] [2019-11-15 23:28:52,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a428630b-096e-4adb-8df5-f86ca8e87ecb/bin/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-11-15 23:28:53,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:53,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-15 23:28:53,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:28:53,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:28:53,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:28:53,926 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:28:53,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:28:54,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:28:54,935 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1306126810] [2019-11-15 23:28:54,935 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:54,935 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 20 [2019-11-15 23:28:54,935 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641602957] [2019-11-15 23:28:54,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-15 23:28:54,936 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:28:54,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-15 23:28:54,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2019-11-15 23:28:54,937 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 20 states. [2019-11-15 23:28:56,489 WARN L191 SmtUtils]: Spent 851.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-11-15 23:28:57,704 WARN L191 SmtUtils]: Spent 899.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-11-15 23:29:00,285 WARN L191 SmtUtils]: Spent 938.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-11-15 23:29:02,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:29:02,350 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2019-11-15 23:29:02,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:29:02,353 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2019-11-15 23:29:02,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:29:02,354 INFO L225 Difference]: With dead ends: 48 [2019-11-15 23:29:02,354 INFO L226 Difference]: Without dead ends: 44 [2019-11-15 23:29:02,355 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=199, Invalid=557, Unknown=0, NotChecked=0, Total=756 [2019-11-15 23:29:02,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-15 23:29:02,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-11-15 23:29:02,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-15 23:29:02,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-11-15 23:29:02,365 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 36 [2019-11-15 23:29:02,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:29:02,366 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-11-15 23:29:02,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-15 23:29:02,366 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-11-15 23:29:02,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-15 23:29:02,370 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:29:02,371 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:29:02,596 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-15 23:29:02,596 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:29:02,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:29:02,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1439805872, now seen corresponding path program 1 times [2019-11-15 23:29:02,597 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:29:02,597 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [33898043] [2019-11-15 23:29:02,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a428630b-096e-4adb-8df5-f86ca8e87ecb/bin/uautomizer/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-11-15 23:29:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:29:03,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-15 23:29:03,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:29:04,389 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2019-11-15 23:29:04,406 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:29:04,411 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:29:04,411 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:29:04,493 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:29:04,493 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-15 23:29:04,494 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:133, output treesize:94 [2019-11-15 23:29:05,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:29:05,723 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:29:05,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:06,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:06,878 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 61 [2019-11-15 23:29:06,883 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:29:06,892 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:29:06,893 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:29:06,947 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:29:06,947 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:29:06,948 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:85, output treesize:49 [2019-11-15 23:29:09,729 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_41| (_ BitVec 64))) (or (not (bvsgt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_41|)) (_ bv2146435072 32))) (not (= (fp.div roundNearestTiesToEven c_ULTIMATE.start___ieee754_atan2_~y c_ULTIMATE.start___ieee754_atan2_~x) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_41|)))))) is different from false [2019-11-15 23:29:12,147 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_41| (_ BitVec 64))) (or (not (bvsgt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_41|)) (_ bv2146435072 32))) (not (= (fp.div roundNearestTiesToEven c_ULTIMATE.start___ieee754_atan2_~y c_ULTIMATE.start___ieee754_atan2_~x) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_41|)))))) is different from true [2019-11-15 23:29:58,717 WARN L191 SmtUtils]: Spent 9.03 s on a formula simplification that was a NOOP. DAG size: 23 [2019-11-15 23:30:37,806 WARN L191 SmtUtils]: Spent 10.11 s on a formula simplification that was a NOOP. DAG size: 28 [2019-11-15 23:30:40,242 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_skolemized_q#valueAsBitvector_41| (_ BitVec 64))) (or (not (bvsgt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_41|)) (_ bv2146435072 32))) (not (= (fp.div roundNearestTiesToEven c_ULTIMATE.start___ieee754_atan2_~y c_ULTIMATE.start___ieee754_atan2_~x) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_41|)))))) (bvsgt (bvashr (bvadd (bvand (_ bv2147483647 32) c_ULTIMATE.start___ieee754_atan2_~hy~0) (bvneg c_ULTIMATE.start___ieee754_atan2_~ix~1)) (_ bv20 32)) (_ bv60 32))) is different from true [2019-11-15 23:31:33,590 WARN L191 SmtUtils]: Spent 7.98 s on a formula simplification that was a NOOP. DAG size: 38 [2019-11-15 23:31:36,045 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_skolemized_q#valueAsBitvector_41| (_ BitVec 64))) (or (not (bvsgt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_41|)) (_ bv2146435072 32))) (not (= (fp.div roundNearestTiesToEven c_ULTIMATE.start___ieee754_atan2_~y c_ULTIMATE.start___ieee754_atan2_~x) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_41|)))))) (forall ((v_skolemized_v_prenex_22_6 (_ BitVec 64))) (or (bvsgt (bvashr (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_22_6)) (bvneg (bvand (_ bv2147483647 32) c_ULTIMATE.start___ieee754_atan2_~hx~1))) (_ bv20 32)) (_ bv60 32)) (not (= c_ULTIMATE.start___ieee754_atan2_~y (fp ((_ extract 63 63) v_skolemized_v_prenex_22_6) ((_ extract 62 52) v_skolemized_v_prenex_22_6) ((_ extract 51 0) v_skolemized_v_prenex_22_6))))))) is different from true [2019-11-15 23:31:38,480 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((|v_skolemized_q#valueAsBitvector_41| (_ BitVec 64))) (or (not (bvsgt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_41|)) (_ bv2146435072 32))) (not (= (fp.div roundNearestTiesToEven c_ULTIMATE.start___ieee754_atan2_~y c_ULTIMATE.start___ieee754_atan2_~x) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_41|)))))) (forall ((|v_skolemized_q#valueAsBitvector_38| (_ BitVec 64)) (v_skolemized_v_prenex_22_6 (_ BitVec 64))) (or (bvsgt (bvashr (bvadd (bvneg (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_38|))) (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_22_6))) (_ bv20 32)) (_ bv60 32)) (not (= c_ULTIMATE.start___ieee754_atan2_~y (fp ((_ extract 63 63) v_skolemized_v_prenex_22_6) ((_ extract 62 52) v_skolemized_v_prenex_22_6) ((_ extract 51 0) v_skolemized_v_prenex_22_6)))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_38|)) c_ULTIMATE.start___ieee754_atan2_~x))))) is different from false [2019-11-15 23:31:40,908 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_skolemized_q#valueAsBitvector_41| (_ BitVec 64))) (or (not (bvsgt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_41|)) (_ bv2146435072 32))) (not (= (fp.div roundNearestTiesToEven c_ULTIMATE.start___ieee754_atan2_~y c_ULTIMATE.start___ieee754_atan2_~x) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_41|)))))) (forall ((|v_skolemized_q#valueAsBitvector_38| (_ BitVec 64)) (v_skolemized_v_prenex_22_6 (_ BitVec 64))) (or (bvsgt (bvashr (bvadd (bvneg (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_38|))) (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_22_6))) (_ bv20 32)) (_ bv60 32)) (not (= c_ULTIMATE.start___ieee754_atan2_~y (fp ((_ extract 63 63) v_skolemized_v_prenex_22_6) ((_ extract 62 52) v_skolemized_v_prenex_22_6) ((_ extract 51 0) v_skolemized_v_prenex_22_6)))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_38|)) c_ULTIMATE.start___ieee754_atan2_~x))))) is different from true [2019-11-15 23:32:43,470 WARN L191 SmtUtils]: Spent 2.48 s on a formula simplification that was a NOOP. DAG size: 43 [2019-11-15 23:32:43,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:43,489 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [33898043] [2019-11-15 23:32:43,489 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:43,489 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [18, 17] imperfect sequences [] total 33 [2019-11-15 23:32:43,489 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075448477] [2019-11-15 23:32:43,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-15 23:32:43,490 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:32:43,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-15 23:32:43,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=670, Unknown=51, NotChecked=228, Total=1056 [2019-11-15 23:32:43,491 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 33 states. [2019-11-15 23:32:48,092 WARN L191 SmtUtils]: Spent 3.06 s on a formula simplification. DAG size of input: 60 DAG size of output: 36 [2019-11-15 23:32:49,479 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2019-11-15 23:32:53,445 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-11-15 23:32:54,042 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-15 23:32:56,784 WARN L191 SmtUtils]: Spent 380.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-11-15 23:32:59,825 WARN L191 SmtUtils]: Spent 512.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-11-15 23:33:03,238 WARN L191 SmtUtils]: Spent 794.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-11-15 23:33:08,744 WARN L191 SmtUtils]: Spent 936.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-11-15 23:33:16,518 WARN L191 SmtUtils]: Spent 3.46 s on a formula simplification that was a NOOP. DAG size: 122 [2019-11-15 23:33:35,943 WARN L191 SmtUtils]: Spent 16.94 s on a formula simplification. DAG size of input: 134 DAG size of output: 132 [2019-11-15 23:33:36,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:36,541 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-11-15 23:33:36,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 23:33:36,561 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 42 [2019-11-15 23:33:36,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:36,562 INFO L225 Difference]: With dead ends: 57 [2019-11-15 23:33:36,562 INFO L226 Difference]: Without dead ends: 44 [2019-11-15 23:33:36,563 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 260.1s TimeCoverageRelationStatistics Valid=443, Invalid=1414, Unknown=51, NotChecked=348, Total=2256 [2019-11-15 23:33:36,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-15 23:33:36,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-11-15 23:33:36,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-15 23:33:36,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 43 transitions. [2019-11-15 23:33:36,576 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 43 transitions. Word has length 42 [2019-11-15 23:33:36,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:36,576 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 43 transitions. [2019-11-15 23:33:36,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-15 23:33:36,577 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 43 transitions. [2019-11-15 23:33:36,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-15 23:33:36,578 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:36,578 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:33:36,804 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-15 23:33:36,804 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:36,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:36,805 INFO L82 PathProgramCache]: Analyzing trace with hash -2043823236, now seen corresponding path program 1 times [2019-11-15 23:33:36,805 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:33:36,806 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [794255164] [2019-11-15 23:33:36,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a428630b-096e-4adb-8df5-f86ca8e87ecb/bin/uautomizer/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-11-15 23:33:38,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:38,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 23:33:38,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:33:38,662 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:33:38,664 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 47 [2019-11-15 23:33:38,679 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-15 23:33:38,680 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:38,706 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:38,714 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:38,715 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 13 [2019-11-15 23:33:38,715 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:38,719 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:38,719 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:33:38,746 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:38,746 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:33:38,747 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:64, output treesize:23 [2019-11-15 23:33:38,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:38,847 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:33:39,115 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-15 23:33:39,116 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:277) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.downgradeDimensionsIfNecessary(ArrayOccurrenceAnalysis.java:171) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.computeCostEstimation(ArrayIndexBasedCostEstimation.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.(ArrayIndexBasedCostEstimation.java:64) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:390) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:335) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-15 23:33:39,121 INFO L168 Benchmark]: Toolchain (without parser) took 417555.58 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 289.9 MB). Free memory was 951.0 MB in the beginning and 913.2 MB in the end (delta: 37.8 MB). Peak memory consumption was 327.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:33:39,121 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:33:39,122 INFO L168 Benchmark]: CACSL2BoogieTranslator took 615.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.8 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -193.4 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:33:39,122 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.29 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:33:39,122 INFO L168 Benchmark]: Boogie Preprocessor took 93.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:33:39,123 INFO L168 Benchmark]: RCFGBuilder took 37427.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 71.8 MB). Peak memory consumption was 71.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:33:39,123 INFO L168 Benchmark]: TraceAbstraction took 379318.33 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 122.2 MB). Free memory was 1.1 GB in the beginning and 913.2 MB in the end (delta: 146.5 MB). Peak memory consumption was 268.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:33:39,126 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 615.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.8 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -193.4 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 81.29 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 93.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 37427.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 71.8 MB). Peak memory consumption was 71.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 379318.33 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 122.2 MB). Free memory was 1.1 GB in the beginning and 913.2 MB in the end (delta: 146.5 MB). Peak memory consumption was 268.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:277) RESULT: Ultimate could not prove your program: Toolchain returned no result. [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...