/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/Ultimate.py --spec ../../../trunk/examples/svcomp/ReachSafety.prp --file ../../../trunk/examples/svcomp/float-newlib/double_req_bl_0480_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 40ef5092 Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-newlib/double_req_bl_0480_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 d52986c59e68ce8d16e7f783a8a5ec11939c887c ................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-newlib/double_req_bl_0480_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 d52986c59e68ce8d16e7f783a8a5ec11939c887c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-40ef509 [2018-09-20 14:31:55,063 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-20 14:31:55,065 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-20 14:31:55,083 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-20 14:31:55,083 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-20 14:31:55,084 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-20 14:31:55,096 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-20 14:31:55,099 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-20 14:31:55,101 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-20 14:31:55,103 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-20 14:31:55,104 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-20 14:31:55,105 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-20 14:31:55,106 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-20 14:31:55,107 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-20 14:31:55,111 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-20 14:31:55,112 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-20 14:31:55,112 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-20 14:31:55,123 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-20 14:31:55,125 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-20 14:31:55,129 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-20 14:31:55,130 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-20 14:31:55,132 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-20 14:31:55,134 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-20 14:31:55,138 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-20 14:31:55,138 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-20 14:31:55,139 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-20 14:31:55,140 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-20 14:31:55,140 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-20 14:31:55,141 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-20 14:31:55,142 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-20 14:31:55,143 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-20 14:31:55,145 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-20 14:31:55,146 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-20 14:31:55,146 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-20 14:31:55,147 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-20 14:31:55,148 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-20 14:31:55,148 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-20 14:31:55,177 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-20 14:31:55,178 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-20 14:31:55,178 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-20 14:31:55,179 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-20 14:31:55,179 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-20 14:31:55,182 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-20 14:31:55,183 INFO L133 SettingsManager]: * Use SBE=true [2018-09-20 14:31:55,183 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-20 14:31:55,183 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-20 14:31:55,183 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-20 14:31:55,184 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-20 14:31:55,184 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-20 14:31:55,184 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-20 14:31:55,184 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-20 14:31:55,184 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-20 14:31:55,184 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-20 14:31:55,185 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-20 14:31:55,185 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-20 14:31:55,185 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-20 14:31:55,185 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-20 14:31:55,185 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-20 14:31:55,187 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-20 14:31:55,187 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 14:31:55,187 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-20 14:31:55,187 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-20 14:31:55,187 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-20 14:31:55,188 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-20 14:31:55,188 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-20 14:31:55,188 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-20 14:31:55,188 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> d52986c59e68ce8d16e7f783a8a5ec11939c887c [2018-09-20 14:31:55,263 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-20 14:31:55,281 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-20 14:31:55,285 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-20 14:31:55,287 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-20 14:31:55,287 INFO L276 PluginConnector]: CDTParser initialized [2018-09-20 14:31:55,288 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_0480_true-unreach-call.c [2018-09-20 14:31:55,629 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d32145a4/47feef26a9394efca3dd21d3af03dd3f/FLAG285d4bbe8 [2018-09-20 14:31:55,865 INFO L277 CDTParser]: Found 1 translation units. [2018-09-20 14:31:55,866 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_0480_true-unreach-call.c [2018-09-20 14:31:55,880 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d32145a4/47feef26a9394efca3dd21d3af03dd3f/FLAG285d4bbe8 [2018-09-20 14:31:55,904 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d32145a4/47feef26a9394efca3dd21d3af03dd3f [2018-09-20 14:31:55,910 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-20 14:31:55,913 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-20 14:31:55,914 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-20 14:31:55,915 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-20 14:31:55,922 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-20 14:31:55,923 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 02:31:55" (1/1) ... [2018-09-20 14:31:55,926 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ac5afb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:31:55, skipping insertion in model container [2018-09-20 14:31:55,926 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 02:31:55" (1/1) ... [2018-09-20 14:31:55,938 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-20 14:31:56,266 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 14:31:56,292 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-20 14:31:56,381 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 14:31:56,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:31:56 WrapperNode [2018-09-20 14:31:56,437 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-20 14:31:56,438 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-20 14:31:56,438 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-20 14:31:56,439 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-20 14:31:56,455 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:31:56" (1/1) ... [2018-09-20 14:31:56,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:31:56" (1/1) ... [2018-09-20 14:31:56,477 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:31:56" (1/1) ... [2018-09-20 14:31:56,480 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:31:56" (1/1) ... [2018-09-20 14:31:56,514 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:31:56" (1/1) ... [2018-09-20 14:31:56,533 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:31:56" (1/1) ... [2018-09-20 14:31:56,544 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:31:56" (1/1) ... [2018-09-20 14:31:56,549 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-20 14:31:56,550 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-20 14:31:56,550 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-20 14:31:56,550 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-20 14:31:56,551 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:31:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-20 14:31:56,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-20 14:31:56,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-20 14:31:56,721 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2018-09-20 14:31:56,721 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_sqrt [2018-09-20 14:31:56,721 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_acos [2018-09-20 14:31:56,721 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-20 14:31:56,722 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-20 14:31:56,722 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2018-09-20 14:31:56,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-20 14:31:56,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-09-20 14:31:56,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-09-20 14:31:56,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-20 14:31:56,723 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_sqrt [2018-09-20 14:31:56,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-09-20 14:31:56,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-09-20 14:31:56,724 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_acos [2018-09-20 14:31:56,724 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-20 14:31:56,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-20 14:31:56,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-20 14:31:56,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2018-09-20 14:31:56,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-09-20 14:31:57,949 INFO L365 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-20 14:31:57,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 02:31:57 BoogieIcfgContainer [2018-09-20 14:31:57,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-20 14:31:57,955 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-20 14:31:57,955 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-20 14:31:57,959 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-20 14:31:57,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 02:31:55" (1/3) ... [2018-09-20 14:31:57,960 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31f364c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 02:31:57, skipping insertion in model container [2018-09-20 14:31:57,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:31:56" (2/3) ... [2018-09-20 14:31:57,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31f364c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 02:31:57, skipping insertion in model container [2018-09-20 14:31:57,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 02:31:57" (3/3) ... [2018-09-20 14:31:57,963 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0480_true-unreach-call.c [2018-09-20 14:31:57,975 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-20 14:31:57,988 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-20 14:31:58,036 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-20 14:31:58,037 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-20 14:31:58,037 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-20 14:31:58,037 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-20 14:31:58,037 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-20 14:31:58,037 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-20 14:31:58,038 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-20 14:31:58,038 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-20 14:31:58,038 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-20 14:31:58,063 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states. [2018-09-20 14:31:58,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-20 14:31:58,071 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:31:58,072 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 14:31:58,076 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:31:58,081 INFO L82 PathProgramCache]: Analyzing trace with hash 193770739, now seen corresponding path program 1 times [2018-09-20 14:31:58,084 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 14:31:58,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 14:31:58,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 14:31:58,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 14:31:58,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 14:31:58,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 14:31:58,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 14:31:58,252 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 14:31:58,253 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-20 14:31:58,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-20 14:31:58,273 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-20 14:31:58,275 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 14:31:58,278 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 2 states. [2018-09-20 14:31:58,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:31:58,338 INFO L93 Difference]: Finished difference Result 286 states and 377 transitions. [2018-09-20 14:31:58,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-20 14:31:58,340 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-09-20 14:31:58,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:31:58,354 INFO L225 Difference]: With dead ends: 286 [2018-09-20 14:31:58,354 INFO L226 Difference]: Without dead ends: 143 [2018-09-20 14:31:58,361 INFO L606 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-09-20 14:31:58,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-09-20 14:31:58,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-09-20 14:31:58,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-09-20 14:31:58,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 170 transitions. [2018-09-20 14:31:58,418 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 170 transitions. Word has length 19 [2018-09-20 14:31:58,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:31:58,418 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 170 transitions. [2018-09-20 14:31:58,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-20 14:31:58,419 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 170 transitions. [2018-09-20 14:31:58,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-20 14:31:58,421 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:31:58,421 INFO L376 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] [2018-09-20 14:31:58,421 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:31:58,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1652984249, now seen corresponding path program 1 times [2018-09-20 14:31:58,422 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 14:31:58,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 14:31:58,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 14:31:58,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 14:31:58,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 14:31:58,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-20 14:31:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-20 14:31:58,553 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-20 14:31:58,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 02:31:58 BoogieIcfgContainer [2018-09-20 14:31:58,624 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-20 14:31:58,625 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-09-20 14:31:58,625 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-09-20 14:31:58,625 INFO L276 PluginConnector]: Witness Printer initialized [2018-09-20 14:31:58,626 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 02:31:57" (3/4) ... [2018-09-20 14:31:58,632 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-09-20 14:31:58,632 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-09-20 14:31:58,633 INFO L168 Benchmark]: Toolchain (without parser) took 2722.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 949.2 MB in the beginning and 1.0 GB in the end (delta: -85.7 MB). Peak memory consumption was 36.9 MB. Max. memory is 11.5 GB. [2018-09-20 14:31:58,636 INFO L168 Benchmark]: CDTParser took 0.20 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-09-20 14:31:58,638 INFO L168 Benchmark]: CACSL2BoogieTranslator took 523.35 ms. Allocated memory is still 1.0 GB. Free memory was 949.2 MB in the beginning and 933.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-09-20 14:31:58,638 INFO L168 Benchmark]: Boogie Preprocessor took 111.23 ms. Allocated memory is still 1.0 GB. Free memory was 933.1 MB in the beginning and 927.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-09-20 14:31:58,641 INFO L168 Benchmark]: RCFGBuilder took 1400.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 927.7 MB in the beginning and 1.1 GB in the end (delta: -134.9 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2018-09-20 14:31:58,643 INFO L168 Benchmark]: TraceAbstraction took 669.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 11.5 GB. [2018-09-20 14:31:58,644 INFO L168 Benchmark]: Witness Printer took 7.01 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 14:31:58,650 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.20 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 523.35 ms. Allocated memory is still 1.0 GB. Free memory was 949.2 MB in the beginning and 933.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 111.23 ms. Allocated memory is still 1.0 GB. Free memory was 933.1 MB in the beginning and 927.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1400.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 927.7 MB in the beginning and 1.1 GB in the end (delta: -134.9 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 669.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 11.5 GB. * Witness Printer took 7.01 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 237]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someUnaryDOUBLEoperation at line 145, overapproximation of bitwiseAnd at line 163, overapproximation of someBinaryArithmeticDOUBLEoperation at line 181, overapproximation of someBinaryDOUBLEComparisonOperation at line 236. Possible FailurePath: [L28] static const double one_sqrt = 1.0, tiny_sqrt = 1.0e-300; [L140-L153] static const double one_acos = 1.00000000000000000000e+00, pi = 3.14159265358979311600e+00, pio2_hi_acos = 1.57079632679489655800e+00, pio2_lo_acos = 6.12323399573676603587e-17, pS0_acos = 1.66666666666666657415e-01, pS1_acos = -3.25565818622400915405e-01, pS2_acos = 2.01212532134862925881e-01, pS3_acos = -4.00555345006794114027e-02, pS4_acos = 7.91534994289814532176e-04, pS5_acos = 3.47933107596021167570e-05, qS1_acos = -2.40339491173441421878e+00, qS2_acos = 2.02094576023350569471e+00, qS3_acos = -6.88283971605453293030e-01, qS4_acos = 7.70381505559019352791e-02; VAL [\old(one_acos)=6442450961, \old(one_sqrt)=6442450952, \old(pi)=6442450951, \old(pi)=6442450964, \old(pi)=6442450954, \old(pS0_acos)=6442450945, \old(pS1_acos)=6442450962, \old(pS2_acos)=6442450963, \old(pS3_acos)=6442450948, \old(pS4_acos)=6442450953, \old(pS5_acos)=6442450965, \old(qS1_acos)=6442450947, \old(qS2_acos)=6442450955, \old(qS3_acos)=6442450958, \old(qS4_acos)=6442450949, \old(tiny_sqrt)=6442450959, one_acos=1, one_sqrt=1, pi=612323399573676603587/10000000000000000000000000000000000000, pi=785398163397448279/500000000000000000, pi=785398163397448279/250000000000000000, pS0_acos=33333333333333331483/200000000000000000000, pS2_acos=201212532134862925881/1000000000000000000000, pS4_acos=49470937143113408261/62500000000000000000000, pS5_acos=34793310759602116757/1000000000000000000000000, qS2_acos=202094576023350569471/100000000000000000000, qS4_acos=770381505559019352791/10000000000000000000000, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L232] double x = 1.0; VAL [one_acos=1, one_sqrt=1, pi=785398163397448279/500000000000000000, pi=785398163397448279/250000000000000000, pi=612323399573676603587/10000000000000000000000000000000000000, pS0_acos=33333333333333331483/200000000000000000000, pS2_acos=201212532134862925881/1000000000000000000000, pS4_acos=49470937143113408261/62500000000000000000000, pS5_acos=34793310759602116757/1000000000000000000000000, qS2_acos=202094576023350569471/100000000000000000000, qS4_acos=770381505559019352791/10000000000000000000000, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1] [L233] CALL, EXPR __ieee754_acos(x) VAL [\old(x)=1, one_acos=1, one_sqrt=1, pi=785398163397448279/500000000000000000, pi=785398163397448279/250000000000000000, pi=612323399573676603587/10000000000000000000000000000000000000, pS0_acos=33333333333333331483/200000000000000000000, pS2_acos=201212532134862925881/1000000000000000000000, pS4_acos=49470937143113408261/62500000000000000000000, pS5_acos=34793310759602116757/1000000000000000000000000, qS2_acos=202094576023350569471/100000000000000000000, qS4_acos=770381505559019352791/10000000000000000000000, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L156] double z, p, q, r, w, s, c, df; [L157] __int32_t hx, ix; VAL [\old(x)=1, one_acos=1, one_sqrt=1, pi=612323399573676603587/10000000000000000000000000000000000000, pi=785398163397448279/500000000000000000, pi=785398163397448279/250000000000000000, pS0_acos=33333333333333331483/200000000000000000000, pS2_acos=201212532134862925881/1000000000000000000000, pS4_acos=49470937143113408261/62500000000000000000000, pS5_acos=34793310759602116757/1000000000000000000000000, qS2_acos=202094576023350569471/100000000000000000000, qS4_acos=770381505559019352791/10000000000000000000000, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1] [L159] FCALL ieee_double_shape_type gh_u; VAL [\old(x)=1, gh_u={6442450956:0}, one_acos=1, one_sqrt=1, pi=785398163397448279/250000000000000000, pi=785398163397448279/500000000000000000, pi=612323399573676603587/10000000000000000000000000000000000000, pS0_acos=33333333333333331483/200000000000000000000, pS2_acos=201212532134862925881/1000000000000000000000, pS4_acos=49470937143113408261/62500000000000000000000, pS5_acos=34793310759602116757/1000000000000000000000000, qS2_acos=202094576023350569471/100000000000000000000, qS4_acos=770381505559019352791/10000000000000000000000, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1] [L160] FCALL gh_u.value = (x) VAL [\old(x)=1, gh_u={6442450956:0}, one_acos=1, one_sqrt=1, pi=785398163397448279/500000000000000000, pi=612323399573676603587/10000000000000000000000000000000000000, pi=785398163397448279/250000000000000000, pS0_acos=33333333333333331483/200000000000000000000, pS2_acos=201212532134862925881/1000000000000000000000, pS4_acos=49470937143113408261/62500000000000000000000, pS5_acos=34793310759602116757/1000000000000000000000000, qS2_acos=202094576023350569471/100000000000000000000, qS4_acos=770381505559019352791/10000000000000000000000, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1] [L161] EXPR, FCALL gh_u.parts.msw VAL [\old(x)=1, gh_u={6442450956:0}, gh_u.parts.msw=6442450944, one_acos=1, one_sqrt=1, pi=612323399573676603587/10000000000000000000000000000000000000, pi=785398163397448279/500000000000000000, pi=785398163397448279/250000000000000000, pS0_acos=33333333333333331483/200000000000000000000, pS2_acos=201212532134862925881/1000000000000000000000, pS4_acos=49470937143113408261/62500000000000000000000, pS5_acos=34793310759602116757/1000000000000000000000000, qS2_acos=202094576023350569471/100000000000000000000, qS4_acos=770381505559019352791/10000000000000000000000, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1] [L161] (hx) = gh_u.parts.msw VAL [\old(x)=1, gh_u={6442450956:0}, gh_u.parts.msw=6442450944, hx=-2147483648, one_acos=1, one_sqrt=1, pi=785398163397448279/500000000000000000, pi=612323399573676603587/10000000000000000000000000000000000000, pi=785398163397448279/250000000000000000, pS0_acos=33333333333333331483/200000000000000000000, pS2_acos=201212532134862925881/1000000000000000000000, pS4_acos=49470937143113408261/62500000000000000000000, pS5_acos=34793310759602116757/1000000000000000000000000, qS2_acos=202094576023350569471/100000000000000000000, qS4_acos=770381505559019352791/10000000000000000000000, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1] [L161] FCALL (hx) = gh_u.parts.msw VAL [(hx) = gh_u.parts.msw=6442450960, \old(x)=1, gh_u={6442450956:0}, gh_u.parts.msw=6442450944, hx=-2147483648, one_acos=1, one_sqrt=1, pi=612323399573676603587/10000000000000000000000000000000000000, pi=785398163397448279/250000000000000000, pi=785398163397448279/500000000000000000, pS0_acos=33333333333333331483/200000000000000000000, pS2_acos=201212532134862925881/1000000000000000000000, pS4_acos=49470937143113408261/62500000000000000000000, pS5_acos=34793310759602116757/1000000000000000000000000, qS2_acos=202094576023350569471/100000000000000000000, qS4_acos=770381505559019352791/10000000000000000000000, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1] [L162] COND FALSE !(0) VAL [\old(x)=1, hx=-2147483648, one_acos=1, one_sqrt=1, pi=612323399573676603587/10000000000000000000000000000000000000, pi=785398163397448279/250000000000000000, pi=785398163397448279/500000000000000000, pS0_acos=33333333333333331483/200000000000000000000, pS2_acos=201212532134862925881/1000000000000000000000, pS4_acos=49470937143113408261/62500000000000000000000, pS5_acos=34793310759602116757/1000000000000000000000000, qS2_acos=202094576023350569471/100000000000000000000, qS4_acos=770381505559019352791/10000000000000000000000, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1] [L163] ix = hx & 0x7fffffff VAL [\old(x)=1, hx=-2147483648, one_acos=1, one_sqrt=1, pi=612323399573676603587/10000000000000000000000000000000000000, pi=785398163397448279/250000000000000000, pi=785398163397448279/500000000000000000, pS0_acos=33333333333333331483/200000000000000000000, pS2_acos=201212532134862925881/1000000000000000000000, pS4_acos=49470937143113408261/62500000000000000000000, pS5_acos=34793310759602116757/1000000000000000000000000, qS2_acos=202094576023350569471/100000000000000000000, qS4_acos=770381505559019352791/10000000000000000000000, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1] [L164] COND FALSE !(ix >= 0x3ff00000) VAL [\old(x)=1, hx=-2147483648, ix=0, one_acos=1, one_sqrt=1, pi=612323399573676603587/10000000000000000000000000000000000000, pi=785398163397448279/500000000000000000, pi=785398163397448279/250000000000000000, pS0_acos=33333333333333331483/200000000000000000000, pS2_acos=201212532134862925881/1000000000000000000000, pS4_acos=49470937143113408261/62500000000000000000000, pS5_acos=34793310759602116757/1000000000000000000000000, qS2_acos=202094576023350569471/100000000000000000000, qS4_acos=770381505559019352791/10000000000000000000000, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1] [L179] COND TRUE ix < 0x3fe00000 VAL [\old(x)=1, hx=-2147483648, ix=0, one_acos=1, one_sqrt=1, pi=785398163397448279/250000000000000000, pi=785398163397448279/500000000000000000, pi=612323399573676603587/10000000000000000000000000000000000000, pS0_acos=33333333333333331483/200000000000000000000, pS2_acos=201212532134862925881/1000000000000000000000, pS4_acos=49470937143113408261/62500000000000000000000, pS5_acos=34793310759602116757/1000000000000000000000000, qS2_acos=202094576023350569471/100000000000000000000, qS4_acos=770381505559019352791/10000000000000000000000, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1] [L180] COND TRUE ix <= 0x3c600000 [L181] RET return pio2_hi_acos + pio2_lo_acos; VAL [\old(x)=1, hx=-2147483648, ix=0, one_acos=1, one_sqrt=1, pi=785398163397448279/250000000000000000, pi=612323399573676603587/10000000000000000000000000000000000000, pi=785398163397448279/500000000000000000, pS0_acos=33333333333333331483/200000000000000000000, pS2_acos=201212532134862925881/1000000000000000000000, pS4_acos=49470937143113408261/62500000000000000000000, pS5_acos=34793310759602116757/1000000000000000000000000, qS2_acos=202094576023350569471/100000000000000000000, qS4_acos=770381505559019352791/10000000000000000000000, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1] [L233] EXPR __ieee754_acos(x) VAL [__ieee754_acos(x)=6442450950, one_acos=1, one_sqrt=1, pi=785398163397448279/250000000000000000, pi=612323399573676603587/10000000000000000000000000000000000000, pi=785398163397448279/500000000000000000, pS0_acos=33333333333333331483/200000000000000000000, pS2_acos=201212532134862925881/1000000000000000000000, pS4_acos=49470937143113408261/62500000000000000000000, pS5_acos=34793310759602116757/1000000000000000000000000, qS2_acos=202094576023350569471/100000000000000000000, qS4_acos=770381505559019352791/10000000000000000000000, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1] [L233] double res = __ieee754_acos(x); [L236] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [one_acos=1, one_sqrt=1, pi=785398163397448279/250000000000000000, pi=785398163397448279/500000000000000000, pi=612323399573676603587/10000000000000000000000000000000000000, pS0_acos=33333333333333331483/200000000000000000000, pS2_acos=201212532134862925881/1000000000000000000000, pS4_acos=49470937143113408261/62500000000000000000000, pS5_acos=34793310759602116757/1000000000000000000000000, qS2_acos=202094576023350569471/100000000000000000000, qS4_acos=770381505559019352791/10000000000000000000000, res=6442450950, res == 0.0 && __signbit_double(res) == 0=0, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1] [L236] COND FALSE, EXPR !(res == 0.0 && __signbit_double(res) == 0) VAL [one_acos=1, one_sqrt=1, pi=612323399573676603587/10000000000000000000000000000000000000, pi=785398163397448279/250000000000000000, pi=785398163397448279/500000000000000000, pS0_acos=33333333333333331483/200000000000000000000, pS2_acos=201212532134862925881/1000000000000000000000, pS4_acos=49470937143113408261/62500000000000000000000, pS5_acos=34793310759602116757/1000000000000000000000000, qS2_acos=202094576023350569471/100000000000000000000, qS4_acos=770381505559019352791/10000000000000000000000, res=6442450950, res == 0.0 && __signbit_double(res) == 0=0, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1] [L236] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L237] __VERIFIER_error() VAL [one_acos=1, one_sqrt=1, pi=785398163397448279/250000000000000000, pi=785398163397448279/500000000000000000, pi=612323399573676603587/10000000000000000000000000000000000000, pS0_acos=33333333333333331483/200000000000000000000, pS2_acos=201212532134862925881/1000000000000000000000, pS4_acos=49470937143113408261/62500000000000000000000, pS5_acos=34793310759602116757/1000000000000000000000000, qS2_acos=202094576023350569471/100000000000000000000, qS4_acos=770381505559019352791/10000000000000000000000, res=6442450950, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 147 locations, 1 error locations. UNSAFE Result, 0.5s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 174 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=147occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 47 NumberOfCodeBlocks, 47 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 324 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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-40ef509 [2018-09-20 14:32:01,091 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-20 14:32:01,093 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-20 14:32:01,105 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-20 14:32:01,106 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-20 14:32:01,107 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-20 14:32:01,108 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-20 14:32:01,110 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-20 14:32:01,112 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-20 14:32:01,113 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-20 14:32:01,113 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-20 14:32:01,114 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-20 14:32:01,116 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-20 14:32:01,117 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-20 14:32:01,118 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-20 14:32:01,121 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-20 14:32:01,122 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-20 14:32:01,125 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-20 14:32:01,131 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-20 14:32:01,135 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-20 14:32:01,136 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-20 14:32:01,140 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-20 14:32:01,146 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-20 14:32:01,146 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-20 14:32:01,146 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-20 14:32:01,147 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-20 14:32:01,148 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-20 14:32:01,149 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-20 14:32:01,150 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-20 14:32:01,151 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-20 14:32:01,151 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-20 14:32:01,152 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-20 14:32:01,152 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-20 14:32:01,152 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-20 14:32:01,153 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-20 14:32:01,154 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-20 14:32:01,154 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-09-20 14:32:01,179 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-20 14:32:01,179 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-20 14:32:01,181 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-20 14:32:01,181 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-20 14:32:01,182 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-20 14:32:01,182 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-20 14:32:01,182 INFO L133 SettingsManager]: * Use SBE=true [2018-09-20 14:32:01,184 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-20 14:32:01,184 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-20 14:32:01,184 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-20 14:32:01,185 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-20 14:32:01,185 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-20 14:32:01,185 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-20 14:32:01,185 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-20 14:32:01,186 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-20 14:32:01,186 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-20 14:32:01,186 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-20 14:32:01,187 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-20 14:32:01,187 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-20 14:32:01,187 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-20 14:32:01,187 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-20 14:32:01,189 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-20 14:32:01,189 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-20 14:32:01,190 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 14:32:01,190 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-20 14:32:01,190 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-20 14:32:01,192 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-20 14:32:01,192 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-20 14:32:01,192 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-20 14:32:01,193 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-20 14:32:01,193 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-20 14:32:01,193 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> d52986c59e68ce8d16e7f783a8a5ec11939c887c [2018-09-20 14:32:01,274 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-20 14:32:01,291 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-20 14:32:01,298 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-20 14:32:01,299 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-20 14:32:01,300 INFO L276 PluginConnector]: CDTParser initialized [2018-09-20 14:32:01,301 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_0480_true-unreach-call.c [2018-09-20 14:32:01,648 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df64047fe/638e6e80e99b4b60a9872cddbd3fb23f/FLAGe9e2b044e [2018-09-20 14:32:01,807 INFO L277 CDTParser]: Found 1 translation units. [2018-09-20 14:32:01,808 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_0480_true-unreach-call.c [2018-09-20 14:32:01,818 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df64047fe/638e6e80e99b4b60a9872cddbd3fb23f/FLAGe9e2b044e [2018-09-20 14:32:01,834 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df64047fe/638e6e80e99b4b60a9872cddbd3fb23f [2018-09-20 14:32:01,840 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-20 14:32:01,843 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-20 14:32:01,845 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-20 14:32:01,845 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-20 14:32:01,851 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-20 14:32:01,852 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 02:32:01" (1/1) ... [2018-09-20 14:32:01,855 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53a0a11e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:32:01, skipping insertion in model container [2018-09-20 14:32:01,855 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 02:32:01" (1/1) ... [2018-09-20 14:32:01,865 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-20 14:32:02,235 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 14:32:02,256 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-20 14:32:02,325 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 14:32:02,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:32:02 WrapperNode [2018-09-20 14:32:02,397 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-20 14:32:02,400 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-20 14:32:02,401 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-20 14:32:02,401 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-20 14:32:02,416 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:32:02" (1/1) ... [2018-09-20 14:32:02,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:32:02" (1/1) ... [2018-09-20 14:32:02,435 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:32:02" (1/1) ... [2018-09-20 14:32:02,435 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:32:02" (1/1) ... [2018-09-20 14:32:02,453 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:32:02" (1/1) ... [2018-09-20 14:32:02,463 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:32:02" (1/1) ... [2018-09-20 14:32:02,468 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:32:02" (1/1) ... [2018-09-20 14:32:02,474 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-20 14:32:02,474 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-20 14:32:02,475 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-20 14:32:02,475 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-20 14:32:02,476 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:32:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-20 14:32:02,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-20 14:32:02,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-20 14:32:02,673 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2018-09-20 14:32:02,673 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_sqrt [2018-09-20 14:32:02,674 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_acos [2018-09-20 14:32:02,674 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-20 14:32:02,674 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-20 14:32:02,674 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2018-09-20 14:32:02,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-20 14:32:02,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-09-20 14:32:02,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-09-20 14:32:02,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-20 14:32:02,675 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_sqrt [2018-09-20 14:32:02,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-09-20 14:32:02,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-09-20 14:32:02,679 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_acos [2018-09-20 14:32:02,679 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-20 14:32:02,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-20 14:32:02,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-20 14:32:02,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-09-20 14:32:02,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8 [2018-09-20 14:32:03,046 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:32:03,072 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:32:03,138 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:32:03,161 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:32:14,511 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:32:17,490 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:32:17,532 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:32:17,670 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:32:17,707 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:32:17,731 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:32:21,316 INFO L365 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-20 14:32:21,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 02:32:21 BoogieIcfgContainer [2018-09-20 14:32:21,317 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-20 14:32:21,318 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-20 14:32:21,318 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-20 14:32:21,322 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-20 14:32:21,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 02:32:01" (1/3) ... [2018-09-20 14:32:21,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@557a9d08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 02:32:21, skipping insertion in model container [2018-09-20 14:32:21,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:32:02" (2/3) ... [2018-09-20 14:32:21,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@557a9d08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 02:32:21, skipping insertion in model container [2018-09-20 14:32:21,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 02:32:21" (3/3) ... [2018-09-20 14:32:21,328 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0480_true-unreach-call.c [2018-09-20 14:32:21,338 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-20 14:32:21,347 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-20 14:32:21,400 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-20 14:32:21,401 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-20 14:32:21,401 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-20 14:32:21,401 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-20 14:32:21,402 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-20 14:32:21,402 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-20 14:32:21,402 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-20 14:32:21,402 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-20 14:32:21,402 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-20 14:32:21,431 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states. [2018-09-20 14:32:21,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-20 14:32:21,445 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:32:21,446 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 14:32:21,449 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:32:21,455 INFO L82 PathProgramCache]: Analyzing trace with hash 193770739, now seen corresponding path program 1 times [2018-09-20 14:32:21,460 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 14:32:21,461 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-20 14:32:21,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 14:32:21,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 14:32:21,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 14:32:21,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 14:32:21,722 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 14:32:21,741 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 14:32:21,741 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-20 14:32:21,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-20 14:32:21,762 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-20 14:32:21,763 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 14:32:21,765 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 2 states. [2018-09-20 14:32:21,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:32:21,820 INFO L93 Difference]: Finished difference Result 286 states and 377 transitions. [2018-09-20 14:32:21,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-20 14:32:21,823 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-09-20 14:32:21,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:32:21,838 INFO L225 Difference]: With dead ends: 286 [2018-09-20 14:32:21,839 INFO L226 Difference]: Without dead ends: 143 [2018-09-20 14:32:21,846 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 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-09-20 14:32:21,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-09-20 14:32:21,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-09-20 14:32:21,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-09-20 14:32:21,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 170 transitions. [2018-09-20 14:32:21,916 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 170 transitions. Word has length 19 [2018-09-20 14:32:21,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:32:21,916 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 170 transitions. [2018-09-20 14:32:21,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-20 14:32:21,917 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 170 transitions. [2018-09-20 14:32:21,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-20 14:32:21,918 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:32:21,919 INFO L376 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] [2018-09-20 14:32:21,919 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:32:21,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1652984249, now seen corresponding path program 1 times [2018-09-20 14:32:21,920 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 14:32:21,921 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-20 14:32:21,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 14:32:22,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 14:32:22,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 14:32:22,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 14 treesize of output 11 [2018-09-20 14:32:22,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-20 14:32:22,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:32:22,261 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:32:22,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 14:32:22,283 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 14:32:22,409 INFO L477 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 20 treesize of output 16 [2018-09-20 14:32:22,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-20 14:32:22,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:32:22,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:32:22,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 14:32:22,531 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 14:32:22,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 14:32:22,993 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 14:32:23,012 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 14:32:23,013 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-20 14:32:23,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-20 14:32:23,016 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-20 14:32:23,016 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-20 14:32:23,016 INFO L87 Difference]: Start difference. First operand 143 states and 170 transitions. Second operand 9 states. [2018-09-20 14:32:23,501 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-09-20 14:32:24,271 WARN L178 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-09-20 14:32:24,886 WARN L178 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-09-20 14:32:39,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:32:39,872 INFO L93 Difference]: Finished difference Result 168 states and 195 transitions. [2018-09-20 14:32:39,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-20 14:32:39,875 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-09-20 14:32:39,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:32:39,880 INFO L225 Difference]: With dead ends: 168 [2018-09-20 14:32:39,880 INFO L226 Difference]: Without dead ends: 130 [2018-09-20 14:32:39,882 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-09-20 14:32:39,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-09-20 14:32:39,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2018-09-20 14:32:39,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-09-20 14:32:39,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 152 transitions. [2018-09-20 14:32:39,898 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 152 transitions. Word has length 28 [2018-09-20 14:32:39,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:32:39,899 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 152 transitions. [2018-09-20 14:32:39,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-20 14:32:39,899 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 152 transitions. [2018-09-20 14:32:39,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-20 14:32:39,901 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:32:39,902 INFO L376 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] [2018-09-20 14:32:39,902 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:32:39,902 INFO L82 PathProgramCache]: Analyzing trace with hash -765480568, now seen corresponding path program 1 times [2018-09-20 14:32:39,903 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 14:32:39,903 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-20 14:32:39,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 14:32:44,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 14:32:44,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 14:32:44,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 14 treesize of output 11 [2018-09-20 14:32:44,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-20 14:32:44,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:32:44,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:32:44,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 14:32:44,909 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 14:32:44,966 INFO L477 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 20 treesize of output 16 [2018-09-20 14:32:44,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-20 14:32:44,972 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:32:44,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:32:44,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 14:32:44,993 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 14:32:45,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 14:32:45,245 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 14:32:45,335 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 14:32:45,335 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-20 14:32:45,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-20 14:32:45,336 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-20 14:32:45,336 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-20 14:32:45,337 INFO L87 Difference]: Start difference. First operand 128 states and 152 transitions. Second operand 9 states. [2018-09-20 14:32:46,253 WARN L178 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-09-20 14:32:46,447 WARN L178 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-09-20 14:33:00,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:33:00,408 INFO L93 Difference]: Finished difference Result 153 states and 177 transitions. [2018-09-20 14:33:00,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-20 14:33:00,409 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-09-20 14:33:00,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:33:00,411 INFO L225 Difference]: With dead ends: 153 [2018-09-20 14:33:00,411 INFO L226 Difference]: Without dead ends: 129 [2018-09-20 14:33:00,412 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-09-20 14:33:00,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-09-20 14:33:00,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2018-09-20 14:33:00,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-09-20 14:33:00,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 150 transitions. [2018-09-20 14:33:00,427 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 150 transitions. Word has length 28 [2018-09-20 14:33:00,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:33:00,427 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 150 transitions. [2018-09-20 14:33:00,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-20 14:33:00,428 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 150 transitions. [2018-09-20 14:33:00,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-09-20 14:33:00,429 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:33:00,429 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 14:33:00,430 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:33:00,431 INFO L82 PathProgramCache]: Analyzing trace with hash -198046818, now seen corresponding path program 1 times [2018-09-20 14:33:00,431 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 14:33:00,431 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-20 14:33:00,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 14:33:01,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 14:33:01,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 14:33:01,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 14 treesize of output 11 [2018-09-20 14:33:01,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-20 14:33:01,387 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:33:01,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:33:01,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 14:33:01,584 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-09-20 14:33:01,641 INFO L477 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 20 treesize of output 16 [2018-09-20 14:33:01,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-20 14:33:01,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:33:01,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:33:01,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 14:33:01,748 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:17 [2018-09-20 14:33:02,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 12 treesize of output 9 [2018-09-20 14:33:02,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-09-20 14:33:02,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:33:02,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:33:02,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-20 14:33:02,063 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2018-09-20 14:33:02,157 INFO L477 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 16 treesize of output 12 [2018-09-20 14:33:02,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-09-20 14:33:02,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:33:02,190 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:33:02,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-20 14:33:02,217 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:29 [2018-09-20 14:33:02,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 14:33:02,680 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 14:33:02,701 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 14:33:02,701 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-20 14:33:02,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-20 14:33:02,702 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-20 14:33:02,703 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-09-20 14:33:02,703 INFO L87 Difference]: Start difference. First operand 127 states and 150 transitions. Second operand 12 states. [2018-09-20 14:33:03,784 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-09-20 14:33:08,687 WARN L178 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-09-20 14:33:09,271 WARN L178 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2018-09-20 14:33:09,658 WARN L178 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2018-09-20 14:33:10,090 WARN L178 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2018-09-20 14:33:10,504 WARN L178 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-20 14:33:14,334 WARN L178 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2018-09-20 14:33:16,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:33:16,071 INFO L93 Difference]: Finished difference Result 152 states and 175 transitions. [2018-09-20 14:33:16,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-20 14:33:16,072 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2018-09-20 14:33:16,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:33:16,075 INFO L225 Difference]: With dead ends: 152 [2018-09-20 14:33:16,075 INFO L226 Difference]: Without dead ends: 129 [2018-09-20 14:33:16,076 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2018-09-20 14:33:16,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-09-20 14:33:16,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2018-09-20 14:33:16,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-09-20 14:33:16,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 149 transitions. [2018-09-20 14:33:16,089 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 149 transitions. Word has length 37 [2018-09-20 14:33:16,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:33:16,090 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 149 transitions. [2018-09-20 14:33:16,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-20 14:33:16,090 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 149 transitions. [2018-09-20 14:33:16,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-20 14:33:16,092 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:33:16,093 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 14:33:16,093 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:33:16,093 INFO L82 PathProgramCache]: Analyzing trace with hash -975028367, now seen corresponding path program 1 times [2018-09-20 14:33:16,093 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 14:33:16,094 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-20 14:33:16,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 14:33:16,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 14:33:16,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 14:33:16,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 14:33:16,278 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 14:33:16,290 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 14:33:16,290 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-20 14:33:16,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-20 14:33:16,290 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-20 14:33:16,291 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-20 14:33:16,291 INFO L87 Difference]: Start difference. First operand 127 states and 149 transitions. Second operand 5 states. [2018-09-20 14:33:20,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:33:20,855 INFO L93 Difference]: Finished difference Result 134 states and 156 transitions. [2018-09-20 14:33:20,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-20 14:33:20,860 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-09-20 14:33:20,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:33:20,861 INFO L225 Difference]: With dead ends: 134 [2018-09-20 14:33:20,861 INFO L226 Difference]: Without dead ends: 131 [2018-09-20 14:33:20,862 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-20 14:33:20,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-09-20 14:33:20,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-09-20 14:33:20,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-09-20 14:33:20,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 153 transitions. [2018-09-20 14:33:20,886 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 153 transitions. Word has length 38 [2018-09-20 14:33:20,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:33:20,886 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 153 transitions. [2018-09-20 14:33:20,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-20 14:33:20,886 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 153 transitions. [2018-09-20 14:33:20,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-20 14:33:20,888 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:33:20,888 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 14:33:20,888 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:33:20,891 INFO L82 PathProgramCache]: Analyzing trace with hash -87524686, now seen corresponding path program 1 times [2018-09-20 14:33:20,892 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 14:33:20,892 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-20 14:33:20,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 14:33:21,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 14:33:21,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 14:33:21,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 14 treesize of output 11 [2018-09-20 14:33:21,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-20 14:33:21,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:33:21,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:33:21,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 14:33:21,254 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 14:33:21,319 INFO L477 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 20 treesize of output 16 [2018-09-20 14:33:21,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-20 14:33:21,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:33:21,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:33:21,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 14:33:21,339 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 14:33:21,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 14:33:21,498 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 14:33:21,518 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 14:33:21,518 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-20 14:33:21,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-20 14:33:21,519 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-20 14:33:21,519 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-20 14:33:21,519 INFO L87 Difference]: Start difference. First operand 131 states and 153 transitions. Second operand 8 states. [2018-09-20 14:33:26,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:33:26,940 INFO L93 Difference]: Finished difference Result 154 states and 176 transitions. [2018-09-20 14:33:26,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-20 14:33:26,943 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-09-20 14:33:26,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:33:26,944 INFO L225 Difference]: With dead ends: 154 [2018-09-20 14:33:26,945 INFO L226 Difference]: Without dead ends: 131 [2018-09-20 14:33:26,946 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-09-20 14:33:26,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-09-20 14:33:26,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-09-20 14:33:26,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-09-20 14:33:26,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 152 transitions. [2018-09-20 14:33:26,957 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 152 transitions. Word has length 38 [2018-09-20 14:33:26,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:33:26,957 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 152 transitions. [2018-09-20 14:33:26,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-20 14:33:26,957 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 152 transitions. [2018-09-20 14:33:26,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-20 14:33:26,960 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:33:26,961 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 14:33:26,961 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:33:26,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1195286252, now seen corresponding path program 1 times [2018-09-20 14:33:26,961 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 14:33:26,962 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-20 14:33:26,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 14:33:31,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 14:33:32,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 14:33:32,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 14 treesize of output 11 [2018-09-20 14:33:32,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-20 14:33:32,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:33:32,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:33:32,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 14:33:32,487 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 14:33:32,600 INFO L477 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 20 treesize of output 16 [2018-09-20 14:33:32,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-20 14:33:32,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:33:32,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:33:32,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 14:33:32,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 14:33:33,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 14:33:33,259 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 14:33:33,345 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 14:33:33,345 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-20 14:33:33,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-20 14:33:33,346 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-20 14:33:33,346 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-20 14:33:33,347 INFO L87 Difference]: Start difference. First operand 131 states and 152 transitions. Second operand 9 states. [2018-09-20 14:33:38,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:33:38,631 INFO L93 Difference]: Finished difference Result 150 states and 170 transitions. [2018-09-20 14:33:38,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-20 14:33:38,632 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2018-09-20 14:33:38,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:33:38,633 INFO L225 Difference]: With dead ends: 150 [2018-09-20 14:33:38,633 INFO L226 Difference]: Without dead ends: 55 [2018-09-20 14:33:38,634 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-09-20 14:33:38,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-20 14:33:38,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-09-20 14:33:38,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-09-20 14:33:38,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 54 transitions. [2018-09-20 14:33:38,642 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 54 transitions. Word has length 48 [2018-09-20 14:33:38,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:33:38,642 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 54 transitions. [2018-09-20 14:33:38,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-20 14:33:38,642 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 54 transitions. [2018-09-20 14:33:38,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-20 14:33:38,645 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:33:38,645 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 14:33:38,646 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:33:38,646 INFO L82 PathProgramCache]: Analyzing trace with hash -545217938, now seen corresponding path program 1 times [2018-09-20 14:33:38,646 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 14:33:38,648 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-20 14:33:38,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 14:33:38,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 14:33:38,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 14:33:38,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 14 treesize of output 11 [2018-09-20 14:33:38,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-20 14:33:38,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:33:38,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:33:38,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 14:33:38,934 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 14:33:39,004 INFO L477 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 20 treesize of output 16 [2018-09-20 14:33:39,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-20 14:33:39,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:33:39,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:33:39,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 14:33:39,025 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 14:33:39,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 14:33:39,296 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 14:33:39,308 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 14:33:39,308 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-20 14:33:39,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-20 14:33:39,309 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-20 14:33:39,309 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-09-20 14:33:39,309 INFO L87 Difference]: Start difference. First operand 55 states and 54 transitions. Second operand 12 states. [2018-09-20 14:33:40,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:33:40,458 INFO L93 Difference]: Finished difference Result 55 states and 54 transitions. [2018-09-20 14:33:40,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-20 14:33:40,459 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2018-09-20 14:33:40,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:33:40,461 INFO L225 Difference]: With dead ends: 55 [2018-09-20 14:33:40,461 INFO L226 Difference]: Without dead ends: 0 [2018-09-20 14:33:40,462 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2018-09-20 14:33:40,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-20 14:33:40,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-20 14:33:40,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-20 14:33:40,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-20 14:33:40,464 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2018-09-20 14:33:40,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:33:40,464 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-20 14:33:40,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-20 14:33:40,464 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-20 14:33:40,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-20 14:33:40,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-20 14:33:40,947 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-09-20 14:33:41,116 WARN L178 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 28 [2018-09-20 14:33:41,221 INFO L429 ceAbstractionStarter]: At program point __ieee754_sqrtENTRY(lines 30 138) the Hoare annotation is: true [2018-09-20 14:33:41,221 INFO L426 ceAbstractionStarter]: For program point L93-1(lines 93 109) no Hoare annotation was computed. [2018-09-20 14:33:41,221 INFO L429 ceAbstractionStarter]: At program point L93-3(lines 93 109) the Hoare annotation is: true [2018-09-20 14:33:41,221 INFO L426 ceAbstractionStarter]: For program point L93-4(lines 30 138) no Hoare annotation was computed. [2018-09-20 14:33:41,221 INFO L426 ceAbstractionStarter]: For program point __ieee754_sqrtFINAL(lines 30 138) no Hoare annotation was computed. [2018-09-20 14:33:41,221 INFO L426 ceAbstractionStarter]: For program point L118(lines 118 123) no Hoare annotation was computed. [2018-09-20 14:33:41,221 INFO L426 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2018-09-20 14:33:41,221 INFO L426 ceAbstractionStarter]: For program point L135-1(line 135) no Hoare annotation was computed. [2018-09-20 14:33:41,221 INFO L426 ceAbstractionStarter]: For program point L69(lines 69 72) no Hoare annotation was computed. [2018-09-20 14:33:41,222 INFO L426 ceAbstractionStarter]: For program point L135-2(line 135) no Hoare annotation was computed. [2018-09-20 14:33:41,222 INFO L426 ceAbstractionStarter]: For program point L135-3(line 135) no Hoare annotation was computed. [2018-09-20 14:33:41,222 INFO L426 ceAbstractionStarter]: For program point L36-1(lines 36 41) no Hoare annotation was computed. [2018-09-20 14:33:41,222 INFO L426 ceAbstractionStarter]: For program point L69-2(lines 69 72) no Hoare annotation was computed. [2018-09-20 14:33:41,222 INFO L429 ceAbstractionStarter]: At program point L36-3(lines 36 41) the Hoare annotation is: true [2018-09-20 14:33:41,222 INFO L426 ceAbstractionStarter]: For program point L36-4(lines 30 138) no Hoare annotation was computed. [2018-09-20 14:33:41,222 INFO L426 ceAbstractionStarter]: For program point L61-1(lines 61 62) no Hoare annotation was computed. [2018-09-20 14:33:41,222 INFO L426 ceAbstractionStarter]: For program point L61-3(lines 61 62) no Hoare annotation was computed. [2018-09-20 14:33:41,222 INFO L429 ceAbstractionStarter]: At program point L61-4(lines 61 62) the Hoare annotation is: true [2018-09-20 14:33:41,222 INFO L426 ceAbstractionStarter]: For program point L61-5(lines 61 62) no Hoare annotation was computed. [2018-09-20 14:33:41,222 INFO L426 ceAbstractionStarter]: For program point L119(lines 119 120) no Hoare annotation was computed. [2018-09-20 14:33:41,223 INFO L426 ceAbstractionStarter]: For program point L119-2(lines 119 120) no Hoare annotation was computed. [2018-09-20 14:33:41,223 INFO L426 ceAbstractionStarter]: For program point L111(lines 111 125) no Hoare annotation was computed. [2018-09-20 14:33:41,223 INFO L426 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-09-20 14:33:41,223 INFO L426 ceAbstractionStarter]: For program point L37-1(line 37) no Hoare annotation was computed. [2018-09-20 14:33:41,223 INFO L426 ceAbstractionStarter]: For program point L37-2(line 37) no Hoare annotation was computed. [2018-09-20 14:33:41,223 INFO L426 ceAbstractionStarter]: For program point L37-3(line 37) no Hoare annotation was computed. [2018-09-20 14:33:41,223 INFO L426 ceAbstractionStarter]: For program point L128(lines 128 129) no Hoare annotation was computed. [2018-09-20 14:33:41,223 INFO L426 ceAbstractionStarter]: For program point L128-2(lines 128 129) no Hoare annotation was computed. [2018-09-20 14:33:41,224 INFO L426 ceAbstractionStarter]: For program point L38(line 38) no Hoare annotation was computed. [2018-09-20 14:33:41,224 INFO L426 ceAbstractionStarter]: For program point L96(lines 96 105) no Hoare annotation was computed. [2018-09-20 14:33:41,224 INFO L426 ceAbstractionStarter]: For program point L96-2(lines 96 105) no Hoare annotation was computed. [2018-09-20 14:33:41,224 INFO L426 ceAbstractionStarter]: For program point L55(lines 55 66) no Hoare annotation was computed. [2018-09-20 14:33:41,224 INFO L426 ceAbstractionStarter]: For program point L55-2(lines 55 66) no Hoare annotation was computed. [2018-09-20 14:33:41,225 INFO L426 ceAbstractionStarter]: For program point L113(lines 113 124) no Hoare annotation was computed. [2018-09-20 14:33:41,225 INFO L426 ceAbstractionStarter]: For program point L47(lines 47 52) no Hoare annotation was computed. [2018-09-20 14:33:41,225 INFO L426 ceAbstractionStarter]: For program point L80-1(lines 80 90) no Hoare annotation was computed. [2018-09-20 14:33:41,225 INFO L426 ceAbstractionStarter]: For program point L47-2(lines 47 52) no Hoare annotation was computed. [2018-09-20 14:33:41,225 INFO L429 ceAbstractionStarter]: At program point L80-3(lines 80 90) the Hoare annotation is: true [2018-09-20 14:33:41,225 INFO L426 ceAbstractionStarter]: For program point L80-4(lines 80 90) no Hoare annotation was computed. [2018-09-20 14:33:41,225 INFO L426 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-09-20 14:33:41,225 INFO L426 ceAbstractionStarter]: For program point L39-1(line 39) no Hoare annotation was computed. [2018-09-20 14:33:41,225 INFO L426 ceAbstractionStarter]: For program point L39-2(line 39) no Hoare annotation was computed. [2018-09-20 14:33:41,225 INFO L426 ceAbstractionStarter]: For program point L56-1(lines 56 60) no Hoare annotation was computed. [2018-09-20 14:33:41,226 INFO L429 ceAbstractionStarter]: At program point L56-3(lines 56 60) the Hoare annotation is: true [2018-09-20 14:33:41,226 INFO L426 ceAbstractionStarter]: For program point L56-4(lines 56 60) no Hoare annotation was computed. [2018-09-20 14:33:41,226 INFO L426 ceAbstractionStarter]: For program point L48(lines 48 51) no Hoare annotation was computed. [2018-09-20 14:33:41,226 INFO L426 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-09-20 14:33:41,226 INFO L426 ceAbstractionStarter]: For program point L40-1(line 40) no Hoare annotation was computed. [2018-09-20 14:33:41,226 INFO L426 ceAbstractionStarter]: For program point L40-2(line 40) no Hoare annotation was computed. [2018-09-20 14:33:41,226 INFO L426 ceAbstractionStarter]: For program point L40-3(line 40) no Hoare annotation was computed. [2018-09-20 14:33:41,226 INFO L426 ceAbstractionStarter]: For program point L98(lines 98 99) no Hoare annotation was computed. [2018-09-20 14:33:41,226 INFO L426 ceAbstractionStarter]: For program point L131-1(lines 131 136) no Hoare annotation was computed. [2018-09-20 14:33:41,228 INFO L426 ceAbstractionStarter]: For program point L98-2(lines 98 99) no Hoare annotation was computed. [2018-09-20 14:33:41,228 INFO L429 ceAbstractionStarter]: At program point L131-3(lines 131 136) the Hoare annotation is: true [2018-09-20 14:33:41,228 INFO L426 ceAbstractionStarter]: For program point L131-4(lines 131 136) no Hoare annotation was computed. [2018-09-20 14:33:41,229 INFO L426 ceAbstractionStarter]: For program point __ieee754_sqrtEXIT(lines 30 138) no Hoare annotation was computed. [2018-09-20 14:33:41,229 INFO L426 ceAbstractionStarter]: For program point L115(lines 115 123) no Hoare annotation was computed. [2018-09-20 14:33:41,229 INFO L426 ceAbstractionStarter]: For program point L82(lines 82 86) no Hoare annotation was computed. [2018-09-20 14:33:41,229 INFO L426 ceAbstractionStarter]: For program point L82-2(lines 82 86) no Hoare annotation was computed. [2018-09-20 14:33:41,229 INFO L426 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2018-09-20 14:33:41,229 INFO L426 ceAbstractionStarter]: For program point L132-1(line 132) no Hoare annotation was computed. [2018-09-20 14:33:41,229 INFO L426 ceAbstractionStarter]: For program point L132-2(line 132) no Hoare annotation was computed. [2018-09-20 14:33:41,229 INFO L426 ceAbstractionStarter]: For program point L132-3(line 132) no Hoare annotation was computed. [2018-09-20 14:33:41,229 INFO L426 ceAbstractionStarter]: For program point L50(lines 50 51) no Hoare annotation was computed. [2018-09-20 14:33:41,229 INFO L426 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-09-20 14:33:41,229 INFO L426 ceAbstractionStarter]: For program point L134(line 134) no Hoare annotation was computed. [2018-09-20 14:33:41,230 INFO L426 ceAbstractionStarter]: For program point L101(lines 101 102) no Hoare annotation was computed. [2018-09-20 14:33:41,230 INFO L426 ceAbstractionStarter]: For program point L101-2(lines 101 102) no Hoare annotation was computed. [2018-09-20 14:33:41,230 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-20 14:33:41,230 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-09-20 14:33:41,230 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-20 14:33:41,230 INFO L426 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2018-09-20 14:33:41,230 INFO L426 ceAbstractionStarter]: For program point L159-1(line 159) no Hoare annotation was computed. [2018-09-20 14:33:41,230 INFO L426 ceAbstractionStarter]: For program point L159-2(line 159) no Hoare annotation was computed. [2018-09-20 14:33:41,230 INFO L426 ceAbstractionStarter]: For program point L159-3(line 159) no Hoare annotation was computed. [2018-09-20 14:33:41,230 INFO L426 ceAbstractionStarter]: For program point L180(lines 180 181) no Hoare annotation was computed. [2018-09-20 14:33:41,230 INFO L426 ceAbstractionStarter]: For program point __ieee754_acosEXIT(lines 155 224) no Hoare annotation was computed. [2018-09-20 14:33:41,230 INFO L426 ceAbstractionStarter]: For program point L209(line 209) no Hoare annotation was computed. [2018-09-20 14:33:41,231 INFO L422 ceAbstractionStarter]: At program point L205(line 205) the Hoare annotation is: (and (exists ((|v_q#valueAsBitvector_11| (_ BitVec 64))) (and (= |__ieee754_acos_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_11|) ((_ extract 62 52) |v_q#valueAsBitvector_11|) ((_ extract 51 0) |v_q#valueAsBitvector_11|))) (not (bvsge (bvand ((_ extract 63 32) |v_q#valueAsBitvector_11|) (_ bv2147483647 32)) (_ bv1072693248 32))))) (exists ((|v_q#valueAsBitvector_11| (_ BitVec 64))) (and (= (bvand ((_ extract 63 32) |v_q#valueAsBitvector_11|) (_ bv2147483647 32)) __ieee754_acos_~ix~0) (= |__ieee754_acos_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_11|) ((_ extract 62 52) |v_q#valueAsBitvector_11|) ((_ extract 51 0) |v_q#valueAsBitvector_11|))))) (exists ((|v_q#valueAsBitvector_11| (_ BitVec 64))) (and (= __ieee754_acos_~hx~0 ((_ extract 63 32) |v_q#valueAsBitvector_11|)) (= |__ieee754_acos_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_11|) ((_ extract 62 52) |v_q#valueAsBitvector_11|) ((_ extract 51 0) |v_q#valueAsBitvector_11|))))) (= |__ieee754_acos_#in~x| __ieee754_acos_~x)) [2018-09-20 14:33:41,231 INFO L426 ceAbstractionStarter]: For program point L172(lines 172 175) no Hoare annotation was computed. [2018-09-20 14:33:41,231 INFO L426 ceAbstractionStarter]: For program point L205-1(line 205) no Hoare annotation was computed. [2018-09-20 14:33:41,231 INFO L426 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2018-09-20 14:33:41,231 INFO L426 ceAbstractionStarter]: For program point L164(lines 164 178) no Hoare annotation was computed. [2018-09-20 14:33:41,231 INFO L426 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-09-20 14:33:41,231 INFO L429 ceAbstractionStarter]: At program point __ieee754_acosENTRY(lines 155 224) the Hoare annotation is: true [2018-09-20 14:33:41,232 INFO L426 ceAbstractionStarter]: For program point L210(line 210) no Hoare annotation was computed. [2018-09-20 14:33:41,232 INFO L426 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-09-20 14:33:41,233 INFO L426 ceAbstractionStarter]: For program point L169-1(line 169) no Hoare annotation was computed. [2018-09-20 14:33:41,233 INFO L426 ceAbstractionStarter]: For program point L169-2(line 169) no Hoare annotation was computed. [2018-09-20 14:33:41,233 INFO L426 ceAbstractionStarter]: For program point __ieee754_acosFINAL(lines 155 224) no Hoare annotation was computed. [2018-09-20 14:33:41,233 INFO L426 ceAbstractionStarter]: For program point L161(line 161) no Hoare annotation was computed. [2018-09-20 14:33:41,233 INFO L426 ceAbstractionStarter]: For program point L161-1(line 161) no Hoare annotation was computed. [2018-09-20 14:33:41,233 INFO L426 ceAbstractionStarter]: For program point L161-2(line 161) no Hoare annotation was computed. [2018-09-20 14:33:41,233 INFO L426 ceAbstractionStarter]: For program point L211(line 211) no Hoare annotation was computed. [2018-09-20 14:33:41,233 INFO L426 ceAbstractionStarter]: For program point L211-1(line 211) no Hoare annotation was computed. [2018-09-20 14:33:41,233 INFO L426 ceAbstractionStarter]: For program point L211-2(line 211) no Hoare annotation was computed. [2018-09-20 14:33:41,233 INFO L426 ceAbstractionStarter]: For program point L211-3(line 211) no Hoare annotation was computed. [2018-09-20 14:33:41,233 INFO L426 ceAbstractionStarter]: For program point L207-1(lines 207 212) no Hoare annotation was computed. [2018-09-20 14:33:41,234 INFO L422 ceAbstractionStarter]: At program point L207-3(lines 207 212) the Hoare annotation is: (and (exists ((|v_q#valueAsBitvector_11| (_ BitVec 64))) (and (= |__ieee754_acos_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_11|) ((_ extract 62 52) |v_q#valueAsBitvector_11|) ((_ extract 51 0) |v_q#valueAsBitvector_11|))) (not (bvsge (bvand ((_ extract 63 32) |v_q#valueAsBitvector_11|) (_ bv2147483647 32)) (_ bv1072693248 32))))) (exists ((|v_q#valueAsBitvector_11| (_ BitVec 64))) (and (= (bvand ((_ extract 63 32) |v_q#valueAsBitvector_11|) (_ bv2147483647 32)) __ieee754_acos_~ix~0) (= |__ieee754_acos_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_11|) ((_ extract 62 52) |v_q#valueAsBitvector_11|) ((_ extract 51 0) |v_q#valueAsBitvector_11|))))) (exists ((|v_q#valueAsBitvector_11| (_ BitVec 64))) (and (= __ieee754_acos_~hx~0 ((_ extract 63 32) |v_q#valueAsBitvector_11|)) (= |__ieee754_acos_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_11|) ((_ extract 62 52) |v_q#valueAsBitvector_11|) ((_ extract 51 0) |v_q#valueAsBitvector_11|))))) (= |__ieee754_acos_#in~x| __ieee754_acos_~x)) [2018-09-20 14:33:41,234 INFO L426 ceAbstractionStarter]: For program point L207-4(lines 207 212) no Hoare annotation was computed. [2018-09-20 14:33:41,234 INFO L422 ceAbstractionStarter]: At program point L199(line 199) the Hoare annotation is: (exists ((|v_q#valueAsBitvector_16| (_ BitVec 64))) (and (= |__ieee754_acos_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_16|) ((_ extract 62 52) |v_q#valueAsBitvector_16|) ((_ extract 51 0) |v_q#valueAsBitvector_16|))) (not (bvsge (bvand ((_ extract 63 32) |v_q#valueAsBitvector_16|) (_ bv2147483647 32)) (_ bv1072693248 32))))) [2018-09-20 14:33:41,234 INFO L426 ceAbstractionStarter]: For program point L199-1(line 199) no Hoare annotation was computed. [2018-09-20 14:33:41,234 INFO L426 ceAbstractionStarter]: For program point L166-1(lines 166 170) no Hoare annotation was computed. [2018-09-20 14:33:41,234 INFO L422 ceAbstractionStarter]: At program point L166-3(lines 166 170) the Hoare annotation is: (and (exists ((|v_q#valueAsBitvector_11| (_ BitVec 64))) (and (= (bvand ((_ extract 63 32) |v_q#valueAsBitvector_11|) (_ bv2147483647 32)) __ieee754_acos_~ix~0) (= |__ieee754_acos_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_11|) ((_ extract 62 52) |v_q#valueAsBitvector_11|) ((_ extract 51 0) |v_q#valueAsBitvector_11|))))) (= |__ieee754_acos_#in~x| __ieee754_acos_~x) (exists ((|v_q#valueAsBitvector_13| (_ BitVec 64))) (and (= ((_ extract 63 32) |v_q#valueAsBitvector_13|) __ieee754_acos_~hx~0) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_13|) ((_ extract 62 52) |v_q#valueAsBitvector_13|) ((_ extract 51 0) |v_q#valueAsBitvector_13|)) __ieee754_acos_~x)))) [2018-09-20 14:33:41,239 INFO L426 ceAbstractionStarter]: For program point L166-4(lines 164 178) no Hoare annotation was computed. [2018-09-20 14:33:41,239 INFO L426 ceAbstractionStarter]: For program point L191(lines 191 223) no Hoare annotation was computed. [2018-09-20 14:33:41,239 INFO L426 ceAbstractionStarter]: For program point L158-1(lines 158 162) no Hoare annotation was computed. [2018-09-20 14:33:41,239 INFO L422 ceAbstractionStarter]: At program point L158-3(lines 158 162) the Hoare annotation is: (= |__ieee754_acos_#in~x| __ieee754_acos_~x) [2018-09-20 14:33:41,239 INFO L426 ceAbstractionStarter]: For program point L158-4(lines 158 162) no Hoare annotation was computed. [2018-09-20 14:33:41,240 INFO L426 ceAbstractionStarter]: For program point L179(lines 179 223) no Hoare annotation was computed. [2018-09-20 14:33:41,240 INFO L426 ceAbstractionStarter]: For program point L208(line 208) no Hoare annotation was computed. [2018-09-20 14:33:41,240 INFO L426 ceAbstractionStarter]: For program point L208-1(line 208) no Hoare annotation was computed. [2018-09-20 14:33:41,240 INFO L426 ceAbstractionStarter]: For program point L208-2(line 208) no Hoare annotation was computed. [2018-09-20 14:33:41,240 INFO L426 ceAbstractionStarter]: For program point L208-3(line 208) no Hoare annotation was computed. [2018-09-20 14:33:41,240 INFO L426 ceAbstractionStarter]: For program point L167(line 167) no Hoare annotation was computed. [2018-09-20 14:33:41,240 INFO L426 ceAbstractionStarter]: For program point L167-1(line 167) no Hoare annotation was computed. [2018-09-20 14:33:41,240 INFO L426 ceAbstractionStarter]: For program point L167-2(line 167) no Hoare annotation was computed. [2018-09-20 14:33:41,240 INFO L426 ceAbstractionStarter]: For program point L167-3(line 167) no Hoare annotation was computed. [2018-09-20 14:33:41,240 INFO L426 ceAbstractionStarter]: For program point __signbit_doubleFINAL(lines 16 26) no Hoare annotation was computed. [2018-09-20 14:33:41,240 INFO L426 ceAbstractionStarter]: For program point __signbit_doubleEXIT(lines 16 26) no Hoare annotation was computed. [2018-09-20 14:33:41,240 INFO L426 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-09-20 14:33:41,241 INFO L426 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-09-20 14:33:41,241 INFO L426 ceAbstractionStarter]: For program point L22-1(line 22) no Hoare annotation was computed. [2018-09-20 14:33:41,241 INFO L426 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-09-20 14:33:41,241 INFO L426 ceAbstractionStarter]: For program point L22-2(line 22) no Hoare annotation was computed. [2018-09-20 14:33:41,241 INFO L426 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-09-20 14:33:41,241 INFO L426 ceAbstractionStarter]: For program point L20-2(line 20) no Hoare annotation was computed. [2018-09-20 14:33:41,241 INFO L426 ceAbstractionStarter]: For program point L19-1(lines 19 23) no Hoare annotation was computed. [2018-09-20 14:33:41,241 INFO L426 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2018-09-20 14:33:41,241 INFO L422 ceAbstractionStarter]: At program point L19-3(lines 19 23) the Hoare annotation is: (= |__signbit_double_#in~x| __signbit_double_~x) [2018-09-20 14:33:41,241 INFO L426 ceAbstractionStarter]: For program point L19-4(lines 19 23) no Hoare annotation was computed. [2018-09-20 14:33:41,241 INFO L429 ceAbstractionStarter]: At program point __signbit_doubleENTRY(lines 16 26) the Hoare annotation is: true [2018-09-20 14:33:41,242 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-20 14:33:41,242 INFO L429 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-09-20 14:33:41,242 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-20 14:33:41,242 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-20 14:33:41,242 INFO L429 ceAbstractionStarter]: At program point mainENTRY(lines 226 242) the Hoare annotation is: true [2018-09-20 14:33:41,242 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 226 242) no Hoare annotation was computed. [2018-09-20 14:33:41,242 INFO L426 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 237) no Hoare annotation was computed. [2018-09-20 14:33:41,242 INFO L426 ceAbstractionStarter]: For program point L237(line 237) no Hoare annotation was computed. [2018-09-20 14:33:41,242 INFO L426 ceAbstractionStarter]: For program point mainFINAL(lines 226 242) no Hoare annotation was computed. [2018-09-20 14:33:41,242 INFO L426 ceAbstractionStarter]: For program point L236(line 236) no Hoare annotation was computed. [2018-09-20 14:33:41,243 INFO L422 ceAbstractionStarter]: At program point L236-1(line 236) the Hoare annotation is: (and (= ((_ to_fp 11 53) RNE 1.0) main_~x~0) |main_#t~short19| (= (_ +zero 11 53) main_~res~0)) [2018-09-20 14:33:41,243 INFO L426 ceAbstractionStarter]: For program point L236-2(line 236) no Hoare annotation was computed. [2018-09-20 14:33:41,243 INFO L422 ceAbstractionStarter]: At program point L233(line 233) the Hoare annotation is: (= ((_ to_fp 11 53) RNE 1.0) main_~x~0) [2018-09-20 14:33:41,243 INFO L426 ceAbstractionStarter]: For program point L233-1(line 233) no Hoare annotation was computed. [2018-09-20 14:33:41,243 INFO L426 ceAbstractionStarter]: For program point L236-4(lines 236 239) no Hoare annotation was computed. [2018-09-20 14:33:41,261 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,263 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,263 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,263 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,264 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] [2018-09-20 14:33:41,264 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] [2018-09-20 14:33:41,264 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] [2018-09-20 14:33:41,264 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] [2018-09-20 14:33:41,267 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,267 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,267 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,269 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,270 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] [2018-09-20 14:33:41,270 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] [2018-09-20 14:33:41,270 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] [2018-09-20 14:33:41,270 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] [2018-09-20 14:33:41,275 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,275 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,275 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,275 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,275 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,276 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,276 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,276 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,276 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,276 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,276 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,277 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,281 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,281 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,281 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,281 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,281 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,282 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,282 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,282 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,282 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,282 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,285 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,285 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 02:33:41 BoogieIcfgContainer [2018-09-20 14:33:41,289 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-20 14:33:41,290 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-09-20 14:33:41,290 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-09-20 14:33:41,290 INFO L276 PluginConnector]: Witness Printer initialized [2018-09-20 14:33:41,291 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 02:32:21" (3/4) ... [2018-09-20 14:33:41,296 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-09-20 14:33:41,302 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure __ieee754_sqrt [2018-09-20 14:33:41,302 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-09-20 14:33:41,302 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure __ieee754_acos [2018-09-20 14:33:41,303 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure __signbit_double [2018-09-20 14:33:41,303 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-09-20 14:33:41,314 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 37 nodes and edges [2018-09-20 14:33:41,315 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-09-20 14:33:41,316 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-09-20 14:33:41,316 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-09-20 14:33:41,353 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x [2018-09-20 14:33:41,354 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x [2018-09-20 14:33:41,354 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\exists v_q#valueAsBitvector_11 : bv64 :: ~bvand32(v_q#valueAsBitvector_11[63:32], 2147483647bv32) == ix && \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_11[63:63], v_q#valueAsBitvector_11[62:52], v_q#valueAsBitvector_11[51:0])) && \old(x) == x) && (\exists v_q#valueAsBitvector_13 : bv64 :: v_q#valueAsBitvector_13[63:32] == hx && ~fp~LONGDOUBLE(v_q#valueAsBitvector_13[63:63], v_q#valueAsBitvector_13[62:52], v_q#valueAsBitvector_13[51:0]) == x) [2018-09-20 14:33:41,355 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\exists v_q#valueAsBitvector_11 : bv64 :: \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_11[63:63], v_q#valueAsBitvector_11[62:52], v_q#valueAsBitvector_11[51:0]) && !~bvsge32(~bvand32(v_q#valueAsBitvector_11[63:32], 2147483647bv32), 1072693248bv32)) && (\exists v_q#valueAsBitvector_11 : bv64 :: ~bvand32(v_q#valueAsBitvector_11[63:32], 2147483647bv32) == ix && \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_11[63:63], v_q#valueAsBitvector_11[62:52], v_q#valueAsBitvector_11[51:0]))) && (\exists v_q#valueAsBitvector_11 : bv64 :: hx == v_q#valueAsBitvector_11[63:32] && \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_11[63:63], v_q#valueAsBitvector_11[62:52], v_q#valueAsBitvector_11[51:0]))) && \old(x) == x [2018-09-20 14:33:41,436 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-09-20 14:33:41,437 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-09-20 14:33:41,438 INFO L168 Benchmark]: Toolchain (without parser) took 99597.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 190.3 MB). Free memory was 954.5 MB in the beginning and 868.8 MB in the end (delta: 85.7 MB). Peak memory consumption was 276.0 MB. Max. memory is 11.5 GB. [2018-09-20 14:33:41,439 INFO L168 Benchmark]: CDTParser took 0.20 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-09-20 14:33:41,439 INFO L168 Benchmark]: CACSL2BoogieTranslator took 552.44 ms. Allocated memory is still 1.0 GB. Free memory was 954.5 MB in the beginning and 933.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-09-20 14:33:41,440 INFO L168 Benchmark]: Boogie Preprocessor took 73.50 ms. Allocated memory is still 1.0 GB. Free memory is still 933.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 14:33:41,440 INFO L168 Benchmark]: RCFGBuilder took 18842.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 933.1 MB in the beginning and 1.1 GB in the end (delta: -130.0 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2018-09-20 14:33:41,440 INFO L168 Benchmark]: TraceAbstraction took 79971.59 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.1 MB). Free memory was 1.1 GB in the beginning and 884.2 MB in the end (delta: 178.8 MB). Peak memory consumption was 244.9 MB. Max. memory is 11.5 GB. [2018-09-20 14:33:41,442 INFO L168 Benchmark]: Witness Printer took 146.80 ms. Allocated memory is still 1.2 GB. Free memory was 884.2 MB in the beginning and 868.8 MB in the end (delta: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2018-09-20 14:33:41,445 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.20 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 552.44 ms. Allocated memory is still 1.0 GB. Free memory was 954.5 MB in the beginning and 933.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 73.50 ms. Allocated memory is still 1.0 GB. Free memory is still 933.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 18842.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 933.1 MB in the beginning and 1.1 GB in the end (delta: -130.0 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 79971.59 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.1 MB). Free memory was 1.1 GB in the beginning and 884.2 MB in the end (delta: 178.8 MB). Peak memory consumption was 244.9 MB. Max. memory is 11.5 GB. * Witness Printer took 146.80 ms. Allocated memory is still 1.2 GB. Free memory was 884.2 MB in the beginning and 868.8 MB in the end (delta: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 237]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: \old(x) == x - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 166]: Loop Invariant [2018-09-20 14:33:41,459 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,459 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,459 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,459 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,459 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] [2018-09-20 14:33:41,462 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] [2018-09-20 14:33:41,463 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] [2018-09-20 14:33:41,463 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] [2018-09-20 14:33:41,464 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,464 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,464 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,464 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,464 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] [2018-09-20 14:33:41,464 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] [2018-09-20 14:33:41,464 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] [2018-09-20 14:33:41,465 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] Derived loop invariant: ((\exists v_q#valueAsBitvector_11 : bv64 :: ~bvand32(v_q#valueAsBitvector_11[63:32], 2147483647bv32) == ix && \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_11[63:63], v_q#valueAsBitvector_11[62:52], v_q#valueAsBitvector_11[51:0])) && \old(x) == x) && (\exists v_q#valueAsBitvector_13 : bv64 :: v_q#valueAsBitvector_13[63:32] == hx && ~fp~LONGDOUBLE(v_q#valueAsBitvector_13[63:63], v_q#valueAsBitvector_13[62:52], v_q#valueAsBitvector_13[51:0]) == x) - InvariantResult [Line: 207]: Loop Invariant [2018-09-20 14:33:41,465 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,465 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,466 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,466 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,466 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,466 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,466 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,466 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,467 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,467 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,467 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,467 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,468 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,468 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,468 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,473 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,474 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,474 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,474 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,474 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,474 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,475 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,475 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:33:41,475 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] Derived loop invariant: (((\exists v_q#valueAsBitvector_11 : bv64 :: \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_11[63:63], v_q#valueAsBitvector_11[62:52], v_q#valueAsBitvector_11[51:0]) && !~bvsge32(~bvand32(v_q#valueAsBitvector_11[63:32], 2147483647bv32), 1072693248bv32)) && (\exists v_q#valueAsBitvector_11 : bv64 :: ~bvand32(v_q#valueAsBitvector_11[63:32], 2147483647bv32) == ix && \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_11[63:63], v_q#valueAsBitvector_11[62:52], v_q#valueAsBitvector_11[51:0]))) && (\exists v_q#valueAsBitvector_11 : bv64 :: hx == v_q#valueAsBitvector_11[63:32] && \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_11[63:63], v_q#valueAsBitvector_11[62:52], v_q#valueAsBitvector_11[51:0]))) && \old(x) == x - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 80]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: \old(x) == x - InvariantResult [Line: 61]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 147 locations, 1 error locations. SAFE Result, 79.8s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 61.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 1052 SDtfs, 430 SDslu, 5091 SDs, 0 SdLazy, 673 SolverSat, 33 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 47.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 328 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 9.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=147occurred 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.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 54 PreInvPairs, 73 NumberOfFragments, 196 HoareAnnotationTreeSize, 54 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 21 FomulaSimplificationsInter, 111 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 10.6s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 290 NumberOfCodeBlocks, 290 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 282 ConstructedInterpolants, 96 QuantifiedInterpolants, 78856 SizeOfPredicates, 53 NumberOfNonLiveVariables, 995 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...