./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_0663b.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_2a0e3a8b-2ccc-41a6-a8e4-974717ee48b6/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2a0e3a8b-2ccc-41a6-a8e4-974717ee48b6/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2a0e3a8b-2ccc-41a6-a8e4-974717ee48b6/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2a0e3a8b-2ccc-41a6-a8e4-974717ee48b6/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0663b.c -s /tmp/vcloud-vcloud-master/worker/run_dir_2a0e3a8b-2ccc-41a6-a8e4-974717ee48b6/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2a0e3a8b-2ccc-41a6-a8e4-974717ee48b6/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 0cca6d33f0772631e27f925c9516a89b4af2326a ............................................................................................................................................................................................................................................................................................................................ 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_2a0e3a8b-2ccc-41a6-a8e4-974717ee48b6/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2a0e3a8b-2ccc-41a6-a8e4-974717ee48b6/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2a0e3a8b-2ccc-41a6-a8e4-974717ee48b6/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2a0e3a8b-2ccc-41a6-a8e4-974717ee48b6/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0663b.c -s /tmp/vcloud-vcloud-master/worker/run_dir_2a0e3a8b-2ccc-41a6-a8e4-974717ee48b6/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2a0e3a8b-2ccc-41a6-a8e4-974717ee48b6/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 0cca6d33f0772631e27f925c9516a89b4af2326a .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 22:33:38,176 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:33:38,178 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:33:38,196 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:33:38,196 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:33:38,198 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:33:38,200 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:33:38,211 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:33:38,216 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:33:38,220 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:33:38,223 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:33:38,224 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:33:38,225 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:33:38,227 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:33:38,228 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:33:38,229 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:33:38,230 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:33:38,232 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:33:38,235 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:33:38,239 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:33:38,243 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:33:38,247 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:33:38,250 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:33:38,251 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:33:38,255 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:33:38,255 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:33:38,255 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:33:38,257 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:33:38,258 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:33:38,259 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:33:38,260 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:33:38,261 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:33:38,262 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:33:38,263 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:33:38,265 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:33:38,265 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:33:38,266 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:33:38,267 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:33:38,267 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:33:38,268 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:33:38,269 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:33:38,271 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2a0e3a8b-2ccc-41a6-a8e4-974717ee48b6/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:33:38,301 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:33:38,310 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:33:38,311 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:33:38,312 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:33:38,312 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:33:38,312 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:33:38,313 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:33:38,313 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:33:38,313 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:33:38,314 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:33:38,314 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:33:38,319 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:33:38,319 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:33:38,320 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:33:38,320 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:33:38,320 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:33:38,321 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:33:38,321 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:33:38,321 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:33:38,322 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:33:38,322 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:33:38,322 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:33:38,322 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:33:38,323 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:33:38,323 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:33:38,323 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:33:38,324 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:33:38,324 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:33:38,324 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_2a0e3a8b-2ccc-41a6-a8e4-974717ee48b6/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 -> 0cca6d33f0772631e27f925c9516a89b4af2326a [2019-11-15 22:33:38,371 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:33:38,387 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:33:38,391 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:33:38,393 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:33:38,393 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:33:38,395 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2a0e3a8b-2ccc-41a6-a8e4-974717ee48b6/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_0663b.c [2019-11-15 22:33:38,470 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2a0e3a8b-2ccc-41a6-a8e4-974717ee48b6/bin/uautomizer/data/1a12d4f41/369bdb9b6f9c4a7dacd760b36853dc59/FLAG51c659038 [2019-11-15 22:33:39,009 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:33:39,010 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2a0e3a8b-2ccc-41a6-a8e4-974717ee48b6/sv-benchmarks/c/float-newlib/double_req_bl_0663b.c [2019-11-15 22:33:39,020 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2a0e3a8b-2ccc-41a6-a8e4-974717ee48b6/bin/uautomizer/data/1a12d4f41/369bdb9b6f9c4a7dacd760b36853dc59/FLAG51c659038 [2019-11-15 22:33:39,302 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2a0e3a8b-2ccc-41a6-a8e4-974717ee48b6/bin/uautomizer/data/1a12d4f41/369bdb9b6f9c4a7dacd760b36853dc59 [2019-11-15 22:33:39,307 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:33:39,308 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:33:39,309 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:33:39,309 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:33:39,313 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:33:39,315 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:33:39" (1/1) ... [2019-11-15 22:33:39,318 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3427d9ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:33:39, skipping insertion in model container [2019-11-15 22:33:39,318 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:33:39" (1/1) ... [2019-11-15 22:33:39,327 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:33:39,356 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:33:39,770 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:33:39,778 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:33:39,853 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:33:39,887 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:33:39,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:33:39 WrapperNode [2019-11-15 22:33:39,888 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:33:39,890 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:33:39,890 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:33:39,891 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:33:39,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:33:39" (1/1) ... [2019-11-15 22:33:39,920 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:33:39" (1/1) ... [2019-11-15 22:33:39,972 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:33:39,972 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:33:39,972 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:33:39,973 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:33:40,001 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:33:39" (1/1) ... [2019-11-15 22:33:40,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:33:39" (1/1) ... [2019-11-15 22:33:40,010 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:33:39" (1/1) ... [2019-11-15 22:33:40,010 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:33:39" (1/1) ... [2019-11-15 22:33:40,043 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:33:39" (1/1) ... [2019-11-15 22:33:40,069 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:33:39" (1/1) ... [2019-11-15 22:33:40,085 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:33:39" (1/1) ... [2019-11-15 22:33:40,091 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:33:40,094 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:33:40,094 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:33:40,095 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:33:40,096 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:33:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2a0e3a8b-2ccc-41a6-a8e4-974717ee48b6/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 22:33:40,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:33:40,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-11-15 22:33:40,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:33:40,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-15 22:33:40,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:33:40,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:33:40,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:33:40,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2019-11-15 22:33:40,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:33:41,171 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:33:41,171 INFO L284 CfgBuilder]: Removed 44 assume(true) statements. [2019-11-15 22:33:41,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:33:41 BoogieIcfgContainer [2019-11-15 22:33:41,173 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:33:41,174 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:33:41,175 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:33:41,178 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:33:41,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:33:39" (1/3) ... [2019-11-15 22:33:41,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bd534a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:33:41, skipping insertion in model container [2019-11-15 22:33:41,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:33:39" (2/3) ... [2019-11-15 22:33:41,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bd534a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:33:41, skipping insertion in model container [2019-11-15 22:33:41,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:33:41" (3/3) ... [2019-11-15 22:33:41,181 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_0663b.c [2019-11-15 22:33:41,192 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:33:41,201 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:33:41,213 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:33:41,262 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:33:41,262 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:33:41,262 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:33:41,262 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:33:41,263 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:33:41,263 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:33:41,263 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:33:41,263 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:33:41,289 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states. [2019-11-15 22:33:41,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-15 22:33:41,299 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:33:41,300 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:33:41,304 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:33:41,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:33:41,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1059427896, now seen corresponding path program 1 times [2019-11-15 22:33:41,321 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:33:41,321 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039621321] [2019-11-15 22:33:41,322 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:41,322 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:41,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:33:41,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:33:41,559 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 22:33:41,561 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039621321] [2019-11-15 22:33:41,562 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:33:41,563 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:33:41,563 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712171020] [2019-11-15 22:33:41,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-15 22:33:41,568 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:33:41,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 22:33:41,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 22:33:41,589 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 2 states. [2019-11-15 22:33:41,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:33:41,622 INFO L93 Difference]: Finished difference Result 227 states and 382 transitions. [2019-11-15 22:33:41,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 22:33:41,624 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-11-15 22:33:41,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:33:41,637 INFO L225 Difference]: With dead ends: 227 [2019-11-15 22:33:41,638 INFO L226 Difference]: Without dead ends: 111 [2019-11-15 22:33:41,642 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 22:33:41,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-15 22:33:41,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-11-15 22:33:41,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-15 22:33:41,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2019-11-15 22:33:41,692 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 11 [2019-11-15 22:33:41,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:33:41,692 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2019-11-15 22:33:41,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-15 22:33:41,693 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2019-11-15 22:33:41,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-15 22:33:41,693 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:33:41,694 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:33:41,694 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:33:41,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:33:41,695 INFO L82 PathProgramCache]: Analyzing trace with hash -7417919, now seen corresponding path program 1 times [2019-11-15 22:33:41,695 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:33:41,695 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206911730] [2019-11-15 22:33:41,695 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:41,695 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:41,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:33:41,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:33:41,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:33:41,916 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:33:41,916 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 22:33:41,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:33:41 BoogieIcfgContainer [2019-11-15 22:33:41,962 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:33:41,962 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:33:41,962 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:33:41,963 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:33:41,963 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:33:41" (3/4) ... [2019-11-15 22:33:41,967 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 22:33:41,967 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:33:41,970 INFO L168 Benchmark]: Toolchain (without parser) took 2660.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 948.7 MB in the beginning and 1.0 GB in the end (delta: -81.3 MB). Peak memory consumption was 73.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:33:41,970 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:33:41,971 INFO L168 Benchmark]: CACSL2BoogieTranslator took 580.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -191.0 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-11-15 22:33:41,972 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.13 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:33:41,973 INFO L168 Benchmark]: Boogie Preprocessor took 121.49 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:33:41,973 INFO L168 Benchmark]: RCFGBuilder took 1079.09 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: 61.3 MB). Peak memory consumption was 61.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:33:41,974 INFO L168 Benchmark]: TraceAbstraction took 787.49 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: 40.1 MB). Peak memory consumption was 40.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:33:41,974 INFO L168 Benchmark]: Witness Printer took 5.25 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 22:33:41,978 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.35 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 580.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -191.0 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 82.13 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 121.49 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1079.09 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: 61.3 MB). Peak memory consumption was 61.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 787.49 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: 40.1 MB). Peak memory consumption was 40.1 MB. Max. memory is 11.5 GB. * Witness Printer took 5.25 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.7s, 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 22:33:44,488 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:33:44,490 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:33:44,503 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:33:44,503 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:33:44,504 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:33:44,506 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:33:44,509 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:33:44,511 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:33:44,512 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:33:44,514 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:33:44,515 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:33:44,516 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:33:44,517 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:33:44,519 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:33:44,520 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:33:44,521 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:33:44,522 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:33:44,524 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:33:44,527 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:33:44,529 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:33:44,530 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:33:44,532 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:33:44,533 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:33:44,536 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:33:44,537 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:33:44,537 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:33:44,538 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:33:44,539 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:33:44,540 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:33:44,540 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:33:44,541 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:33:44,542 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:33:44,543 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:33:44,544 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:33:44,544 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:33:44,545 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:33:44,545 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:33:44,546 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:33:44,547 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:33:44,547 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:33:44,548 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2a0e3a8b-2ccc-41a6-a8e4-974717ee48b6/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-15 22:33:44,564 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:33:44,564 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:33:44,565 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:33:44,566 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:33:44,566 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:33:44,566 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:33:44,567 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:33:44,567 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:33:44,567 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:33:44,568 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:33:44,568 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:33:44,568 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:33:44,568 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 22:33:44,569 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 22:33:44,569 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:33:44,569 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:33:44,570 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:33:44,570 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:33:44,570 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:33:44,570 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:33:44,571 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:33:44,571 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:33:44,571 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:33:44,572 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:33:44,572 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:33:44,572 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:33:44,572 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 22:33:44,573 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 22:33:44,573 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:33:44,573 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 22:33:44,573 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_2a0e3a8b-2ccc-41a6-a8e4-974717ee48b6/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 -> 0cca6d33f0772631e27f925c9516a89b4af2326a [2019-11-15 22:33:44,608 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:33:44,620 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:33:44,625 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:33:44,631 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:33:44,638 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:33:44,639 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2a0e3a8b-2ccc-41a6-a8e4-974717ee48b6/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_0663b.c [2019-11-15 22:33:44,715 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2a0e3a8b-2ccc-41a6-a8e4-974717ee48b6/bin/uautomizer/data/c8c055d1e/566e73acbdba4556a2a7a689e3c8d569/FLAG40261bcaa [2019-11-15 22:33:45,289 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:33:45,290 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2a0e3a8b-2ccc-41a6-a8e4-974717ee48b6/sv-benchmarks/c/float-newlib/double_req_bl_0663b.c [2019-11-15 22:33:45,300 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2a0e3a8b-2ccc-41a6-a8e4-974717ee48b6/bin/uautomizer/data/c8c055d1e/566e73acbdba4556a2a7a689e3c8d569/FLAG40261bcaa [2019-11-15 22:33:45,579 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2a0e3a8b-2ccc-41a6-a8e4-974717ee48b6/bin/uautomizer/data/c8c055d1e/566e73acbdba4556a2a7a689e3c8d569 [2019-11-15 22:33:45,581 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:33:45,582 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:33:45,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:33:45,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:33:45,587 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:33:45,588 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:33:45" (1/1) ... [2019-11-15 22:33:45,591 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75a34ac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:33:45, skipping insertion in model container [2019-11-15 22:33:45,591 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:33:45" (1/1) ... [2019-11-15 22:33:45,599 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:33:45,650 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:33:45,901 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:33:45,913 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:33:46,068 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:33:46,120 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:33:46,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:33:46 WrapperNode [2019-11-15 22:33:46,120 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:33:46,121 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:33:46,121 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:33:46,121 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:33:46,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:33:46" (1/1) ... [2019-11-15 22:33:46,149 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:33:46" (1/1) ... [2019-11-15 22:33:46,216 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:33:46,216 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:33:46,216 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:33:46,216 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:33:46,227 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:33:46" (1/1) ... [2019-11-15 22:33:46,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:33:46" (1/1) ... [2019-11-15 22:33:46,242 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:33:46" (1/1) ... [2019-11-15 22:33:46,243 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:33:46" (1/1) ... [2019-11-15 22:33:46,284 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:33:46" (1/1) ... [2019-11-15 22:33:46,303 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:33:46" (1/1) ... [2019-11-15 22:33:46,309 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:33:46" (1/1) ... [2019-11-15 22:33:46,317 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:33:46,317 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:33:46,318 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:33:46,318 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:33:46,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:33:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2a0e3a8b-2ccc-41a6-a8e4-974717ee48b6/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 22:33:46,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2019-11-15 22:33:46,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-11-15 22:33:46,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:33:46,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2019-11-15 22:33:46,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 22:33:46,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:33:46,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:33:46,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 22:33:46,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:34:28,088 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:34:28,088 INFO L284 CfgBuilder]: Removed 44 assume(true) statements. [2019-11-15 22:34:28,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:34:28 BoogieIcfgContainer [2019-11-15 22:34:28,089 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:34:28,091 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:34:28,091 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:34:28,095 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:34:28,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:33:45" (1/3) ... [2019-11-15 22:34:28,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63044098 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:34:28, skipping insertion in model container [2019-11-15 22:34:28,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:33:46" (2/3) ... [2019-11-15 22:34:28,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63044098 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:34:28, skipping insertion in model container [2019-11-15 22:34:28,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:34:28" (3/3) ... [2019-11-15 22:34:28,099 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_0663b.c [2019-11-15 22:34:28,110 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:34:28,117 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:34:28,128 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:34:28,156 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:34:28,156 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:34:28,156 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:34:28,156 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:34:28,157 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:34:28,157 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:34:28,157 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:34:28,157 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:34:28,178 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states. [2019-11-15 22:34:28,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-15 22:34:28,186 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:34:28,187 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:34:28,189 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:34:28,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:28,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1059427896, now seen corresponding path program 1 times [2019-11-15 22:34:28,206 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:34:28,206 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [72690207] [2019-11-15 22:34:28,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2a0e3a8b-2ccc-41a6-a8e4-974717ee48b6/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 22:34:28,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:28,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-15 22:34:28,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:34:28,630 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 22:34:28,631 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:34:28,635 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 22:34:28,636 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [72690207] [2019-11-15 22:34:28,637 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:34:28,637 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-15 22:34:28,638 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396793362] [2019-11-15 22:34:28,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-15 22:34:28,642 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:34:28,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 22:34:28,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 22:34:28,655 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 2 states. [2019-11-15 22:34:28,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:34:28,694 INFO L93 Difference]: Finished difference Result 227 states and 382 transitions. [2019-11-15 22:34:28,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 22:34:28,696 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-11-15 22:34:28,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:34:28,712 INFO L225 Difference]: With dead ends: 227 [2019-11-15 22:34:28,712 INFO L226 Difference]: Without dead ends: 111 [2019-11-15 22:34:28,717 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 22:34:28,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-15 22:34:28,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-11-15 22:34:28,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-15 22:34:28,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2019-11-15 22:34:28,770 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 11 [2019-11-15 22:34:28,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:34:28,771 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2019-11-15 22:34:28,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-15 22:34:28,771 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2019-11-15 22:34:28,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-15 22:34:28,772 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:34:28,772 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:34:28,973 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-15 22:34:28,974 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:34:28,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:28,974 INFO L82 PathProgramCache]: Analyzing trace with hash -7417919, now seen corresponding path program 1 times [2019-11-15 22:34:28,975 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:34:28,976 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [356328161] [2019-11-15 22:34:28,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2a0e3a8b-2ccc-41a6-a8e4-974717ee48b6/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 22:34:29,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:29,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-15 22:34:29,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:34:29,690 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 22:34:29,724 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 22:34:29,725 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:34:29,749 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:34:29,773 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:34:29,773 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 22:34:29,774 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:34:29,778 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:34:29,779 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 22:34:29,816 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:34:29,818 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 22:34:29,818 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:61, output treesize:33 [2019-11-15 22:34:32,041 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 22:34:32,042 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:34:32,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:34:32,295 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:34:32,296 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 22:34:32,351 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:34:32,352 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 22:34:32,353 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:34:32,386 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:34:32,412 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 22:34:32,413 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:34:32,433 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:34:32,434 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 22:34:32,458 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:34:32,458 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 22:34:32,476 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:34:32,476 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 22:34:32,477 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 22:34:32,495 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:34:32,495 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:34:32,553 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:34:32,554 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 22:34:32,555 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:108, output treesize:50 [2019-11-15 22:34:32,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:34:33,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:34:33,112 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 22:34:33,113 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [356328161] [2019-11-15 22:34:33,113 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:34:33,113 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2019-11-15 22:34:33,113 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961262331] [2019-11-15 22:34:33,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 22:34:33,115 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:34:33,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 22:34:33,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=150, Unknown=1, NotChecked=0, Total=182 [2019-11-15 22:34:33,116 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand 14 states. [2019-11-15 22:34:35,053 WARN L191 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-15 22:34:36,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:34:36,845 INFO L93 Difference]: Finished difference Result 167 states and 236 transitions. [2019-11-15 22:34:37,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:34:37,286 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2019-11-15 22:34:37,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:34:37,289 INFO L225 Difference]: With dead ends: 167 [2019-11-15 22:34:37,289 INFO L226 Difference]: Without dead ends: 68 [2019-11-15 22:34:37,291 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=91, Invalid=250, Unknown=1, NotChecked=0, Total=342 [2019-11-15 22:34:37,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-15 22:34:37,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-15 22:34:37,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-15 22:34:37,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 85 transitions. [2019-11-15 22:34:37,305 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 85 transitions. Word has length 13 [2019-11-15 22:34:37,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:34:37,306 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 85 transitions. [2019-11-15 22:34:37,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 22:34:37,306 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 85 transitions. [2019-11-15 22:34:37,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 22:34:37,307 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:34:37,308 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 22:34:37,529 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-15 22:34:37,529 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:34:37,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:37,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1228186055, now seen corresponding path program 1 times [2019-11-15 22:34:37,530 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:34:37,531 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1774669165] [2019-11-15 22:34:37,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2a0e3a8b-2ccc-41a6-a8e4-974717ee48b6/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 22:34:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:37,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:34:37,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:34:38,146 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-11-15 22:34:38,370 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-11-15 22:34:38,783 WARN L191 SmtUtils]: Spent 390.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-11-15 22:34:38,787 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 22:34:38,787 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:34:41,471 WARN L191 SmtUtils]: Spent 390.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2019-11-15 22:34:41,474 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 22:34:41,474 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1774669165] [2019-11-15 22:34:41,475 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:34:41,475 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-15 22:34:41,475 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970313811] [2019-11-15 22:34:41,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 22:34:41,476 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:34:41,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 22:34:41,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:34:41,477 INFO L87 Difference]: Start difference. First operand 68 states and 85 transitions. Second operand 10 states. [2019-11-15 22:34:41,936 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-11-15 22:34:42,327 WARN L191 SmtUtils]: Spent 328.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-11-15 22:34:43,560 WARN L191 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-11-15 22:34:45,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:34:45,219 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2019-11-15 22:34:45,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:34:45,220 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-11-15 22:34:45,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:34:45,222 INFO L225 Difference]: With dead ends: 72 [2019-11-15 22:34:45,222 INFO L226 Difference]: Without dead ends: 66 [2019-11-15 22:34:45,223 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:34:45,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-15 22:34:45,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-11-15 22:34:45,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-15 22:34:45,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2019-11-15 22:34:45,236 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 18 [2019-11-15 22:34:45,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:34:45,237 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2019-11-15 22:34:45,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 22:34:45,237 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2019-11-15 22:34:45,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 22:34:45,238 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:34:45,239 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 22:34:45,459 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-15 22:34:45,459 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:34:45,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:45,460 INFO L82 PathProgramCache]: Analyzing trace with hash 50256570, now seen corresponding path program 1 times [2019-11-15 22:34:45,462 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:34:45,462 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [126743845] [2019-11-15 22:34:45,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2a0e3a8b-2ccc-41a6-a8e4-974717ee48b6/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 22:34:45,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:45,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:34:45,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:34:46,116 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-11-15 22:34:46,421 WARN L191 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-11-15 22:34:46,726 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-11-15 22:34:46,730 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 22:34:46,730 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:34:48,539 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2019-11-15 22:34:48,542 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 22:34:48,542 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [126743845] [2019-11-15 22:34:48,542 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:34:48,542 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-15 22:34:48,542 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958906718] [2019-11-15 22:34:48,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 22:34:48,543 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:34:48,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 22:34:48,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:34:48,544 INFO L87 Difference]: Start difference. First operand 66 states and 82 transitions. Second operand 10 states. [2019-11-15 22:34:48,997 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-11-15 22:34:50,141 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-11-15 22:34:50,618 WARN L191 SmtUtils]: Spent 455.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-11-15 22:34:51,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:34:51,568 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2019-11-15 22:34:51,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:34:51,569 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-15 22:34:51,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:34:51,570 INFO L225 Difference]: With dead ends: 70 [2019-11-15 22:34:51,570 INFO L226 Difference]: Without dead ends: 64 [2019-11-15 22:34:51,571 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:34:51,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-15 22:34:51,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-11-15 22:34:51,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-15 22:34:51,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2019-11-15 22:34:51,581 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 20 [2019-11-15 22:34:51,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:34:51,581 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2019-11-15 22:34:51,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 22:34:51,582 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2019-11-15 22:34:51,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 22:34:51,586 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:34:51,586 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 22:34:51,787 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-15 22:34:51,787 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:34:51,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:51,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1297758981, now seen corresponding path program 1 times [2019-11-15 22:34:51,788 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:34:51,788 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1446701577] [2019-11-15 22:34:51,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2a0e3a8b-2ccc-41a6-a8e4-974717ee48b6/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 22:34:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:52,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:34:52,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:34:52,475 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-11-15 22:34:52,641 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-11-15 22:34:52,820 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-11-15 22:34:52,824 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 22:34:52,824 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:35:03,361 WARN L191 SmtUtils]: Spent 1.25 s on a formula simplification that was a NOOP. DAG size: 8 [2019-11-15 22:35:03,365 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 22:35:03,365 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1446701577] [2019-11-15 22:35:03,365 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:35:03,366 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-15 22:35:03,366 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134330174] [2019-11-15 22:35:03,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 22:35:03,367 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:35:03,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 22:35:03,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:35:03,368 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 10 states. [2019-11-15 22:35:04,514 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-11-15 22:35:05,140 WARN L191 SmtUtils]: Spent 377.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-11-15 22:35:05,484 WARN L191 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-11-15 22:35:08,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:35:08,345 INFO L93 Difference]: Finished difference Result 81 states and 98 transitions. [2019-11-15 22:35:08,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:35:08,369 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-11-15 22:35:08,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:35:08,370 INFO L225 Difference]: With dead ends: 81 [2019-11-15 22:35:08,370 INFO L226 Difference]: Without dead ends: 77 [2019-11-15 22:35:08,371 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:35:08,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-15 22:35:08,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 66. [2019-11-15 22:35:08,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-15 22:35:08,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 81 transitions. [2019-11-15 22:35:08,381 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 81 transitions. Word has length 21 [2019-11-15 22:35:08,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:35:08,382 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 81 transitions. [2019-11-15 22:35:08,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 22:35:08,382 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2019-11-15 22:35:08,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 22:35:08,384 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:35:08,384 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] [2019-11-15 22:35:08,606 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-15 22:35:08,606 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:35:08,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:35:08,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1649788032, now seen corresponding path program 1 times [2019-11-15 22:35:08,608 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:35:08,608 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [939085965] [2019-11-15 22:35:08,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2a0e3a8b-2ccc-41a6-a8e4-974717ee48b6/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 22:35:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:35:09,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 22:35:09,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:35:09,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:35:09,567 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 22:35:09,567 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:35:09,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:35:09,882 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 22:35:09,883 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [939085965] [2019-11-15 22:35:09,883 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:35:09,883 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2019-11-15 22:35:09,883 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768712832] [2019-11-15 22:35:09,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-15 22:35:09,884 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:35:09,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 22:35:09,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:35:09,885 INFO L87 Difference]: Start difference. First operand 66 states and 81 transitions. Second operand 13 states. [2019-11-15 22:35:15,817 WARN L191 SmtUtils]: Spent 3.62 s on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-11-15 22:35:19,998 WARN L191 SmtUtils]: Spent 4.17 s on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-11-15 22:35:22,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:35:22,553 INFO L93 Difference]: Finished difference Result 70 states and 84 transitions. [2019-11-15 22:35:22,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:35:22,555 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-11-15 22:35:22,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:35:22,555 INFO L225 Difference]: With dead ends: 70 [2019-11-15 22:35:22,555 INFO L226 Difference]: Without dead ends: 55 [2019-11-15 22:35:22,556 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2019-11-15 22:35:22,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-15 22:35:22,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-11-15 22:35:22,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-15 22:35:22,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2019-11-15 22:35:22,565 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 23 [2019-11-15 22:35:22,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:35:22,565 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2019-11-15 22:35:22,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-15 22:35:22,566 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2019-11-15 22:35:22,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 22:35:22,567 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:35:22,568 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 22:35:22,790 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-15 22:35:22,790 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:35:22,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:35:22,790 INFO L82 PathProgramCache]: Analyzing trace with hash -490549731, now seen corresponding path program 1 times [2019-11-15 22:35:22,791 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:35:22,791 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1665169157] [2019-11-15 22:35:22,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2a0e3a8b-2ccc-41a6-a8e4-974717ee48b6/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 22:35:24,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:35:24,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-15 22:35:24,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:35:24,316 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 22:35:24,335 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 22:35:24,336 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 22:35:24,344 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:35:24,345 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 22:35:24,386 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:35:24,387 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 22:35:24,387 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:67, output treesize:37 [2019-11-15 22:35:24,991 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 22:35:24,991 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:35:25,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 55 treesize of output 49 [2019-11-15 22:35:25,681 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 22:35:25,682 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 22:35:25,690 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:35:25,690 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 22:35:25,704 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:35:25,704 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 22:35:25,704 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:35 [2019-11-15 22:35:28,933 WARN L191 SmtUtils]: Spent 575.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-11-15 22:35:34,239 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-11-15 22:35:36,696 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_14 (_ BitVec 32)) (ULTIMATE.start___ieee754_atan2_~y (_ FloatingPoint 11 53)) (|v_skolemized_q#valueAsBitvector_35| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_34| (_ BitVec 64))) (or (bvsge (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_35|)) (_ bv1141899264 32)) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_34|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_34|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_34|)) (fp.div roundNearestTiesToEven ULTIMATE.start___ieee754_atan2_~y c_ULTIMATE.start___ieee754_atan2_~x))) (not (= (let ((.cse0 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_34|)) v_arrayElimCell_14))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (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|)))))) is different from true [2019-11-15 22:35:39,185 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_14 (_ BitVec 32)) (ULTIMATE.start___ieee754_atan2_~y (_ FloatingPoint 11 53)) (|v_skolemized_q#valueAsBitvector_35| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_34| (_ BitVec 64))) (or (bvsge (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_35|)) (_ bv1141899264 32)) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_34|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_34|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_34|)) (fp.div roundNearestTiesToEven ULTIMATE.start___ieee754_atan2_~y c_ULTIMATE.start_main_~x~0))) (not (= (let ((.cse0 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_34|)) v_arrayElimCell_14))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (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|)))))) is different from true [2019-11-15 22:35:39,205 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 22:35:39,206 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1665169157] [2019-11-15 22:35:39,206 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:35:39,207 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [] total 20 [2019-11-15 22:35:39,207 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878734540] [2019-11-15 22:35:39,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-15 22:35:39,208 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:35:39,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-15 22:35:39,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=263, Unknown=3, NotChecked=66, Total=380 [2019-11-15 22:35:39,209 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand 20 states. [2019-11-15 22:35:45,239 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-11-15 22:35:46,155 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-15 22:35:46,896 WARN L191 SmtUtils]: Spent 331.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-15 22:35:48,639 WARN L191 SmtUtils]: Spent 1.51 s on a formula simplification that was a NOOP. DAG size: 56 [2019-11-15 22:35:49,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:35:49,697 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2019-11-15 22:35:49,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 22:35:49,711 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2019-11-15 22:35:49,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:35:49,712 INFO L225 Difference]: With dead ends: 62 [2019-11-15 22:35:49,712 INFO L226 Difference]: Without dead ends: 38 [2019-11-15 22:35:49,713 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=166, Invalid=489, Unknown=3, NotChecked=98, Total=756 [2019-11-15 22:35:49,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-15 22:35:49,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-11-15 22:35:49,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-15 22:35:49,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-11-15 22:35:49,721 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 36 [2019-11-15 22:35:49,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:35:49,722 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-11-15 22:35:49,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-15 22:35:49,722 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-11-15 22:35:49,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 22:35:49,724 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:35:49,724 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 22:35:49,950 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-15 22:35:49,951 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:35:49,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:35:49,951 INFO L82 PathProgramCache]: Analyzing trace with hash 70268002, now seen corresponding path program 1 times [2019-11-15 22:35:49,952 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:35:49,952 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [648116652] [2019-11-15 22:35:49,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2a0e3a8b-2ccc-41a6-a8e4-974717ee48b6/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 22:35:51,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:35:51,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-15 22:35:51,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:35:52,188 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 22:35:52,202 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:35:52,206 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:35:52,206 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:35:52,258 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:35:52,259 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 22:35:52,259 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:133, output treesize:94 [2019-11-15 22:35:53,589 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 22:35:53,589 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:35:53,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:35:54,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:35:54,535 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 22:35:54,541 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:35:54,545 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:35:54,546 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:35:54,564 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:35:54,565 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 22:35:54,565 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:85, output treesize:49 [2019-11-15 22:35:57,396 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_39| (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_39|)) (fp.div roundNearestTiesToEven c_ULTIMATE.start___ieee754_atan2_~y c_ULTIMATE.start___ieee754_atan2_~x))) (not (bvsgt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_39|)) (_ bv2146435072 32))))) is different from false [2019-11-15 22:35:59,865 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_39| (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_39|)) (fp.div roundNearestTiesToEven c_ULTIMATE.start___ieee754_atan2_~y c_ULTIMATE.start___ieee754_atan2_~x))) (not (bvsgt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_39|)) (_ bv2146435072 32))))) is different from true [2019-11-15 22:36:41,013 WARN L191 SmtUtils]: Spent 10.41 s on a formula simplification that was a NOOP. DAG size: 23 [2019-11-15 22:37:16,221 WARN L191 SmtUtils]: Spent 8.47 s on a formula simplification that was a NOOP. DAG size: 28 [2019-11-15 22:38:01,652 WARN L191 SmtUtils]: Spent 8.89 s on a formula simplification that was a NOOP. DAG size: 29 [2019-11-15 22:38:04,049 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((v_skolemized_v_prenex_22_5 (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_22_5) ((_ extract 62 52) v_skolemized_v_prenex_22_5) ((_ extract 51 0) v_skolemized_v_prenex_22_5)) c_ULTIMATE.start___ieee754_atan2_~y)) (bvsgt (bvashr (bvadd (bvneg c_ULTIMATE.start___ieee754_atan2_~ix~1) (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_22_5))) (_ bv20 32)) (_ bv60 32)))) (forall ((|v_skolemized_q#valueAsBitvector_39| (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_39|)) (fp.div roundNearestTiesToEven c_ULTIMATE.start___ieee754_atan2_~y c_ULTIMATE.start___ieee754_atan2_~x))) (not (bvsgt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_39|)) (_ bv2146435072 32)))))) is different from true [2019-11-15 22:38:06,457 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((v_skolemized_v_prenex_22_5 (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_22_5) ((_ extract 62 52) v_skolemized_v_prenex_22_5) ((_ extract 51 0) v_skolemized_v_prenex_22_5)) c_ULTIMATE.start___ieee754_atan2_~y)) (bvsgt (bvashr (bvadd (bvneg (bvand (_ bv2147483647 32) c_ULTIMATE.start___ieee754_atan2_~hx~1)) (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_22_5))) (_ bv20 32)) (_ bv60 32)))) (forall ((|v_skolemized_q#valueAsBitvector_39| (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_39|)) (fp.div roundNearestTiesToEven c_ULTIMATE.start___ieee754_atan2_~y c_ULTIMATE.start___ieee754_atan2_~x))) (not (bvsgt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_39|)) (_ bv2146435072 32)))))) is different from true [2019-11-15 22:38:08,765 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((|v_skolemized_q#valueAsBitvector_39| (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_39|)) (fp.div roundNearestTiesToEven c_ULTIMATE.start___ieee754_atan2_~y c_ULTIMATE.start___ieee754_atan2_~x))) (not (bvsgt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_39|)) (_ bv2146435072 32))))) (forall ((v_skolemized_v_prenex_22_5 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_36| (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_22_5) ((_ extract 62 52) v_skolemized_v_prenex_22_5) ((_ extract 51 0) v_skolemized_v_prenex_22_5)) c_ULTIMATE.start___ieee754_atan2_~y)) (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|)) c_ULTIMATE.start___ieee754_atan2_~x)) (bvsgt (bvashr (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_22_5)) (bvneg (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_36|)))) (_ bv20 32)) (_ bv60 32))))) is different from false [2019-11-15 22:38:13,177 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_39| (_ BitVec 64)) (v_skolemized_v_prenex_22_5 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_36| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_skolemized_v_prenex_22_5) ((_ extract 62 52) v_skolemized_v_prenex_22_5) ((_ extract 51 0) v_skolemized_v_prenex_22_5)))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_39|)) (fp.div roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~x~0))) (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|)) c_ULTIMATE.start_main_~x~0)) (bvsgt (bvashr (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_22_5)) (bvneg (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_36|)))) (_ bv20 32)) (_ bv60 32)) (not (fp.gt .cse0 (_ +zero 11 53))) (not (bvsgt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_39|)) (_ bv2146435072 32)))))) is different from true [2019-11-15 22:38:13,195 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 22:38:13,195 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [648116652] [2019-11-15 22:38:13,196 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:38:13,196 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [17, 17] imperfect sequences [] total 32 [2019-11-15 22:38:13,196 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653526042] [2019-11-15 22:38:13,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-15 22:38:13,197 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:38:13,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-15 22:38:13,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=594, Unknown=25, NotChecked=270, Total=992 [2019-11-15 22:38:13,198 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 32 states. [2019-11-15 22:38:17,798 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2019-11-15 22:38:21,263 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-11-15 22:38:21,856 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-15 22:38:25,711 WARN L191 SmtUtils]: Spent 347.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-11-15 22:38:26,896 WARN L191 SmtUtils]: Spent 622.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-15 22:38:29,914 WARN L191 SmtUtils]: Spent 513.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-11-15 22:38:32,832 WARN L191 SmtUtils]: Spent 540.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-11-15 22:38:39,834 WARN L191 SmtUtils]: Spent 4.46 s on a formula simplification. DAG size of input: 109 DAG size of output: 107 [2019-11-15 22:38:40,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:38:40,060 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-11-15 22:38:40,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 22:38:40,074 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 36 [2019-11-15 22:38:40,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:38:40,075 INFO L225 Difference]: With dead ends: 45 [2019-11-15 22:38:40,075 INFO L226 Difference]: Without dead ends: 38 [2019-11-15 22:38:40,076 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 158.8s TimeCoverageRelationStatistics Valid=411, Invalid=1224, Unknown=25, NotChecked=410, Total=2070 [2019-11-15 22:38:40,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-15 22:38:40,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-11-15 22:38:40,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-15 22:38:40,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 37 transitions. [2019-11-15 22:38:40,092 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 37 transitions. Word has length 36 [2019-11-15 22:38:40,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:38:40,097 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 37 transitions. [2019-11-15 22:38:40,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-15 22:38:40,097 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 37 transitions. [2019-11-15 22:38:40,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 22:38:40,100 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:38:40,100 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] [2019-11-15 22:38:40,314 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-15 22:38:40,314 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:38:40,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:38:40,314 INFO L82 PathProgramCache]: Analyzing trace with hash -85724530, now seen corresponding path program 1 times [2019-11-15 22:38:40,315 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:38:40,315 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [827993396] [2019-11-15 22:38:40,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2a0e3a8b-2ccc-41a6-a8e4-974717ee48b6/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 22:38:41,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:41,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 22:38:41,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:38:41,832 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-15 22:38:41,833 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.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) 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 22:38:41,837 INFO L168 Benchmark]: Toolchain (without parser) took 296254.68 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 255.3 MB). Free memory was 951.0 MB in the beginning and 886.7 MB in the end (delta: 64.3 MB). Peak memory consumption was 319.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:38:41,837 INFO L168 Benchmark]: CDTParser took 0.35 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 22:38:41,837 INFO L168 Benchmark]: CACSL2BoogieTranslator took 537.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -185.3 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:38:41,838 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.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: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:38:41,838 INFO L168 Benchmark]: Boogie Preprocessor took 100.80 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:38:41,838 INFO L168 Benchmark]: RCFGBuilder took 41772.15 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.0 MB). Peak memory consumption was 71.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:38:41,839 INFO L168 Benchmark]: TraceAbstraction took 253744.62 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 108.0 MB). Free memory was 1.1 GB in the beginning and 886.7 MB in the end (delta: 163.8 MB). Peak memory consumption was 271.8 MB. Max. memory is 11.5 GB. [2019-11-15 22:38:41,841 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.35 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 537.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -185.3 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 94.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: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 100.80 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 41772.15 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.0 MB). Peak memory consumption was 71.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 253744.62 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 108.0 MB). Free memory was 1.1 GB in the beginning and 886.7 MB in the end (delta: 163.8 MB). Peak memory consumption was 271.8 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...