./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1252a_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d2f81153-bc6f-4a7e-b4ec-08d5ab5cd3dc/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d2f81153-bc6f-4a7e-b4ec-08d5ab5cd3dc/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d2f81153-bc6f-4a7e-b4ec-08d5ab5cd3dc/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d2f81153-bc6f-4a7e-b4ec-08d5ab5cd3dc/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1252a_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d2f81153-bc6f-4a7e-b4ec-08d5ab5cd3dc/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d2f81153-bc6f-4a7e-b4ec-08d5ab5cd3dc/bin-2019/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 b649b8f673a0a47da0b16e77db6ba5e693ee3ba7 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d2f81153-bc6f-4a7e-b4ec-08d5ab5cd3dc/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d2f81153-bc6f-4a7e-b4ec-08d5ab5cd3dc/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d2f81153-bc6f-4a7e-b4ec-08d5ab5cd3dc/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d2f81153-bc6f-4a7e-b4ec-08d5ab5cd3dc/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1252a_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d2f81153-bc6f-4a7e-b4ec-08d5ab5cd3dc/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d2f81153-bc6f-4a7e-b4ec-08d5ab5cd3dc/bin-2019/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 b649b8f673a0a47da0b16e77db6ba5e693ee3ba7 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: nested self-update not yet implemented: (store v_arrayElimCell_5 (_ bv0 32) ((_ extract 31 0) |v_q#valueAsBitvector_5|)) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 12:27:01,303 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:27:01,304 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:27:01,312 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:27:01,312 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:27:01,313 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:27:01,313 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:27:01,314 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:27:01,315 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:27:01,316 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:27:01,317 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:27:01,317 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:27:01,317 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:27:01,318 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:27:01,319 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:27:01,319 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:27:01,320 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:27:01,321 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:27:01,323 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:27:01,324 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:27:01,324 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:27:01,325 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:27:01,327 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:27:01,327 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:27:01,327 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:27:01,328 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:27:01,329 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:27:01,329 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:27:01,330 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:27:01,331 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:27:01,331 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:27:01,331 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:27:01,331 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:27:01,332 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:27:01,332 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:27:01,333 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:27:01,333 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d2f81153-bc6f-4a7e-b4ec-08d5ab5cd3dc/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:27:01,342 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:27:01,342 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:27:01,343 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:27:01,343 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:27:01,343 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:27:01,344 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:27:01,344 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:27:01,344 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:27:01,344 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:27:01,344 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:27:01,344 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:27:01,344 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:27:01,345 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:27:01,345 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:27:01,345 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:27:01,345 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:27:01,345 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:27:01,345 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:27:01,345 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:27:01,345 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:27:01,345 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:27:01,346 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:27:01,346 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:27:01,346 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:27:01,346 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:27:01,346 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:27:01,346 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:27:01,346 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:27:01,346 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:27:01,346 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:27:01,346 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/working_dir_d2f81153-bc6f-4a7e-b4ec-08d5ab5cd3dc/bin-2019/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 -> b649b8f673a0a47da0b16e77db6ba5e693ee3ba7 [2018-11-23 12:27:01,368 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:27:01,375 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:27:01,378 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:27:01,379 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:27:01,379 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:27:01,380 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d2f81153-bc6f-4a7e-b4ec-08d5ab5cd3dc/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1252a_true-unreach-call.c [2018-11-23 12:27:01,414 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d2f81153-bc6f-4a7e-b4ec-08d5ab5cd3dc/bin-2019/uautomizer/data/797f5bed5/6cde40c4021844d283424d346ac1a1cd/FLAG47d6c3b49 [2018-11-23 12:27:01,810 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:27:01,811 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d2f81153-bc6f-4a7e-b4ec-08d5ab5cd3dc/sv-benchmarks/c/float-newlib/double_req_bl_1252a_true-unreach-call.c [2018-11-23 12:27:01,816 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d2f81153-bc6f-4a7e-b4ec-08d5ab5cd3dc/bin-2019/uautomizer/data/797f5bed5/6cde40c4021844d283424d346ac1a1cd/FLAG47d6c3b49 [2018-11-23 12:27:01,826 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d2f81153-bc6f-4a7e-b4ec-08d5ab5cd3dc/bin-2019/uautomizer/data/797f5bed5/6cde40c4021844d283424d346ac1a1cd [2018-11-23 12:27:01,829 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:27:01,830 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:27:01,831 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:27:01,831 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:27:01,834 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:27:01,834 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:27:01" (1/1) ... [2018-11-23 12:27:01,836 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76b02929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:01, skipping insertion in model container [2018-11-23 12:27:01,836 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:27:01" (1/1) ... [2018-11-23 12:27:01,842 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:27:01,855 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:27:01,970 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:27:01,973 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:27:01,993 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:27:02,007 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:27:02,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:02 WrapperNode [2018-11-23 12:27:02,007 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:27:02,008 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:27:02,008 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:27:02,008 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:27:02,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:02" (1/1) ... [2018-11-23 12:27:02,020 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:02" (1/1) ... [2018-11-23 12:27:02,060 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:27:02,061 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:27:02,061 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:27:02,061 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:27:02,068 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:02" (1/1) ... [2018-11-23 12:27:02,068 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:02" (1/1) ... [2018-11-23 12:27:02,070 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:02" (1/1) ... [2018-11-23 12:27:02,070 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:02" (1/1) ... [2018-11-23 12:27:02,078 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:02" (1/1) ... [2018-11-23 12:27:02,082 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:02" (1/1) ... [2018-11-23 12:27:02,084 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:02" (1/1) ... [2018-11-23 12:27:02,086 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:27:02,086 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:27:02,086 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:27:02,086 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:27:02,087 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d2f81153-bc6f-4a7e-b4ec-08d5ab5cd3dc/bin-2019/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 [2018-11-23 12:27:02,121 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2018-11-23 12:27:02,121 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2018-11-23 12:27:02,121 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:27:02,121 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:27:02,121 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2018-11-23 12:27:02,121 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2018-11-23 12:27:02,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:27:02,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:27:02,122 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_double [2018-11-23 12:27:02,122 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_double [2018-11-23 12:27:02,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 12:27:02,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:27:02,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:27:02,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:27:02,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:27:02,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:27:02,317 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:27:02,317 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 12:27:02,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:27:02 BoogieIcfgContainer [2018-11-23 12:27:02,317 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:27:02,318 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:27:02,318 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:27:02,321 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:27:02,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:27:01" (1/3) ... [2018-11-23 12:27:02,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d768ecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:27:02, skipping insertion in model container [2018-11-23 12:27:02,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:02" (2/3) ... [2018-11-23 12:27:02,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d768ecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:27:02, skipping insertion in model container [2018-11-23 12:27:02,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:27:02" (3/3) ... [2018-11-23 12:27:02,324 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1252a_true-unreach-call.c [2018-11-23 12:27:02,332 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:27:02,339 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:27:02,356 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:27:02,382 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:27:02,382 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:27:02,382 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:27:02,382 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:27:02,383 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:27:02,383 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:27:02,383 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:27:02,383 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:27:02,383 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:27:02,398 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-11-23 12:27:02,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:27:02,404 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:02,404 INFO L402 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] [2018-11-23 12:27:02,406 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:02,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:02,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1757694217, now seen corresponding path program 1 times [2018-11-23 12:27:02,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:02,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:02,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:02,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:02,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:02,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:02,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:27:02,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:27:02,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:27:02,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:27:02,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:27:02,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:27:02,540 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2018-11-23 12:27:02,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:02,559 INFO L93 Difference]: Finished difference Result 79 states and 107 transitions. [2018-11-23 12:27:02,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:27:02,560 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-11-23 12:27:02,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:02,567 INFO L225 Difference]: With dead ends: 79 [2018-11-23 12:27:02,568 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 12:27:02,570 INFO L631 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 [2018-11-23 12:27:02,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 12:27:02,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 12:27:02,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:27:02,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2018-11-23 12:27:02,596 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 22 [2018-11-23 12:27:02,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:02,596 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-11-23 12:27:02,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:27:02,596 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-23 12:27:02,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:27:02,598 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:02,598 INFO L402 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] [2018-11-23 12:27:02,598 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:02,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:02,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1795675250, now seen corresponding path program 1 times [2018-11-23 12:27:02,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:02,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:02,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:02,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:02,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:02,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:02,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:27:02,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:27:02,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:27:02,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:27:02,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:27:02,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:27:02,677 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 4 states. [2018-11-23 12:27:02,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:02,709 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2018-11-23 12:27:02,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:27:02,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-23 12:27:02,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:02,711 INFO L225 Difference]: With dead ends: 59 [2018-11-23 12:27:02,711 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 12:27:02,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:27:02,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 12:27:02,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-23 12:27:02,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:27:02,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2018-11-23 12:27:02,717 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 23 [2018-11-23 12:27:02,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:02,717 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2018-11-23 12:27:02,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:27:02,717 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-11-23 12:27:02,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:27:02,718 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:02,718 INFO L402 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] [2018-11-23 12:27:02,718 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:02,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:02,718 INFO L82 PathProgramCache]: Analyzing trace with hash 2106279408, now seen corresponding path program 1 times [2018-11-23 12:27:02,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:02,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:02,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:02,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:02,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:02,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:02,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:27:02,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:27:02,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:27:02,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:27:02,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:27:02,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:27:02,772 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 4 states. [2018-11-23 12:27:02,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:02,791 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2018-11-23 12:27:02,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:27:02,791 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-11-23 12:27:02,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:02,792 INFO L225 Difference]: With dead ends: 63 [2018-11-23 12:27:02,793 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 12:27:02,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:27:02,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 12:27:02,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-11-23 12:27:02,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:27:02,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2018-11-23 12:27:02,799 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 26 [2018-11-23 12:27:02,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:02,799 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2018-11-23 12:27:02,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:27:02,799 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-11-23 12:27:02,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:27:02,800 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:02,800 INFO L402 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] [2018-11-23 12:27:02,800 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:02,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:02,801 INFO L82 PathProgramCache]: Analyzing trace with hash 309328049, now seen corresponding path program 1 times [2018-11-23 12:27:02,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:02,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:02,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:02,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:02,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:02,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:27:02,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:27:02,849 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=4293918727, |#NULL.offset|=4293918722, |old(#NULL.base)|=4293918727, |old(#NULL.offset)|=4293918722] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=4293918727, |old(#NULL.offset)|=4293918722] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=4293918727, |old(#NULL.offset)|=4293918722] [?] RET #94#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret12 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~x~0 := ~someUnaryDOUBLEoperation(0.0);~y~0 := 0.0; VAL [main_~y~0=0.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |fmax_double_#in~x|=4293918726.0, |fmax_double_#in~y|=0.0] [?] ~x := #in~x;~y := #in~y; VAL [fmax_double_~x=4293918726.0, fmax_double_~y=0.0, |#NULL.base|=0, |#NULL.offset|=0, |fmax_double_#in~x|=4293918726.0, |fmax_double_#in~y|=0.0] [?] CALL call #t~ret4 := __fpclassify_double(~x); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4293918726.0] [?] ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; VAL [__fpclassify_double_~x=4293918726.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4293918726.0] [?] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem0;call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem0;havoc #t~union1;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem2;call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem2;havoc #t~union3;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [__fpclassify_double_~lsw~0=1, __fpclassify_double_~msw~0=4293918721, __fpclassify_double_~x=4293918726.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4293918726.0] [?] goto; VAL [__fpclassify_double_~lsw~0=1, __fpclassify_double_~msw~0=4293918721, __fpclassify_double_~x=4293918726.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4293918726.0] [?] assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); VAL [__fpclassify_double_~lsw~0=1, __fpclassify_double_~msw~0=4293918721, __fpclassify_double_~x=4293918726.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4293918726.0] [?] assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); VAL [__fpclassify_double_~lsw~0=1, __fpclassify_double_~msw~0=4293918721, __fpclassify_double_~x=4293918726.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4293918726.0] [?] assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); VAL [__fpclassify_double_~lsw~0=1, __fpclassify_double_~msw~0=4293918721, __fpclassify_double_~x=4293918726.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4293918726.0] [?] assume !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296));#res := 0; VAL [__fpclassify_double_~lsw~0=1, __fpclassify_double_~msw~0=4293918721, __fpclassify_double_~x=4293918726.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4293918726.0, |__fpclassify_double_#res|=0] [?] assume true; VAL [__fpclassify_double_~lsw~0=1, __fpclassify_double_~msw~0=4293918721, __fpclassify_double_~x=4293918726.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4293918726.0, |__fpclassify_double_#res|=0] [?] RET #90#return; VAL [fmax_double_~x=4293918726.0, fmax_double_~y=0.0, |#NULL.base|=0, |#NULL.offset|=0, |fmax_double_#in~x|=4293918726.0, |fmax_double_#in~y|=0.0, |fmax_double_#t~ret4|=0] [?] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [fmax_double_~x=4293918726.0, fmax_double_~y=0.0, |#NULL.base|=0, |#NULL.offset|=0, |fmax_double_#in~x|=4293918726.0, |fmax_double_#in~y|=0.0, |fmax_double_#t~ret4|=0] [?] assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; VAL [fmax_double_~x=4293918726.0, fmax_double_~y=0.0, |#NULL.base|=0, |#NULL.offset|=0, |fmax_double_#in~x|=4293918726.0, |fmax_double_#in~y|=0.0, |fmax_double_#res|=0.0] [?] assume true; VAL [fmax_double_~x=4293918726.0, fmax_double_~y=0.0, |#NULL.base|=0, |#NULL.offset|=0, |fmax_double_#in~x|=4293918726.0, |fmax_double_#in~y|=0.0, |fmax_double_#res|=0.0] [?] RET #98#return; VAL [main_~x~0=4293918726.0, main_~y~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret9|=0.0] [?] ~res~0 := #t~ret9;havoc #t~ret9;#t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [main_~res~0=0.0, main_~x~0=4293918726.0, main_~y~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short11|=false] [?] assume !#t~short11; VAL [main_~res~0=0.0, main_~x~0=4293918726.0, main_~y~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short11|=false] [?] assume !#t~short11;havoc #t~ret10;havoc #t~short11; VAL [main_~res~0=0.0, main_~x~0=4293918726.0, main_~y~0=0.0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !false; VAL [main_~res~0=0.0, main_~x~0=4293918726.0, main_~y~0=0.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=4293918727, #NULL.offset=4293918722, old(#NULL.base)=4293918727, old(#NULL.offset)=4293918722] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=4293918727, old(#NULL.offset)=4293918722] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=4293918727, old(#NULL.offset)=4293918722] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L79] ~x~0 := ~someUnaryDOUBLEoperation(0.0); [L80] ~y~0 := 0.0; VAL [#NULL.base=0, #NULL.offset=0, ~y~0=0.0] [L81] CALL call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#in~x=4.293918726E9, #in~y=0.0, #NULL.base=0, #NULL.offset=0] [L50-L58] ~x := #in~x; [L50-L58] ~y := #in~y; VAL [#in~x=4.293918726E9, #in~y=0.0, #NULL.base=0, #NULL.offset=0, ~x=4.293918726E9, ~y=0.0] [L52] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.293918726E9, #NULL.base=0, #NULL.offset=0] [L23-L48] ~x := #in~x; [L24] havoc ~msw~0; [L24] havoc ~lsw~0; VAL [#in~x=4.293918726E9, #NULL.base=0, #NULL.offset=0, ~x=4.293918726E9] [L27] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L28] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L29] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L29] ~msw~0 := #t~mem0; [L29] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L29] havoc #t~mem0; [L29] havoc #t~union1; [L30] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L30] ~lsw~0 := #t~mem2; [L30] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L27] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L27] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=4.293918726E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918726E9] [L33-L47] assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); VAL [#in~x=4.293918726E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918726E9] [L36-L47] assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); VAL [#in~x=4.293918726E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918726E9] [L39-L47] assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); VAL [#in~x=4.293918726E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918726E9] [L43-L47] assume !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); [L47] #res := 0; VAL [#in~x=4.293918726E9, #NULL.base=0, #NULL.offset=0, #res=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918726E9] [L23-L48] ensures true; VAL [#in~x=4.293918726E9, #NULL.base=0, #NULL.offset=0, #res=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918726E9] [L52] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.293918726E9, #in~y=0.0, #NULL.base=0, #NULL.offset=0, #t~ret4=0, ~x=4.293918726E9, ~y=0.0] [L52] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=4.293918726E9, #in~y=0.0, #NULL.base=0, #NULL.offset=0, #t~ret4=0, ~x=4.293918726E9, ~y=0.0] [L52-L53] assume 0 == #t~ret4; [L52] havoc #t~ret4; [L53] #res := ~y; VAL [#in~x=4.293918726E9, #in~y=0.0, #NULL.base=0, #NULL.offset=0, #res=0.0, ~x=4.293918726E9, ~y=0.0] [L50-L58] ensures true; VAL [#in~x=4.293918726E9, #in~y=0.0, #NULL.base=0, #NULL.offset=0, #res=0.0, ~x=4.293918726E9, ~y=0.0] [L81] RET call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret9=0.0, ~x~0=4.293918726E9, ~y~0=0.0] [L81] ~res~0 := #t~ret9; [L81] havoc #t~ret9; [L84] #t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL.base=0, #NULL.offset=0, #t~short11=false, ~res~0=0.0, ~x~0=4.293918726E9, ~y~0=0.0] [L84] assume !#t~short11; VAL [#NULL.base=0, #NULL.offset=0, #t~short11=false, ~res~0=0.0, ~x~0=4.293918726E9, ~y~0=0.0] [L84-L87] assume !#t~short11; [L84] havoc #t~ret10; [L84] havoc #t~short11; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=0.0, ~x~0=4.293918726E9, ~y~0=0.0] [L85] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=0.0, ~x~0=4.293918726E9, ~y~0=0.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=4293918727, #NULL.offset=4293918722, old(#NULL.base)=4293918727, old(#NULL.offset)=4293918722] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=4293918727, old(#NULL.offset)=4293918722] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=4293918727, old(#NULL.offset)=4293918722] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L79] ~x~0 := ~someUnaryDOUBLEoperation(0.0); [L80] ~y~0 := 0.0; VAL [#NULL.base=0, #NULL.offset=0, ~y~0=0.0] [L81] CALL call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#in~x=4.293918726E9, #in~y=0.0, #NULL.base=0, #NULL.offset=0] [L50-L58] ~x := #in~x; [L50-L58] ~y := #in~y; VAL [#in~x=4.293918726E9, #in~y=0.0, #NULL.base=0, #NULL.offset=0, ~x=4.293918726E9, ~y=0.0] [L52] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.293918726E9, #NULL.base=0, #NULL.offset=0] [L23-L48] ~x := #in~x; [L24] havoc ~msw~0; [L24] havoc ~lsw~0; VAL [#in~x=4.293918726E9, #NULL.base=0, #NULL.offset=0, ~x=4.293918726E9] [L27] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L28] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L29] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L29] ~msw~0 := #t~mem0; [L29] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L29] havoc #t~mem0; [L29] havoc #t~union1; [L30] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L30] ~lsw~0 := #t~mem2; [L30] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L27] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L27] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=4.293918726E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918726E9] [L33-L47] assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); VAL [#in~x=4.293918726E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918726E9] [L36-L47] assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); VAL [#in~x=4.293918726E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918726E9] [L39-L47] assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); VAL [#in~x=4.293918726E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918726E9] [L43-L47] assume !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); [L47] #res := 0; VAL [#in~x=4.293918726E9, #NULL.base=0, #NULL.offset=0, #res=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918726E9] [L23-L48] ensures true; VAL [#in~x=4.293918726E9, #NULL.base=0, #NULL.offset=0, #res=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918726E9] [L52] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.293918726E9, #in~y=0.0, #NULL.base=0, #NULL.offset=0, #t~ret4=0, ~x=4.293918726E9, ~y=0.0] [L52] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=4.293918726E9, #in~y=0.0, #NULL.base=0, #NULL.offset=0, #t~ret4=0, ~x=4.293918726E9, ~y=0.0] [L52-L53] assume 0 == #t~ret4; [L52] havoc #t~ret4; [L53] #res := ~y; VAL [#in~x=4.293918726E9, #in~y=0.0, #NULL.base=0, #NULL.offset=0, #res=0.0, ~x=4.293918726E9, ~y=0.0] [L50-L58] ensures true; VAL [#in~x=4.293918726E9, #in~y=0.0, #NULL.base=0, #NULL.offset=0, #res=0.0, ~x=4.293918726E9, ~y=0.0] [L81] RET call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret9=0.0, ~x~0=4.293918726E9, ~y~0=0.0] [L81] ~res~0 := #t~ret9; [L81] havoc #t~ret9; [L84] #t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL.base=0, #NULL.offset=0, #t~short11=false, ~res~0=0.0, ~x~0=4.293918726E9, ~y~0=0.0] [L84] assume !#t~short11; VAL [#NULL.base=0, #NULL.offset=0, #t~short11=false, ~res~0=0.0, ~x~0=4.293918726E9, ~y~0=0.0] [L84-L87] assume !#t~short11; [L84] havoc #t~ret10; [L84] havoc #t~short11; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=0.0, ~x~0=4.293918726E9, ~y~0=0.0] [L85] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=0.0, ~x~0=4.293918726E9, ~y~0=0.0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4293918727, #NULL!offset=4293918722, old(#NULL!base)=4293918727, old(#NULL!offset)=4293918722] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=4293918727, old(#NULL!offset)=4293918722] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L79] ~x~0 := ~someUnaryDOUBLEoperation(0.0); [L80] ~y~0 := 0.0; VAL [#NULL!base=0, #NULL!offset=0, ~y~0=0.0] [L81] CALL call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#in~x=4.293918726E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0] [L50-L58] ~x := #in~x; [L50-L58] ~y := #in~y; VAL [#in~x=4.293918726E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0, ~x=4.293918726E9, ~y=0.0] [L52] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.293918726E9, #NULL!base=0, #NULL!offset=0] [L23-L48] ~x := #in~x; [L24] havoc ~msw~0; [L24] havoc ~lsw~0; VAL [#in~x=4.293918726E9, #NULL!base=0, #NULL!offset=0, ~x=4.293918726E9] [L27] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L28] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L29] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L29] ~msw~0 := #t~mem0; [L29] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L29] havoc #t~mem0; [L29] havoc #t~union1; [L30] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L30] ~lsw~0 := #t~mem2; [L30] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L27] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L27] havoc ~#ew_u~0; VAL [#in~x=4.293918726E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918726E9] [L33-L34] COND FALSE !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) VAL [#in~x=4.293918726E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918726E9] [L36-L37] COND FALSE !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)) VAL [#in~x=4.293918726E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918726E9] [L39-L40] COND FALSE !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)) VAL [#in~x=4.293918726E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918726E9] [L43-L44] COND FALSE !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L47] #res := 0; VAL [#in~x=4.293918726E9, #NULL!base=0, #NULL!offset=0, #res=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918726E9] [L52] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.293918726E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.293918726E9, ~y=0.0] [L52] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=4.293918726E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.293918726E9, ~y=0.0] [L52] COND TRUE 0 == #t~ret4 [L52] havoc #t~ret4; [L53] #res := ~y; VAL [#in~x=4.293918726E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0, #res=0.0, ~x=4.293918726E9, ~y=0.0] [L81] RET call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=0.0, ~x~0=4.293918726E9, ~y~0=0.0] [L81] ~res~0 := #t~ret9; [L81] havoc #t~ret9; [L84] #t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, #t~short11=false, ~res~0=0.0, ~x~0=4.293918726E9, ~y~0=0.0] [L84] COND FALSE !(#t~short11) VAL [#NULL!base=0, #NULL!offset=0, #t~short11=false, ~res~0=0.0, ~x~0=4.293918726E9, ~y~0=0.0] [L84] COND TRUE !#t~short11 [L84] havoc #t~ret10; [L84] havoc #t~short11; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=0.0, ~x~0=4.293918726E9, ~y~0=0.0] [L85] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=0.0, ~x~0=4.293918726E9, ~y~0=0.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4293918727, #NULL!offset=4293918722, old(#NULL!base)=4293918727, old(#NULL!offset)=4293918722] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=4293918727, old(#NULL!offset)=4293918722] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L79] ~x~0 := ~someUnaryDOUBLEoperation(0.0); [L80] ~y~0 := 0.0; VAL [#NULL!base=0, #NULL!offset=0, ~y~0=0.0] [L81] CALL call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#in~x=4.293918726E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0] [L50-L58] ~x := #in~x; [L50-L58] ~y := #in~y; VAL [#in~x=4.293918726E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0, ~x=4.293918726E9, ~y=0.0] [L52] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.293918726E9, #NULL!base=0, #NULL!offset=0] [L23-L48] ~x := #in~x; [L24] havoc ~msw~0; [L24] havoc ~lsw~0; VAL [#in~x=4.293918726E9, #NULL!base=0, #NULL!offset=0, ~x=4.293918726E9] [L27] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L28] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L29] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L29] ~msw~0 := #t~mem0; [L29] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L29] havoc #t~mem0; [L29] havoc #t~union1; [L30] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L30] ~lsw~0 := #t~mem2; [L30] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L27] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L27] havoc ~#ew_u~0; VAL [#in~x=4.293918726E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918726E9] [L33-L34] COND FALSE !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) VAL [#in~x=4.293918726E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918726E9] [L36-L37] COND FALSE !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)) VAL [#in~x=4.293918726E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918726E9] [L39-L40] COND FALSE !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)) VAL [#in~x=4.293918726E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918726E9] [L43-L44] COND FALSE !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L47] #res := 0; VAL [#in~x=4.293918726E9, #NULL!base=0, #NULL!offset=0, #res=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918726E9] [L52] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.293918726E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.293918726E9, ~y=0.0] [L52] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=4.293918726E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.293918726E9, ~y=0.0] [L52] COND TRUE 0 == #t~ret4 [L52] havoc #t~ret4; [L53] #res := ~y; VAL [#in~x=4.293918726E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0, #res=0.0, ~x=4.293918726E9, ~y=0.0] [L81] RET call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=0.0, ~x~0=4.293918726E9, ~y~0=0.0] [L81] ~res~0 := #t~ret9; [L81] havoc #t~ret9; [L84] #t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, #t~short11=false, ~res~0=0.0, ~x~0=4.293918726E9, ~y~0=0.0] [L84] COND FALSE !(#t~short11) VAL [#NULL!base=0, #NULL!offset=0, #t~short11=false, ~res~0=0.0, ~x~0=4.293918726E9, ~y~0=0.0] [L84] COND TRUE !#t~short11 [L84] havoc #t~ret10; [L84] havoc #t~short11; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=0.0, ~x~0=4.293918726E9, ~y~0=0.0] [L85] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=0.0, ~x~0=4.293918726E9, ~y~0=0.0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4293918727, #NULL!offset=4293918722, old(#NULL!base)=4293918727, old(#NULL!offset)=4293918722] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=4293918727, old(#NULL!offset)=4293918722] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L79] ~x~0 := ~someUnaryDOUBLEoperation(0.0); [L80] ~y~0 := 0.0; VAL [#NULL!base=0, #NULL!offset=0, ~y~0=0.0] [L81] CALL call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#in~x=4.293918726E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0] [L50-L58] ~x := #in~x; [L50-L58] ~y := #in~y; VAL [#in~x=4.293918726E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0, ~x=4.293918726E9, ~y=0.0] [L52] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.293918726E9, #NULL!base=0, #NULL!offset=0] [L23-L48] ~x := #in~x; [L24] havoc ~msw~0; [L24] havoc ~lsw~0; VAL [#in~x=4.293918726E9, #NULL!base=0, #NULL!offset=0, ~x=4.293918726E9] [L27] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L28] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L29] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L29] ~msw~0 := #t~mem0; [L29] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L29] havoc #t~mem0; [L29] havoc #t~union1; [L30] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L30] ~lsw~0 := #t~mem2; [L30] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L27] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L27] havoc ~#ew_u~0; VAL [#in~x=4.293918726E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918726E9] [L33-L34] COND FALSE !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) VAL [#in~x=4.293918726E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918726E9] [L36-L37] COND FALSE !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)) VAL [#in~x=4.293918726E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918726E9] [L39-L40] COND FALSE !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)) VAL [#in~x=4.293918726E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918726E9] [L43-L44] COND FALSE !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L47] #res := 0; VAL [#in~x=4.293918726E9, #NULL!base=0, #NULL!offset=0, #res=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918726E9] [L52] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.293918726E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.293918726E9, ~y=0.0] [L52] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=4.293918726E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.293918726E9, ~y=0.0] [L52] COND TRUE 0 == #t~ret4 [L52] havoc #t~ret4; [L53] #res := ~y; VAL [#in~x=4.293918726E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0, #res=0.0, ~x=4.293918726E9, ~y=0.0] [L81] RET call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=0.0, ~x~0=4.293918726E9, ~y~0=0.0] [L81] ~res~0 := #t~ret9; [L81] havoc #t~ret9; [L84] #t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, #t~short11=false, ~res~0=0.0, ~x~0=4.293918726E9, ~y~0=0.0] [L84] COND FALSE !(#t~short11) VAL [#NULL!base=0, #NULL!offset=0, #t~short11=false, ~res~0=0.0, ~x~0=4.293918726E9, ~y~0=0.0] [L84] COND TRUE !#t~short11 [L84] havoc #t~ret10; [L84] havoc #t~short11; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=0.0, ~x~0=4.293918726E9, ~y~0=0.0] [L85] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=0.0, ~x~0=4.293918726E9, ~y~0=0.0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4293918727, #NULL!offset=4293918722, old(#NULL!base)=4293918727, old(#NULL!offset)=4293918722] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=4293918727, old(#NULL!offset)=4293918722] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L79] ~x~0 := ~someUnaryDOUBLEoperation(0.0); [L80] ~y~0 := 0.0; VAL [#NULL!base=0, #NULL!offset=0, ~y~0=0.0] [L81] CALL call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#in~x=4.293918726E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0] [L50-L58] ~x := #in~x; [L50-L58] ~y := #in~y; VAL [#in~x=4.293918726E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0, ~x=4.293918726E9, ~y=0.0] [L52] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.293918726E9, #NULL!base=0, #NULL!offset=0] [L23-L48] ~x := #in~x; [L24] havoc ~msw~0; [L24] havoc ~lsw~0; VAL [#in~x=4.293918726E9, #NULL!base=0, #NULL!offset=0, ~x=4.293918726E9] [L27] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L28] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L29] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L29] ~msw~0 := #t~mem0; [L29] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L29] havoc #t~mem0; [L29] havoc #t~union1; [L30] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L30] ~lsw~0 := #t~mem2; [L30] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L27] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L27] havoc ~#ew_u~0; VAL [#in~x=4.293918726E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918726E9] [L33-L34] COND FALSE !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) VAL [#in~x=4.293918726E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918726E9] [L36-L37] COND FALSE !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)) VAL [#in~x=4.293918726E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918726E9] [L39-L40] COND FALSE !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)) VAL [#in~x=4.293918726E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918726E9] [L43-L44] COND FALSE !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L47] #res := 0; VAL [#in~x=4.293918726E9, #NULL!base=0, #NULL!offset=0, #res=0, ~lsw~0=1, ~msw~0=4293918721, ~x=4.293918726E9] [L52] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.293918726E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.293918726E9, ~y=0.0] [L52] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=4.293918726E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.293918726E9, ~y=0.0] [L52] COND TRUE 0 == #t~ret4 [L52] havoc #t~ret4; [L53] #res := ~y; VAL [#in~x=4.293918726E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0, #res=0.0, ~x=4.293918726E9, ~y=0.0] [L81] RET call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=0.0, ~x~0=4.293918726E9, ~y~0=0.0] [L81] ~res~0 := #t~ret9; [L81] havoc #t~ret9; [L84] #t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, #t~short11=false, ~res~0=0.0, ~x~0=4.293918726E9, ~y~0=0.0] [L84] COND FALSE !(#t~short11) VAL [#NULL!base=0, #NULL!offset=0, #t~short11=false, ~res~0=0.0, ~x~0=4.293918726E9, ~y~0=0.0] [L84] COND TRUE !#t~short11 [L84] havoc #t~ret10; [L84] havoc #t~short11; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=0.0, ~x~0=4.293918726E9, ~y~0=0.0] [L85] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=0.0, ~x~0=4.293918726E9, ~y~0=0.0] [L79] double x = -0.0; [L80] double y = 0.0; VAL [y=0] [L81] CALL, EXPR fmax_double(x, y) VAL [\old(x)=4293918726, \old(y)=0] [L52] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=4293918726] [L24] __uint32_t msw, lsw; VAL [\old(x)=4293918726, x=4293918726] [L27] ieee_double_shape_type ew_u; [L28] ew_u.value = (x) [L29] EXPR ew_u.parts.msw [L29] (msw) = ew_u.parts.msw [L30] EXPR ew_u.parts.lsw [L30] (lsw) = ew_u.parts.lsw [L33-L34] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=4293918726, lsw=1, msw=4293918721, x=4293918726] [L36-L37] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=4293918726, lsw=1, msw=4293918721, x=4293918726] [L39-L40] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=4293918726, lsw=1, msw=4293918721, x=4293918726] [L43-L44] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L47] return 0; VAL [\old(x)=4293918726, \result=0, lsw=1, msw=4293918721, x=4293918726] [L52] RET, EXPR __fpclassify_double(x) VAL [\old(x)=4293918726, \old(y)=0, __fpclassify_double(x)=0, x=4293918726, y=0] [L52] COND TRUE __fpclassify_double(x) == 0 [L53] return y; VAL [\old(x)=4293918726, \old(y)=0, \result=0, x=4293918726, y=0] [L81] RET, EXPR fmax_double(x, y) VAL [fmax_double(x, y)=0, x=4293918726, y=0] [L81] double res = fmax_double(x, y); [L84] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [res=0, res == 0.0 && __signbit_double(res) == 0=0, x=4293918726, y=0] [L84] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L85] __VERIFIER_error() VAL [res=0, x=4293918726, y=0] ----- [2018-11-23 12:27:02,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:27:02 BoogieIcfgContainer [2018-11-23 12:27:02,884 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:27:02,884 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:27:02,884 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:27:02,884 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:27:02,885 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:27:02" (3/4) ... [2018-11-23 12:27:02,888 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 12:27:02,888 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:27:02,889 INFO L168 Benchmark]: Toolchain (without parser) took 1059.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 958.2 MB in the beginning and 1.1 GB in the end (delta: -98.6 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. [2018-11-23 12:27:02,890 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:27:02,891 INFO L168 Benchmark]: CACSL2BoogieTranslator took 176.79 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 944.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 12:27:02,891 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -185.4 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-23 12:27:02,892 INFO L168 Benchmark]: Boogie Preprocessor took 25.01 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:27:02,892 INFO L168 Benchmark]: RCFGBuilder took 231.55 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-23 12:27:02,893 INFO L168 Benchmark]: TraceAbstraction took 566.01 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: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 11.5 GB. [2018-11-23 12:27:02,893 INFO L168 Benchmark]: Witness Printer took 3.93 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:27:02,896 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 176.79 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 944.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -185.4 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.01 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 231.55 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 566.01 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: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.93 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 85]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someUnaryDOUBLEoperation at line 79. Possible FailurePath: [L79] double x = -0.0; [L80] double y = 0.0; VAL [y=0] [L81] CALL, EXPR fmax_double(x, y) VAL [\old(x)=4293918726, \old(y)=0] [L52] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=4293918726] [L24] __uint32_t msw, lsw; VAL [\old(x)=4293918726, x=4293918726] [L27] ieee_double_shape_type ew_u; [L28] ew_u.value = (x) [L29] EXPR ew_u.parts.msw [L29] (msw) = ew_u.parts.msw [L30] EXPR ew_u.parts.lsw [L30] (lsw) = ew_u.parts.lsw [L33-L34] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=4293918726, lsw=1, msw=4293918721, x=4293918726] [L36-L37] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=4293918726, lsw=1, msw=4293918721, x=4293918726] [L39-L40] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=4293918726, lsw=1, msw=4293918721, x=4293918726] [L43-L44] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L47] return 0; VAL [\old(x)=4293918726, \result=0, lsw=1, msw=4293918721, x=4293918726] [L52] RET, EXPR __fpclassify_double(x) VAL [\old(x)=4293918726, \old(y)=0, __fpclassify_double(x)=0, x=4293918726, y=0] [L52] COND TRUE __fpclassify_double(x) == 0 [L53] return y; VAL [\old(x)=4293918726, \old(y)=0, \result=0, x=4293918726, y=0] [L81] RET, EXPR fmax_double(x, y) VAL [fmax_double(x, y)=0, x=4293918726, y=0] [L81] double res = fmax_double(x, y); [L84] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [res=0, res == 0.0 && __signbit_double(res) == 0=0, x=4293918726, y=0] [L84] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L85] __VERIFIER_error() VAL [res=0, x=4293918726, y=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 44 locations, 1 error locations. UNSAFE Result, 0.5s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 144 SDtfs, 0 SDslu, 172 SDs, 0 SdLazy, 17 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 97 NumberOfCodeBlocks, 97 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 68 ConstructedInterpolants, 0 QuantifiedInterpolants, 1926 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: 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.23-aa41828 [2018-11-23 12:27:04,366 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:27:04,367 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:27:04,375 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:27:04,376 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:27:04,376 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:27:04,377 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:27:04,378 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:27:04,379 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:27:04,380 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:27:04,380 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:27:04,380 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:27:04,381 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:27:04,382 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:27:04,383 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:27:04,383 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:27:04,384 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:27:04,385 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:27:04,386 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:27:04,387 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:27:04,388 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:27:04,389 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:27:04,390 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:27:04,390 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:27:04,391 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:27:04,391 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:27:04,392 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:27:04,393 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:27:04,393 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:27:04,394 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:27:04,394 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:27:04,394 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:27:04,395 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:27:04,395 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:27:04,395 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:27:04,396 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:27:04,396 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d2f81153-bc6f-4a7e-b4ec-08d5ab5cd3dc/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 12:27:04,406 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:27:04,406 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:27:04,407 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:27:04,407 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:27:04,407 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:27:04,408 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:27:04,408 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:27:04,408 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:27:04,408 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:27:04,408 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:27:04,408 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:27:04,408 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:27:04,408 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:27:04,409 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:27:04,409 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 12:27:04,409 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 12:27:04,409 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:27:04,409 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:27:04,409 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:27:04,409 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:27:04,410 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:27:04,410 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:27:04,410 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:27:04,410 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:27:04,410 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:27:04,410 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:27:04,410 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:27:04,410 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:27:04,411 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 12:27:04,411 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:27:04,411 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 12:27:04,411 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 12:27:04,411 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/working_dir_d2f81153-bc6f-4a7e-b4ec-08d5ab5cd3dc/bin-2019/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 -> b649b8f673a0a47da0b16e77db6ba5e693ee3ba7 [2018-11-23 12:27:04,440 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:27:04,449 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:27:04,452 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:27:04,453 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:27:04,454 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:27:04,454 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d2f81153-bc6f-4a7e-b4ec-08d5ab5cd3dc/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1252a_true-unreach-call.c [2018-11-23 12:27:04,495 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d2f81153-bc6f-4a7e-b4ec-08d5ab5cd3dc/bin-2019/uautomizer/data/c66d2b468/977b3f4ee1994c7188de82d32fe70342/FLAG2b81a2a07 [2018-11-23 12:27:04,809 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:27:04,809 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d2f81153-bc6f-4a7e-b4ec-08d5ab5cd3dc/sv-benchmarks/c/float-newlib/double_req_bl_1252a_true-unreach-call.c [2018-11-23 12:27:04,814 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d2f81153-bc6f-4a7e-b4ec-08d5ab5cd3dc/bin-2019/uautomizer/data/c66d2b468/977b3f4ee1994c7188de82d32fe70342/FLAG2b81a2a07 [2018-11-23 12:27:04,824 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d2f81153-bc6f-4a7e-b4ec-08d5ab5cd3dc/bin-2019/uautomizer/data/c66d2b468/977b3f4ee1994c7188de82d32fe70342 [2018-11-23 12:27:04,826 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:27:04,827 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:27:04,828 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:27:04,828 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:27:04,831 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:27:04,832 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:27:04" (1/1) ... [2018-11-23 12:27:04,834 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29d0518e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:04, skipping insertion in model container [2018-11-23 12:27:04,834 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:27:04" (1/1) ... [2018-11-23 12:27:04,842 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:27:04,860 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:27:04,997 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:27:05,002 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:27:05,023 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:27:05,041 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:27:05,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:05 WrapperNode [2018-11-23 12:27:05,042 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:27:05,042 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:27:05,043 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:27:05,043 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:27:05,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:05" (1/1) ... [2018-11-23 12:27:05,056 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:05" (1/1) ... [2018-11-23 12:27:05,061 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:27:05,061 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:27:05,061 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:27:05,061 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:27:05,067 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:05" (1/1) ... [2018-11-23 12:27:05,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:05" (1/1) ... [2018-11-23 12:27:05,069 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:05" (1/1) ... [2018-11-23 12:27:05,069 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:05" (1/1) ... [2018-11-23 12:27:05,076 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:05" (1/1) ... [2018-11-23 12:27:05,119 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:05" (1/1) ... [2018-11-23 12:27:05,124 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:05" (1/1) ... [2018-11-23 12:27:05,126 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:27:05,126 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:27:05,126 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:27:05,126 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:27:05,127 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d2f81153-bc6f-4a7e-b4ec-08d5ab5cd3dc/bin-2019/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 [2018-11-23 12:27:05,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-23 12:27:05,159 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2018-11-23 12:27:05,159 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2018-11-23 12:27:05,159 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:27:05,159 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:27:05,159 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2018-11-23 12:27:05,159 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2018-11-23 12:27:05,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:27:05,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:27:05,159 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_double [2018-11-23 12:27:05,160 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_double [2018-11-23 12:27:05,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:27:05,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 12:27:05,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:27:05,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:27:05,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:27:05,273 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 12:27:05,349 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 12:27:05,378 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:27:05,378 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 12:27:05,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:27:05 BoogieIcfgContainer [2018-11-23 12:27:05,379 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:27:05,379 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:27:05,379 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:27:05,382 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:27:05,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:27:04" (1/3) ... [2018-11-23 12:27:05,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bb91d6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:27:05, skipping insertion in model container [2018-11-23 12:27:05,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:05" (2/3) ... [2018-11-23 12:27:05,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bb91d6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:27:05, skipping insertion in model container [2018-11-23 12:27:05,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:27:05" (3/3) ... [2018-11-23 12:27:05,385 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1252a_true-unreach-call.c [2018-11-23 12:27:05,391 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:27:05,397 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:27:05,408 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:27:05,426 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:27:05,426 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:27:05,427 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:27:05,427 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:27:05,427 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:27:05,427 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:27:05,427 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:27:05,427 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:27:05,427 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:27:05,439 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-23 12:27:05,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 12:27:05,444 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:05,445 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:27:05,446 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:05,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:05,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1896135752, now seen corresponding path program 1 times [2018-11-23 12:27:05,451 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 12:27:05,452 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d2f81153-bc6f-4a7e-b4ec-08d5ab5cd3dc/bin-2019/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 [2018-11-23 12:27:05,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:05,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:05,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:05,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:27:05,525 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 12:27:05,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:27:05,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:27:05,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:27:05,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:27:05,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:27:05,547 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 2 states. [2018-11-23 12:27:05,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:05,566 INFO L93 Difference]: Finished difference Result 75 states and 103 transitions. [2018-11-23 12:27:05,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:27:05,567 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-23 12:27:05,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:05,573 INFO L225 Difference]: With dead ends: 75 [2018-11-23 12:27:05,573 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 12:27:05,575 INFO L631 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 [2018-11-23 12:27:05,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 12:27:05,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-23 12:27:05,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:27:05,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2018-11-23 12:27:05,603 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 21 [2018-11-23 12:27:05,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:05,603 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2018-11-23 12:27:05,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:27:05,604 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2018-11-23 12:27:05,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:27:05,605 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:05,605 INFO L402 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] [2018-11-23 12:27:05,605 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:05,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:05,606 INFO L82 PathProgramCache]: Analyzing trace with hash -944725945, now seen corresponding path program 1 times [2018-11-23 12:27:05,606 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 12:27:05,606 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d2f81153-bc6f-4a7e-b4ec-08d5ab5cd3dc/bin-2019/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 [2018-11-23 12:27:05,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:05,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:05,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:05,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:27:05,691 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 12:27:05,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:27:05,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:27:05,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:27:05,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:27:05,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:27:05,700 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 4 states. [2018-11-23 12:27:05,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:05,748 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-11-23 12:27:05,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:27:05,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-23 12:27:05,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:05,750 INFO L225 Difference]: With dead ends: 56 [2018-11-23 12:27:05,750 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 12:27:05,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:27:05,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 12:27:05,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-23 12:27:05,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:27:05,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2018-11-23 12:27:05,758 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 22 [2018-11-23 12:27:05,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:05,759 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2018-11-23 12:27:05,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:27:05,759 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2018-11-23 12:27:05,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:27:05,760 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:05,760 INFO L402 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] [2018-11-23 12:27:05,760 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:05,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:05,760 INFO L82 PathProgramCache]: Analyzing trace with hash -190309307, now seen corresponding path program 1 times [2018-11-23 12:27:05,760 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 12:27:05,760 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d2f81153-bc6f-4a7e-b4ec-08d5ab5cd3dc/bin-2019/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 [2018-11-23 12:27:05,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:05,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:05,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:05,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:27:05,819 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 12:27:05,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:27:05,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:27:05,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:27:05,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:27:05,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:27:05,827 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand 4 states. [2018-11-23 12:27:05,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:05,865 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2018-11-23 12:27:05,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:27:05,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-23 12:27:05,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:05,867 INFO L225 Difference]: With dead ends: 59 [2018-11-23 12:27:05,867 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 12:27:05,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:27:05,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 12:27:05,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-11-23 12:27:05,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:27:05,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2018-11-23 12:27:05,873 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 23 [2018-11-23 12:27:05,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:05,874 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2018-11-23 12:27:05,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:27:05,874 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2018-11-23 12:27:05,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:27:05,874 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:05,875 INFO L402 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] [2018-11-23 12:27:05,875 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:05,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:05,875 INFO L82 PathProgramCache]: Analyzing trace with hash 935715971, now seen corresponding path program 1 times [2018-11-23 12:27:05,875 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 12:27:05,876 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d2f81153-bc6f-4a7e-b4ec-08d5ab5cd3dc/bin-2019/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 [2018-11-23 12:27:05,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:05,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:05,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:05,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:27:05,948 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 12:27:05,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:27:05,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:27:05,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:27:05,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:27:05,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:27:05,958 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand 4 states. [2018-11-23 12:27:05,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:05,988 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2018-11-23 12:27:05,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:27:05,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-11-23 12:27:05,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:05,989 INFO L225 Difference]: With dead ends: 59 [2018-11-23 12:27:05,989 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 12:27:05,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:27:05,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 12:27:05,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-11-23 12:27:05,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:27:05,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2018-11-23 12:27:05,995 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 24 [2018-11-23 12:27:05,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:05,995 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2018-11-23 12:27:05,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:27:05,996 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2018-11-23 12:27:05,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:27:05,996 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:05,996 INFO L402 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] [2018-11-23 12:27:05,997 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:05,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:05,997 INFO L82 PathProgramCache]: Analyzing trace with hash 696707201, now seen corresponding path program 1 times [2018-11-23 12:27:05,997 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 12:27:05,997 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d2f81153-bc6f-4a7e-b4ec-08d5ab5cd3dc/bin-2019/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 [2018-11-23 12:27:06,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:06,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:06,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:06,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:27:06,047 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 12:27:06,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:27:06,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:27:06,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:27:06,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:27:06,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:27:06,055 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand 4 states. [2018-11-23 12:27:06,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:06,084 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2018-11-23 12:27:06,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:27:06,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-23 12:27:06,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:06,085 INFO L225 Difference]: With dead ends: 59 [2018-11-23 12:27:06,085 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 12:27:06,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:27:06,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 12:27:06,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-11-23 12:27:06,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:27:06,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2018-11-23 12:27:06,089 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 25 [2018-11-23 12:27:06,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:06,089 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2018-11-23 12:27:06,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:27:06,089 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2018-11-23 12:27:06,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:27:06,090 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:06,090 INFO L402 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] [2018-11-23 12:27:06,090 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:06,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:06,090 INFO L82 PathProgramCache]: Analyzing trace with hash 500193696, now seen corresponding path program 1 times [2018-11-23 12:27:06,091 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 12:27:06,091 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d2f81153-bc6f-4a7e-b4ec-08d5ab5cd3dc/bin-2019/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 [2018-11-23 12:27:06,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:06,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:06,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:06,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:27:06,185 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 12:27:06,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:27:06,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 12:27:06,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:27:06,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:27:06,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:27:06,194 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand 7 states. [2018-11-23 12:27:06,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:06,444 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2018-11-23 12:27:06,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:27:06,444 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-23 12:27:06,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:06,445 INFO L225 Difference]: With dead ends: 48 [2018-11-23 12:27:06,446 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 12:27:06,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:27:06,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 12:27:06,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-23 12:27:06,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 12:27:06,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2018-11-23 12:27:06,450 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 25 [2018-11-23 12:27:06,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:06,451 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2018-11-23 12:27:06,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:27:06,451 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2018-11-23 12:27:06,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 12:27:06,452 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:06,452 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:27:06,452 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:06,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:06,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1230715632, now seen corresponding path program 1 times [2018-11-23 12:27:06,452 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 12:27:06,453 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d2f81153-bc6f-4a7e-b4ec-08d5ab5cd3dc/bin-2019/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 [2018-11-23 12:27:06,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:06,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:06,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:06,543 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 12:27:06,543 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 12:27:06,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:27:06,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:27:06,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:27:06,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:27:06,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:27:06,555 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand 4 states. [2018-11-23 12:27:06,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:06,602 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2018-11-23 12:27:06,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:27:06,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-11-23 12:27:06,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:06,603 INFO L225 Difference]: With dead ends: 63 [2018-11-23 12:27:06,603 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 12:27:06,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:27:06,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 12:27:06,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-23 12:27:06,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:27:06,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2018-11-23 12:27:06,609 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 30 [2018-11-23 12:27:06,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:06,610 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2018-11-23 12:27:06,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:27:06,610 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2018-11-23 12:27:06,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:27:06,611 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:06,611 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:27:06,611 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:06,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:06,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1937025982, now seen corresponding path program 1 times [2018-11-23 12:27:06,611 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 12:27:06,612 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d2f81153-bc6f-4a7e-b4ec-08d5ab5cd3dc/bin-2019/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 [2018-11-23 12:27:06,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:06,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:06,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:06,687 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 12:27:06,687 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 12:27:06,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:27:06,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:27:06,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:27:06,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:27:06,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:27:06,695 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand 4 states. [2018-11-23 12:27:06,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:06,708 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2018-11-23 12:27:06,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:27:06,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-11-23 12:27:06,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:06,709 INFO L225 Difference]: With dead ends: 66 [2018-11-23 12:27:06,709 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 12:27:06,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:27:06,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 12:27:06,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2018-11-23 12:27:06,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:27:06,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2018-11-23 12:27:06,715 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 31 [2018-11-23 12:27:06,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:06,715 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2018-11-23 12:27:06,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:27:06,715 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2018-11-23 12:27:06,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:27:06,716 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:06,716 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:27:06,716 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:06,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:06,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1151102924, now seen corresponding path program 1 times [2018-11-23 12:27:06,717 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 12:27:06,717 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d2f81153-bc6f-4a7e-b4ec-08d5ab5cd3dc/bin-2019/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 [2018-11-23 12:27:06,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:06,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:06,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:06,790 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 12:27:06,790 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 12:27:06,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:27:06,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:27:06,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:27:06,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:27:06,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:27:06,798 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand 4 states. [2018-11-23 12:27:06,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:06,813 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2018-11-23 12:27:06,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:27:06,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-11-23 12:27:06,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:06,815 INFO L225 Difference]: With dead ends: 66 [2018-11-23 12:27:06,815 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 12:27:06,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:27:06,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 12:27:06,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2018-11-23 12:27:06,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:27:06,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2018-11-23 12:27:06,820 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 32 [2018-11-23 12:27:06,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:06,820 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2018-11-23 12:27:06,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:27:06,821 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2018-11-23 12:27:06,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:27:06,822 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:06,822 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:27:06,822 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:06,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:06,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1413761077, now seen corresponding path program 1 times [2018-11-23 12:27:06,823 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 12:27:06,823 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d2f81153-bc6f-4a7e-b4ec-08d5ab5cd3dc/bin-2019/uautomizer/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-11-23 12:27:06,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:06,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:06,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:06,957 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:27:06,957 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 12:27:06,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:27:06,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:27:06,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:27:06,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:27:06,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:27:06,965 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand 5 states. [2018-11-23 12:27:07,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:07,465 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2018-11-23 12:27:07,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:27:07,466 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-11-23 12:27:07,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:07,466 INFO L225 Difference]: With dead ends: 64 [2018-11-23 12:27:07,466 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 12:27:07,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:27:07,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 12:27:07,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-23 12:27:07,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:27:07,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2018-11-23 12:27:07,470 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 32 [2018-11-23 12:27:07,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:07,470 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2018-11-23 12:27:07,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:27:07,471 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2018-11-23 12:27:07,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:27:07,471 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:07,471 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:27:07,473 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:07,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:07,473 INFO L82 PathProgramCache]: Analyzing trace with hash 604414451, now seen corresponding path program 1 times [2018-11-23 12:27:07,473 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 12:27:07,473 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d2f81153-bc6f-4a7e-b4ec-08d5ab5cd3dc/bin-2019/uautomizer/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2018-11-23 12:27:07,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:07,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:07,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:07,593 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:27:07,593 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 12:27:07,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:27:07,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 12:27:07,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:27:07,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:27:07,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:27:07,601 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand 8 states. [2018-11-23 12:27:07,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:07,916 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2018-11-23 12:27:07,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:27:07,917 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-11-23 12:27:07,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:07,918 INFO L225 Difference]: With dead ends: 55 [2018-11-23 12:27:07,918 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 12:27:07,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:27:07,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 12:27:07,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2018-11-23 12:27:07,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:27:07,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2018-11-23 12:27:07,922 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 32 [2018-11-23 12:27:07,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:07,922 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2018-11-23 12:27:07,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:27:07,922 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2018-11-23 12:27:07,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 12:27:07,923 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:07,923 INFO L402 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] [2018-11-23 12:27:07,923 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:07,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:07,924 INFO L82 PathProgramCache]: Analyzing trace with hash 717344413, now seen corresponding path program 1 times [2018-11-23 12:27:07,924 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 12:27:07,924 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d2f81153-bc6f-4a7e-b4ec-08d5ab5cd3dc/bin-2019/uautomizer/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2018-11-23 12:27:07,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:08,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:08,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:08,055 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:27:08,055 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:27:08,058 INFO L478 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 43 [2018-11-23 12:27:08,089 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:27:08,093 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2018-11-23 12:27:08,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:27:08,104 INFO L478 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 24 treesize of output 18 [2018-11-23 12:27:08,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 4 [2018-11-23 12:27:08,109 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 12:27:08,111 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:27:08,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:27:08,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 12:27:08,120 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:14 [2018-11-23 12:27:08,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:27:08,239 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 12:27:08,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:27:08,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 12:27:08,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:27:08,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:27:08,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:27:08,252 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand 8 states. [2018-11-23 12:27:08,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:08,922 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2018-11-23 12:27:08,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:27:08,923 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-11-23 12:27:08,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:08,923 INFO L225 Difference]: With dead ends: 75 [2018-11-23 12:27:08,923 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 12:27:08,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:27:08,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 12:27:08,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-11-23 12:27:08,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:27:08,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-11-23 12:27:08,928 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 33 [2018-11-23 12:27:08,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:08,928 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-11-23 12:27:08,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:27:08,928 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-11-23 12:27:08,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 12:27:08,929 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:08,929 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2018-11-23 12:27:08,929 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:08,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:08,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1607764478, now seen corresponding path program 1 times [2018-11-23 12:27:08,929 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 12:27:08,930 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d2f81153-bc6f-4a7e-b4ec-08d5ab5cd3dc/bin-2019/uautomizer/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2018-11-23 12:27:08,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:08,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:08,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:08,991 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 12:27:08,991 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 12:27:08,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:27:08,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:27:08,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:27:08,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:27:09,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:27:09,000 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 4 states. [2018-11-23 12:27:09,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:09,019 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2018-11-23 12:27:09,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:27:09,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-11-23 12:27:09,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:09,020 INFO L225 Difference]: With dead ends: 65 [2018-11-23 12:27:09,020 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 12:27:09,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:27:09,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 12:27:09,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2018-11-23 12:27:09,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:27:09,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-11-23 12:27:09,023 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 33 [2018-11-23 12:27:09,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:09,023 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-11-23 12:27:09,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:27:09,024 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-11-23 12:27:09,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 12:27:09,024 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:09,024 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2018-11-23 12:27:09,024 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:09,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:09,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1411250973, now seen corresponding path program 1 times [2018-11-23 12:27:09,025 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 12:27:09,025 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d2f81153-bc6f-4a7e-b4ec-08d5ab5cd3dc/bin-2019/uautomizer/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2018-11-23 12:27:09,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:09,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:09,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:09,132 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:27:09,132 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 12:27:09,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:27:09,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 12:27:09,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:27:09,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:27:09,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:27:09,140 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 7 states. [2018-11-23 12:27:09,436 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2018-11-23 12:27:09,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:09,461 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-11-23 12:27:09,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:27:09,462 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-11-23 12:27:09,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:09,462 INFO L225 Difference]: With dead ends: 50 [2018-11-23 12:27:09,462 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 12:27:09,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:27:09,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 12:27:09,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2018-11-23 12:27:09,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:27:09,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-11-23 12:27:09,465 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 33 [2018-11-23 12:27:09,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:09,465 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-11-23 12:27:09,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:27:09,465 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-23 12:27:09,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 12:27:09,466 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:09,466 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:27:09,466 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:09,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:09,466 INFO L82 PathProgramCache]: Analyzing trace with hash -329247760, now seen corresponding path program 1 times [2018-11-23 12:27:09,467 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 12:27:09,467 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d2f81153-bc6f-4a7e-b4ec-08d5ab5cd3dc/bin-2019/uautomizer/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2018-11-23 12:27:09,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:09,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:09,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:09,672 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:27:09,673 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:27:09,674 INFO L478 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 43 [2018-11-23 12:27:09,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2018-11-23 12:27:09,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:27:09,709 INFO L478 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 24 treesize of output 18 [2018-11-23 12:27:09,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 4 [2018-11-23 12:27:09,714 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 12:27:09,716 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:27:09,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:27:09,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 12:27:09,723 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:14 [2018-11-23 12:27:09,857 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:27:09,857 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 12:27:09,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:27:09,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-23 12:27:09,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:27:09,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:27:09,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:27:09,866 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 13 states. [2018-11-23 12:27:10,739 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-23 12:27:10,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:10,868 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-11-23 12:27:10,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:27:10,869 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-11-23 12:27:10,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:10,869 INFO L225 Difference]: With dead ends: 52 [2018-11-23 12:27:10,869 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 12:27:10,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:27:10,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 12:27:10,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-23 12:27:10,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:27:10,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-11-23 12:27:10,873 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 40 [2018-11-23 12:27:10,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:10,874 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-11-23 12:27:10,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:27:10,874 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-11-23 12:27:10,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 12:27:10,874 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:10,874 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2018-11-23 12:27:10,874 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:10,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:10,874 INFO L82 PathProgramCache]: Analyzing trace with hash 860398362, now seen corresponding path program 1 times [2018-11-23 12:27:10,874 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 12:27:10,875 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d2f81153-bc6f-4a7e-b4ec-08d5ab5cd3dc/bin-2019/uautomizer/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2018-11-23 12:27:10,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:11,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:11,044 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:27:11,045 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:27:11,046 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:27:11,046 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:27:11,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 85 [2018-11-23 12:27:11,312 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2018-11-23 12:27:11,313 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: nested self-update not yet implemented: (store v_arrayElimCell_5 (_ bv0 32) ((_ extract 31 0) |v_q#valueAsBitvector_5|)) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacementForStoreCase(DerPreprocessor.java:248) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacement(DerPreprocessor.java:219) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacement(DerPreprocessor.java:210) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.convert(DerPreprocessor.java:142) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:253) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:211) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) 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:286) 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.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java: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) [2018-11-23 12:27:11,315 INFO L168 Benchmark]: Toolchain (without parser) took 6488.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 203.4 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -120.9 MB). Peak memory consumption was 82.5 MB. Max. memory is 11.5 GB. [2018-11-23 12:27:11,315 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:27:11,316 INFO L168 Benchmark]: CACSL2BoogieTranslator took 214.00 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 934.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 12:27:11,316 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.31 ms. Allocated memory is still 1.0 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:27:11,316 INFO L168 Benchmark]: Boogie Preprocessor took 65.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 934.7 MB in the beginning and 1.1 GB in the end (delta: -197.5 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2018-11-23 12:27:11,317 INFO L168 Benchmark]: RCFGBuilder took 252.35 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: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2018-11-23 12:27:11,317 INFO L168 Benchmark]: TraceAbstraction took 5935.35 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 35.4 MB). Peak memory consumption was 101.0 MB. Max. memory is 11.5 GB. [2018-11-23 12:27:11,319 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 214.00 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 934.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.31 ms. Allocated memory is still 1.0 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 65.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 934.7 MB in the beginning and 1.1 GB in the end (delta: -197.5 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 252.35 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: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5935.35 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 35.4 MB). Peak memory consumption was 101.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: nested self-update not yet implemented: (store v_arrayElimCell_5 (_ bv0 32) ((_ extract 31 0) |v_q#valueAsBitvector_5|)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: nested self-update not yet implemented: (store v_arrayElimCell_5 (_ bv0 32) ((_ extract 31 0) |v_q#valueAsBitvector_5|)): de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacementForStoreCase(DerPreprocessor.java:248) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...