./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/float-newlib/float_req_bl_1270c_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa 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 /storage/repos/svcomp/c/float-newlib/float_req_bl_1270c_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 fce8eaffc8fbce8eaab4a2e551ea29a4fcef0871 ......................................................................................................................................................................................................................................................................................................... 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 /storage/repos/svcomp/c/float-newlib/float_req_bl_1270c_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 fce8eaffc8fbce8eaab4a2e551ea29a4fcef0871 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 04:06:42,650 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 04:06:42,652 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 04:06:42,669 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 04:06:42,670 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 04:06:42,672 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 04:06:42,675 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 04:06:42,677 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 04:06:42,679 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 04:06:42,680 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 04:06:42,681 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 04:06:42,682 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 04:06:42,683 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 04:06:42,684 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 04:06:42,685 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 04:06:42,686 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 04:06:42,687 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 04:06:42,689 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 04:06:42,692 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 04:06:42,693 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 04:06:42,695 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 04:06:42,696 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 04:06:42,699 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 04:06:42,699 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 04:06:42,699 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 04:06:42,700 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 04:06:42,702 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 04:06:42,703 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 04:06:42,704 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 04:06:42,705 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 04:06:42,705 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 04:06:42,705 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 04:06:42,706 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 04:06:42,706 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 04:06:42,708 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 04:06:42,709 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 04:06:42,709 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 04:06:42,726 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 04:06:42,726 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 04:06:42,727 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 04:06:42,727 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 04:06:42,728 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 04:06:42,728 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 04:06:42,729 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 04:06:42,729 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 04:06:42,729 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 04:06:42,729 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 04:06:42,729 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 04:06:42,729 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 04:06:42,730 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 04:06:42,730 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 04:06:42,730 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 04:06:42,730 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 04:06:42,730 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 04:06:42,730 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 04:06:42,732 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 04:06:42,732 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 04:06:42,733 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 04:06:42,733 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 04:06:42,733 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 04:06:42,733 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 04:06:42,733 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 04:06:42,733 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 04:06:42,734 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 04:06:42,735 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 04:06:42,735 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 -> fce8eaffc8fbce8eaab4a2e551ea29a4fcef0871 [2018-12-31 04:06:42,772 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 04:06:42,785 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 04:06:42,789 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 04:06:42,791 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 04:06:42,791 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 04:06:42,792 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/float_req_bl_1270c_true-unreach-call.c [2018-12-31 04:06:42,846 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cc491302/b4abae3c01bd48bc94ea654a5edc883a/FLAGce2f4fb36 [2018-12-31 04:06:43,343 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 04:06:43,344 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/float_req_bl_1270c_true-unreach-call.c [2018-12-31 04:06:43,359 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cc491302/b4abae3c01bd48bc94ea654a5edc883a/FLAGce2f4fb36 [2018-12-31 04:06:43,660 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cc491302/b4abae3c01bd48bc94ea654a5edc883a [2018-12-31 04:06:43,664 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 04:06:43,665 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 04:06:43,671 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 04:06:43,671 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 04:06:43,678 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 04:06:43,679 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 04:06:43" (1/1) ... [2018-12-31 04:06:43,682 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fa4c198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:43, skipping insertion in model container [2018-12-31 04:06:43,683 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 04:06:43" (1/1) ... [2018-12-31 04:06:43,691 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 04:06:43,730 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 04:06:44,083 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 04:06:44,091 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 04:06:44,149 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 04:06:44,187 INFO L195 MainTranslator]: Completed translation [2018-12-31 04:06:44,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:44 WrapperNode [2018-12-31 04:06:44,188 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 04:06:44,189 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 04:06:44,189 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 04:06:44,189 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 04:06:44,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:44" (1/1) ... [2018-12-31 04:06:44,286 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:44" (1/1) ... [2018-12-31 04:06:44,330 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 04:06:44,331 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 04:06:44,331 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 04:06:44,331 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 04:06:44,343 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:44" (1/1) ... [2018-12-31 04:06:44,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:44" (1/1) ... [2018-12-31 04:06:44,349 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:44" (1/1) ... [2018-12-31 04:06:44,349 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:44" (1/1) ... [2018-12-31 04:06:44,368 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:44" (1/1) ... [2018-12-31 04:06:44,392 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:44" (1/1) ... [2018-12-31 04:06:44,401 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:44" (1/1) ... [2018-12-31 04:06:44,409 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 04:06:44,410 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 04:06:44,410 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 04:06:44,410 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 04:06:44,411 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:44" (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-12-31 04:06:44,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 04:06:44,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-12-31 04:06:44,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 04:06:44,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-12-31 04:06:44,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 04:06:44,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 04:06:44,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-31 04:06:44,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 04:06:45,747 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 04:06:45,748 INFO L280 CfgBuilder]: Removed 52 assue(true) statements. [2018-12-31 04:06:45,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:06:45 BoogieIcfgContainer [2018-12-31 04:06:45,748 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 04:06:45,752 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 04:06:45,752 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 04:06:45,756 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 04:06:45,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 04:06:43" (1/3) ... [2018-12-31 04:06:45,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@524f939d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 04:06:45, skipping insertion in model container [2018-12-31 04:06:45,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:44" (2/3) ... [2018-12-31 04:06:45,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@524f939d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 04:06:45, skipping insertion in model container [2018-12-31 04:06:45,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:06:45" (3/3) ... [2018-12-31 04:06:45,760 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1270c_true-unreach-call.c [2018-12-31 04:06:45,768 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 04:06:45,777 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 04:06:45,794 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 04:06:45,830 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 04:06:45,831 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 04:06:45,831 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 04:06:45,831 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 04:06:45,832 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 04:06:45,832 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 04:06:45,832 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 04:06:45,832 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 04:06:45,832 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 04:06:45,850 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2018-12-31 04:06:45,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 04:06:45,858 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:45,859 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:06:45,862 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:45,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:45,867 INFO L82 PathProgramCache]: Analyzing trace with hash 311741284, now seen corresponding path program 1 times [2018-12-31 04:06:45,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:06:45,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:06:45,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:06:45,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:45,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:06:45,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:45,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:46,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:46,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 04:06:46,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 04:06:46,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 04:06:46,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 04:06:46,019 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 2 states. [2018-12-31 04:06:46,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:46,051 INFO L93 Difference]: Finished difference Result 212 states and 358 transitions. [2018-12-31 04:06:46,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 04:06:46,053 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-12-31 04:06:46,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:46,067 INFO L225 Difference]: With dead ends: 212 [2018-12-31 04:06:46,067 INFO L226 Difference]: Without dead ends: 104 [2018-12-31 04:06:46,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 04:06:46,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-31 04:06:46,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-31 04:06:46,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-31 04:06:46,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 136 transitions. [2018-12-31 04:06:46,117 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 136 transitions. Word has length 16 [2018-12-31 04:06:46,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:46,118 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 136 transitions. [2018-12-31 04:06:46,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 04:06:46,118 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 136 transitions. [2018-12-31 04:06:46,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-31 04:06:46,120 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:46,120 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:06:46,120 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:46,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:46,121 INFO L82 PathProgramCache]: Analyzing trace with hash 2055151297, now seen corresponding path program 1 times [2018-12-31 04:06:46,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:06:46,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:06:46,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:06:46,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:46,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:06:46,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 04:06:46,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 04:06:46,374 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 04:06:46,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 04:06:46 BoogieIcfgContainer [2018-12-31 04:06:46,417 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 04:06:46,418 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 04:06:46,418 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 04:06:46,418 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 04:06:46,419 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:06:45" (3/4) ... [2018-12-31 04:06:46,423 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-31 04:06:46,424 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 04:06:46,425 INFO L168 Benchmark]: Toolchain (without parser) took 2760.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 946.0 MB in the beginning and 1.0 GB in the end (delta: -100.2 MB). Peak memory consumption was 42.9 MB. Max. memory is 11.5 GB. [2018-12-31 04:06:46,427 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 04:06:46,427 INFO L168 Benchmark]: CACSL2BoogieTranslator took 517.34 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 929.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-31 04:06:46,430 INFO L168 Benchmark]: Boogie Procedure Inliner took 141.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -200.4 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2018-12-31 04:06:46,431 INFO L168 Benchmark]: Boogie Preprocessor took 78.47 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 04:06:46,432 INFO L168 Benchmark]: RCFGBuilder took 1338.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 11.5 GB. [2018-12-31 04:06:46,433 INFO L168 Benchmark]: TraceAbstraction took 665.39 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: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 11.5 GB. [2018-12-31 04:06:46,433 INFO L168 Benchmark]: Witness Printer took 5.77 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-12-31 04:06:46,438 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 517.34 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 929.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 141.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -200.4 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 78.47 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1338.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 665.39 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: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 11.5 GB. * Witness Printer took 5.77 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: 235]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryArithmeticFLOAToperation at line 118, overapproximation of bitwiseAnd at line 218. Possible FailurePath: [L12] static const float one_sqrt = 1.0, tiny_sqrt = 1.0e-30; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L229] float x = __VERIFIER_nondet_float(); [L230] float y = 1.0f / 0.0f; [L82] float a = x, b = y, t1, t2, y1, y2, w; [L83] __int32_t j, k, ha, hb; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L86] ieee_float_shape_type gf_u; [L87] gf_u.value = (x) [L88] EXPR gf_u.word [L88] (ha) = gf_u.word [L90] ha &= 0x7fffffffL VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L92] ieee_float_shape_type gf_u; [L93] gf_u.value = (y) [L94] EXPR gf_u.word [L94] (hb) = gf_u.word [L96] hb &= 0x7fffffffL VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L97] COND FALSE !(hb > ha) [L104] a = x [L105] b = y VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L108] ieee_float_shape_type sf_u; [L109] sf_u.word = (ha) [L110] EXPR sf_u.value [L110] (a) = sf_u.value [L113] ieee_float_shape_type sf_u; [L114] sf_u.word = (hb) [L115] EXPR sf_u.value [L115] (b) = sf_u.value [L117] COND TRUE (ha - hb) > 0xf000000L [L118] return a + b; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L232] float res = __ieee754_hypotf(x, y); [L212] __int32_t ix; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L214] ieee_float_shape_type gf_u; [L215] gf_u.value = (x) [L216] EXPR gf_u.word [L216] (ix) = gf_u.word [L218] ix &= 0x7fffffff [L219] return ((ix) == 0x7f800000L); VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L234] COND TRUE !isinf_float(res) [L235] __VERIFIER_error() VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 107 locations, 1 error locations. UNSAFE Result, 0.5s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 139 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=107occurred 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.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 225 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.24-2e94e6a [2018-12-31 04:06:48,893 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 04:06:48,895 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 04:06:48,910 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 04:06:48,911 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 04:06:48,912 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 04:06:48,913 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 04:06:48,918 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 04:06:48,920 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 04:06:48,921 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 04:06:48,923 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 04:06:48,923 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 04:06:48,925 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 04:06:48,926 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 04:06:48,934 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 04:06:48,935 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 04:06:48,937 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 04:06:48,941 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 04:06:48,945 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 04:06:48,949 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 04:06:48,950 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 04:06:48,951 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 04:06:48,955 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 04:06:48,956 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 04:06:48,956 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 04:06:48,957 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 04:06:48,959 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 04:06:48,960 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 04:06:48,961 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 04:06:48,962 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 04:06:48,962 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 04:06:48,963 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 04:06:48,963 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 04:06:48,963 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 04:06:48,966 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 04:06:48,967 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 04:06:48,967 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-12-31 04:06:48,994 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 04:06:48,994 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 04:06:48,995 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 04:06:48,995 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 04:06:48,995 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 04:06:48,998 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 04:06:48,999 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 04:06:48,999 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 04:06:48,999 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 04:06:48,999 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 04:06:48,999 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 04:06:48,999 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 04:06:49,000 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-31 04:06:49,000 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-31 04:06:49,000 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 04:06:49,000 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 04:06:49,000 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 04:06:49,000 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 04:06:49,002 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 04:06:49,002 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 04:06:49,002 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 04:06:49,002 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 04:06:49,003 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 04:06:49,003 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 04:06:49,003 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 04:06:49,003 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 04:06:49,003 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-31 04:06:49,003 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 04:06:49,004 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-31 04:06:49,004 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-31 04:06:49,004 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 -> fce8eaffc8fbce8eaab4a2e551ea29a4fcef0871 [2018-12-31 04:06:49,062 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 04:06:49,078 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 04:06:49,085 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 04:06:49,087 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 04:06:49,088 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 04:06:49,089 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/float_req_bl_1270c_true-unreach-call.c [2018-12-31 04:06:49,169 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bff15735/15f7584cce674c1f9fa8524a08165ec8/FLAG9e120d4cc [2018-12-31 04:06:49,679 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 04:06:49,683 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/float_req_bl_1270c_true-unreach-call.c [2018-12-31 04:06:49,693 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bff15735/15f7584cce674c1f9fa8524a08165ec8/FLAG9e120d4cc [2018-12-31 04:06:50,118 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bff15735/15f7584cce674c1f9fa8524a08165ec8 [2018-12-31 04:06:50,122 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 04:06:50,123 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 04:06:50,124 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 04:06:50,124 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 04:06:50,128 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 04:06:50,129 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 04:06:50" (1/1) ... [2018-12-31 04:06:50,132 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56ae820b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:50, skipping insertion in model container [2018-12-31 04:06:50,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 04:06:50" (1/1) ... [2018-12-31 04:06:50,141 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 04:06:50,175 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 04:06:50,484 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 04:06:50,503 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 04:06:50,610 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 04:06:50,756 INFO L195 MainTranslator]: Completed translation [2018-12-31 04:06:50,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:50 WrapperNode [2018-12-31 04:06:50,757 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 04:06:50,757 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 04:06:50,757 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 04:06:50,758 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 04:06:50,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:50" (1/1) ... [2018-12-31 04:06:50,786 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:50" (1/1) ... [2018-12-31 04:06:50,834 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 04:06:50,834 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 04:06:50,835 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 04:06:50,835 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 04:06:50,848 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:50" (1/1) ... [2018-12-31 04:06:50,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:50" (1/1) ... [2018-12-31 04:06:50,863 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:50" (1/1) ... [2018-12-31 04:06:50,864 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:50" (1/1) ... [2018-12-31 04:06:50,886 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:50" (1/1) ... [2018-12-31 04:06:50,900 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:50" (1/1) ... [2018-12-31 04:06:50,904 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:50" (1/1) ... [2018-12-31 04:06:50,911 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 04:06:50,912 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 04:06:50,912 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 04:06:50,912 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 04:06:50,913 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:50" (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-12-31 04:06:50,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 04:06:50,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2018-12-31 04:06:50,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-31 04:06:50,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 04:06:50,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 04:06:50,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2018-12-31 04:06:50,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-31 04:06:50,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 04:06:51,458 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 04:06:51,527 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 04:06:53,827 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 04:06:57,235 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 04:06:57,333 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 04:06:57,808 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 04:06:57,808 INFO L280 CfgBuilder]: Removed 52 assue(true) statements. [2018-12-31 04:06:57,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:06:57 BoogieIcfgContainer [2018-12-31 04:06:57,809 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 04:06:57,810 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 04:06:57,810 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 04:06:57,813 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 04:06:57,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 04:06:50" (1/3) ... [2018-12-31 04:06:57,814 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d169cde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 04:06:57, skipping insertion in model container [2018-12-31 04:06:57,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:50" (2/3) ... [2018-12-31 04:06:57,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d169cde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 04:06:57, skipping insertion in model container [2018-12-31 04:06:57,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:06:57" (3/3) ... [2018-12-31 04:06:57,818 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1270c_true-unreach-call.c [2018-12-31 04:06:57,827 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 04:06:57,835 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 04:06:57,852 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 04:06:57,889 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 04:06:57,890 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 04:06:57,890 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 04:06:57,890 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 04:06:57,890 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 04:06:57,891 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 04:06:57,891 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 04:06:57,891 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 04:06:57,891 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 04:06:57,909 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2018-12-31 04:06:57,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 04:06:57,917 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:57,918 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:06:57,920 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:57,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:57,925 INFO L82 PathProgramCache]: Analyzing trace with hash 311741284, now seen corresponding path program 1 times [2018-12-31 04:06:57,930 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:06:57,930 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-12-31 04:06:57,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:58,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:58,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:06:58,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:58,041 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:06:58,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:58,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 04:06:58,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 04:06:58,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 04:06:58,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 04:06:58,086 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 2 states. [2018-12-31 04:06:58,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:58,141 INFO L93 Difference]: Finished difference Result 212 states and 358 transitions. [2018-12-31 04:06:58,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 04:06:58,142 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-12-31 04:06:58,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:58,156 INFO L225 Difference]: With dead ends: 212 [2018-12-31 04:06:58,156 INFO L226 Difference]: Without dead ends: 104 [2018-12-31 04:06:58,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 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-12-31 04:06:58,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-31 04:06:58,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-31 04:06:58,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-31 04:06:58,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 136 transitions. [2018-12-31 04:06:58,213 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 136 transitions. Word has length 16 [2018-12-31 04:06:58,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:58,213 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 136 transitions. [2018-12-31 04:06:58,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 04:06:58,214 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 136 transitions. [2018-12-31 04:06:58,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-31 04:06:58,215 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:58,215 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:06:58,215 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:58,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:58,216 INFO L82 PathProgramCache]: Analyzing trace with hash 2055151297, now seen corresponding path program 1 times [2018-12-31 04:06:58,217 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:06:58,217 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-12-31 04:06:58,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:58,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:58,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:06:58,868 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 15 [2018-12-31 04:06:58,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:58,892 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:06:58,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:58,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 04:06:58,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 04:06:58,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 04:06:58,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 04:06:58,915 INFO L87 Difference]: Start difference. First operand 104 states and 136 transitions. Second operand 6 states. [2018-12-31 04:06:59,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:59,912 INFO L93 Difference]: Finished difference Result 294 states and 381 transitions. [2018-12-31 04:06:59,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 04:06:59,921 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-12-31 04:06:59,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:59,926 INFO L225 Difference]: With dead ends: 294 [2018-12-31 04:06:59,926 INFO L226 Difference]: Without dead ends: 208 [2018-12-31 04:06:59,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-12-31 04:06:59,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-12-31 04:06:59,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 113. [2018-12-31 04:06:59,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-31 04:06:59,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 146 transitions. [2018-12-31 04:06:59,968 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 146 transitions. Word has length 21 [2018-12-31 04:06:59,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:59,969 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 146 transitions. [2018-12-31 04:06:59,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 04:06:59,970 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 146 transitions. [2018-12-31 04:06:59,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-31 04:06:59,972 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:59,972 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:06:59,972 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:59,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:59,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1653009985, now seen corresponding path program 1 times [2018-12-31 04:06:59,973 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:06:59,975 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-12-31 04:06:59,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:07:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:07:00,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:07:01,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:07:01,513 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:07:01,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:07:01,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-31 04:07:01,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-31 04:07:01,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-31 04:07:01,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-31 04:07:01,531 INFO L87 Difference]: Start difference. First operand 113 states and 146 transitions. Second operand 13 states. [2018-12-31 04:07:03,450 WARN L181 SmtUtils]: Spent 647.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2018-12-31 04:07:05,826 WARN L181 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2018-12-31 04:07:10,590 WARN L181 SmtUtils]: Spent 3.90 s on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2018-12-31 04:07:16,667 WARN L181 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2018-12-31 04:07:21,891 WARN L181 SmtUtils]: Spent 4.31 s on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2018-12-31 04:07:22,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:07:22,100 INFO L93 Difference]: Finished difference Result 157 states and 187 transitions. [2018-12-31 04:07:22,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 04:07:22,101 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2018-12-31 04:07:22,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:07:22,103 INFO L225 Difference]: With dead ends: 157 [2018-12-31 04:07:22,103 INFO L226 Difference]: Without dead ends: 64 [2018-12-31 04:07:22,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=135, Invalid=371, Unknown=0, NotChecked=0, Total=506 [2018-12-31 04:07:22,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-31 04:07:22,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 36. [2018-12-31 04:07:22,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-31 04:07:22,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-12-31 04:07:22,112 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 21 [2018-12-31 04:07:22,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:07:22,113 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-12-31 04:07:22,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-31 04:07:22,113 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-12-31 04:07:22,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-31 04:07:22,114 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:07:22,114 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:07:22,114 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:07:22,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:07:22,115 INFO L82 PathProgramCache]: Analyzing trace with hash -558668800, now seen corresponding path program 1 times [2018-12-31 04:07:22,115 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:07:22,115 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-12-31 04:07:22,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:07:22,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:07:22,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:07:22,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:07:22,458 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:07:22,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:07:22,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-31 04:07:22,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 04:07:22,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 04:07:22,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-31 04:07:22,482 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 11 states. [2018-12-31 04:07:23,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:07:23,975 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-12-31 04:07:23,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 04:07:23,976 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-12-31 04:07:23,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:07:23,977 INFO L225 Difference]: With dead ends: 54 [2018-12-31 04:07:23,977 INFO L226 Difference]: Without dead ends: 36 [2018-12-31 04:07:23,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-12-31 04:07:23,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-31 04:07:23,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2018-12-31 04:07:23,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-31 04:07:23,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-12-31 04:07:23,985 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 26 [2018-12-31 04:07:23,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:07:23,986 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-12-31 04:07:23,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 04:07:23,986 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-12-31 04:07:23,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-31 04:07:23,987 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:07:23,987 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:07:23,987 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:07:23,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:07:23,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1435475906, now seen corresponding path program 1 times [2018-12-31 04:07:23,988 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:07:23,988 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-12-31 04:07:24,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:07:24,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:07:24,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:07:24,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:07:24,285 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:07:24,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:07:24,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 04:07:24,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 04:07:24,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 04:07:24,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 04:07:24,301 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 6 states. [2018-12-31 04:07:24,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:07:24,695 INFO L93 Difference]: Finished difference Result 36 states and 35 transitions. [2018-12-31 04:07:24,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 04:07:24,696 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-12-31 04:07:24,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:07:24,697 INFO L225 Difference]: With dead ends: 36 [2018-12-31 04:07:24,697 INFO L226 Difference]: Without dead ends: 27 [2018-12-31 04:07:24,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-31 04:07:24,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-31 04:07:24,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-31 04:07:24,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-31 04:07:24,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 26 transitions. [2018-12-31 04:07:24,706 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 26 transitions. Word has length 26 [2018-12-31 04:07:24,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:07:24,706 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 26 transitions. [2018-12-31 04:07:24,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 04:07:24,707 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2018-12-31 04:07:24,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-31 04:07:24,707 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:07:24,708 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:07:24,708 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:07:24,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:07:24,708 INFO L82 PathProgramCache]: Analyzing trace with hash 2115534276, now seen corresponding path program 1 times [2018-12-31 04:07:24,709 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:07:24,709 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-12-31 04:07:24,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:07:24,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:07:24,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:07:25,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:07:25,128 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:07:25,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:07:25,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-31 04:07:25,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-31 04:07:25,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-31 04:07:25,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-31 04:07:25,142 INFO L87 Difference]: Start difference. First operand 27 states and 26 transitions. Second operand 12 states. [2018-12-31 04:07:26,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:07:26,262 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2018-12-31 04:07:26,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 04:07:26,262 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-12-31 04:07:26,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:07:26,263 INFO L225 Difference]: With dead ends: 27 [2018-12-31 04:07:26,263 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 04:07:26,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2018-12-31 04:07:26,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 04:07:26,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 04:07:26,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 04:07:26,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 04:07:26,265 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-12-31 04:07:26,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:07:26,265 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 04:07:26,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-31 04:07:26,265 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 04:07:26,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 04:07:26,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 04:07:28,543 WARN L181 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 83 DAG size of output: 56 [2018-12-31 04:07:35,758 WARN L181 SmtUtils]: Spent 7.21 s on a formula simplification. DAG size of input: 110 DAG size of output: 77 [2018-12-31 04:07:39,392 WARN L181 SmtUtils]: Spent 3.62 s on a formula simplification. DAG size of input: 93 DAG size of output: 63 [2018-12-31 04:07:39,457 INFO L448 ceAbstractionStarter]: For program point L35-2(lines 35 39) no Hoare annotation was computed. [2018-12-31 04:07:39,457 INFO L448 ceAbstractionStarter]: For program point L35-3(lines 35 39) no Hoare annotation was computed. [2018-12-31 04:07:39,457 INFO L448 ceAbstractionStarter]: For program point L35-5(lines 35 39) no Hoare annotation was computed. [2018-12-31 04:07:39,458 INFO L448 ceAbstractionStarter]: For program point L234(lines 234 237) no Hoare annotation was computed. [2018-12-31 04:07:39,458 INFO L448 ceAbstractionStarter]: For program point L36-2(lines 36 37) no Hoare annotation was computed. [2018-12-31 04:07:39,458 INFO L444 ceAbstractionStarter]: At program point L36-3(lines 36 37) the Hoare annotation is: false [2018-12-31 04:07:39,458 INFO L448 ceAbstractionStarter]: For program point L36-4(lines 36 37) no Hoare annotation was computed. [2018-12-31 04:07:39,458 INFO L448 ceAbstractionStarter]: For program point L36-7(lines 36 37) no Hoare annotation was computed. [2018-12-31 04:07:39,458 INFO L444 ceAbstractionStarter]: At program point L36-8(lines 36 37) the Hoare annotation is: false [2018-12-31 04:07:39,458 INFO L448 ceAbstractionStarter]: For program point L36-9(lines 36 37) no Hoare annotation was computed. [2018-12-31 04:07:39,458 INFO L448 ceAbstractionStarter]: For program point L235(line 235) no Hoare annotation was computed. [2018-12-31 04:07:39,459 INFO L451 ceAbstractionStarter]: At program point L238(lines 222 239) the Hoare annotation is: true [2018-12-31 04:07:39,459 INFO L448 ceAbstractionStarter]: For program point L139(lines 139 143) no Hoare annotation was computed. [2018-12-31 04:07:39,459 INFO L448 ceAbstractionStarter]: For program point L139-1(lines 121 144) no Hoare annotation was computed. [2018-12-31 04:07:39,459 INFO L448 ceAbstractionStarter]: For program point L73-1(lines 73 77) no Hoare annotation was computed. [2018-12-31 04:07:39,459 INFO L444 ceAbstractionStarter]: At program point L73-2(lines 73 77) the Hoare annotation is: false [2018-12-31 04:07:39,459 INFO L448 ceAbstractionStarter]: For program point L73-3(lines 73 77) no Hoare annotation was computed. [2018-12-31 04:07:39,459 INFO L448 ceAbstractionStarter]: For program point L73-5(lines 73 77) no Hoare annotation was computed. [2018-12-31 04:07:39,459 INFO L444 ceAbstractionStarter]: At program point L73-6(lines 73 77) the Hoare annotation is: false [2018-12-31 04:07:39,459 INFO L448 ceAbstractionStarter]: For program point L73-7(lines 73 77) no Hoare annotation was computed. [2018-12-31 04:07:39,459 INFO L448 ceAbstractionStarter]: For program point L107(lines 107 111) no Hoare annotation was computed. [2018-12-31 04:07:39,462 INFO L448 ceAbstractionStarter]: For program point L107-1(lines 81 208) no Hoare annotation was computed. [2018-12-31 04:07:39,462 INFO L444 ceAbstractionStarter]: At program point L207(lines 81 208) the Hoare annotation is: (let ((.cse4 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))) (let ((.cse2 (= ULTIMATE.start___ieee754_hypotf_~y .cse4)) (.cse3 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0)))) (or (and (exists ((ULTIMATE.start___ieee754_hypotf_~hb~0 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0)))) (and (= .cse0 ULTIMATE.start___ieee754_hypotf_~w~0) (= .cse0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))) (exists ((ULTIMATE.start___ieee754_hypotf_~hb~0 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0)))) (and (= .cse1 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) (= .cse1 |ULTIMATE.start___ieee754_hypotf_#res|)))) (and .cse2 (= .cse3 .cse4) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_26 (_ BitVec 32))) (= ULTIMATE.start___ieee754_hypotf_~ha~0 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_26)))) (exists ((ULTIMATE.start___ieee754_hypotf_~hb~0 (_ BitVec 32))) (let ((.cse5 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0)))) (and (= .cse5 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) (= .cse5 ULTIMATE.start___ieee754_hypotf_~b~0))))) (let ((.cse8 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0)))) (and .cse2 (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_26 (_ BitVec 32))) (= ULTIMATE.start___ieee754_hypotf_~hb~0 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_26))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_26 (_ BitVec 32)) (ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32))) (let ((.cse6 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_26)) (.cse7 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0)))) (and (bvsgt (bvadd (bvneg .cse6) ULTIMATE.start___ieee754_hypotf_~ha~0) (_ bv251658240 32)) (= (fp.add roundNearestTiesToEven .cse7 (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))) |ULTIMATE.start___ieee754_hypotf_#res|) (= .cse7 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))) (= .cse3 ULTIMATE.start___ieee754_hypotf_~b~0) (= .cse8 ULTIMATE.start___ieee754_hypotf_~a~0) (= .cse8 .cse4)))))) [2018-12-31 04:07:39,462 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 43) no Hoare annotation was computed. [2018-12-31 04:07:39,463 INFO L448 ceAbstractionStarter]: For program point L42-2(lines 42 43) no Hoare annotation was computed. [2018-12-31 04:07:39,463 INFO L448 ceAbstractionStarter]: For program point L42-3(lines 42 43) no Hoare annotation was computed. [2018-12-31 04:07:39,463 INFO L448 ceAbstractionStarter]: For program point L42-5(lines 42 43) no Hoare annotation was computed. [2018-12-31 04:07:39,463 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 198) no Hoare annotation was computed. [2018-12-31 04:07:39,463 INFO L448 ceAbstractionStarter]: For program point L175-2(lines 81 208) no Hoare annotation was computed. [2018-12-31 04:07:39,463 INFO L448 ceAbstractionStarter]: For program point L176-1(lines 176 180) no Hoare annotation was computed. [2018-12-31 04:07:39,467 INFO L444 ceAbstractionStarter]: At program point L176-2(lines 176 180) the Hoare annotation is: false [2018-12-31 04:07:39,467 INFO L448 ceAbstractionStarter]: For program point L176-3(lines 176 180) no Hoare annotation was computed. [2018-12-31 04:07:39,467 INFO L444 ceAbstractionStarter]: At program point L78(lines 14 79) the Hoare annotation is: false [2018-12-31 04:07:39,467 INFO L444 ceAbstractionStarter]: At program point L78-1(lines 14 79) the Hoare annotation is: false [2018-12-31 04:07:39,467 INFO L448 ceAbstractionStarter]: For program point L145(lines 145 172) no Hoare annotation was computed. [2018-12-31 04:07:39,467 INFO L448 ceAbstractionStarter]: For program point L112(lines 112 116) no Hoare annotation was computed. [2018-12-31 04:07:39,467 INFO L448 ceAbstractionStarter]: For program point L112-1(lines 81 208) no Hoare annotation was computed. [2018-12-31 04:07:39,468 INFO L448 ceAbstractionStarter]: For program point L112-2(lines 81 208) no Hoare annotation was computed. [2018-12-31 04:07:39,468 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 235) no Hoare annotation was computed. [2018-12-31 04:07:39,468 INFO L448 ceAbstractionStarter]: For program point L146(lines 146 171) no Hoare annotation was computed. [2018-12-31 04:07:39,468 INFO L448 ceAbstractionStarter]: For program point L213-1(lines 213 217) no Hoare annotation was computed. [2018-12-31 04:07:39,469 INFO L444 ceAbstractionStarter]: At program point L213-2(lines 213 217) the Hoare annotation is: (let ((.cse4 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))) (let ((.cse2 (= ULTIMATE.start___ieee754_hypotf_~y .cse4)) (.cse3 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0)))) (or (and (exists ((ULTIMATE.start___ieee754_hypotf_~hb~0 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0)))) (and (= .cse0 ULTIMATE.start___ieee754_hypotf_~w~0) (= .cse0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))) (exists ((ULTIMATE.start___ieee754_hypotf_~hb~0 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0)))) (and (= .cse1 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) (= .cse1 |ULTIMATE.start___ieee754_hypotf_#res|)))) (and .cse2 (= .cse3 .cse4) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_26 (_ BitVec 32))) (= ULTIMATE.start___ieee754_hypotf_~ha~0 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_26)))) (exists ((ULTIMATE.start___ieee754_hypotf_~hb~0 (_ BitVec 32))) (let ((.cse5 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0)))) (and (= .cse5 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) (= ULTIMATE.start_isinf_float_~x .cse5)))) (exists ((ULTIMATE.start___ieee754_hypotf_~hb~0 (_ BitVec 32))) (let ((.cse6 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0)))) (and (= .cse6 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) (= .cse6 ULTIMATE.start___ieee754_hypotf_~b~0))))) (let ((.cse11 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0)))) (and .cse2 (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_26 (_ BitVec 32))) (= ULTIMATE.start___ieee754_hypotf_~hb~0 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_26))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_26 (_ BitVec 32)) (ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32))) (let ((.cse8 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_26)) (.cse7 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0)))) (and (= ULTIMATE.start_isinf_float_~x (fp.add roundNearestTiesToEven .cse7 (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (bvsgt (bvadd (bvneg .cse8) ULTIMATE.start___ieee754_hypotf_~ha~0) (_ bv251658240 32)) (= .cse7 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_26 (_ BitVec 32)) (ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32))) (let ((.cse9 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_26)) (.cse10 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0)))) (and (bvsgt (bvadd (bvneg .cse9) ULTIMATE.start___ieee754_hypotf_~ha~0) (_ bv251658240 32)) (= (fp.add roundNearestTiesToEven .cse10 (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))) |ULTIMATE.start___ieee754_hypotf_#res|) (= .cse10 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))) (= .cse3 ULTIMATE.start___ieee754_hypotf_~b~0) (= .cse11 ULTIMATE.start___ieee754_hypotf_~a~0) (= .cse11 .cse4)))))) [2018-12-31 04:07:39,471 INFO L448 ceAbstractionStarter]: For program point L213-3(lines 213 217) no Hoare annotation was computed. [2018-12-31 04:07:39,471 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 171) no Hoare annotation was computed. [2018-12-31 04:07:39,471 INFO L448 ceAbstractionStarter]: For program point L149-1(lines 149 153) no Hoare annotation was computed. [2018-12-31 04:07:39,471 INFO L444 ceAbstractionStarter]: At program point L149-2(lines 149 153) the Hoare annotation is: false [2018-12-31 04:07:39,471 INFO L448 ceAbstractionStarter]: For program point L149-3(lines 149 153) no Hoare annotation was computed. [2018-12-31 04:07:39,472 INFO L444 ceAbstractionStarter]: At program point L50-2(lines 50 59) the Hoare annotation is: false [2018-12-31 04:07:39,472 INFO L448 ceAbstractionStarter]: For program point L50-3(lines 14 79) no Hoare annotation was computed. [2018-12-31 04:07:39,472 INFO L444 ceAbstractionStarter]: At program point L50-6(lines 50 59) the Hoare annotation is: false [2018-12-31 04:07:39,472 INFO L448 ceAbstractionStarter]: For program point L50-7(lines 14 79) no Hoare annotation was computed. [2018-12-31 04:07:39,472 INFO L448 ceAbstractionStarter]: For program point L85-1(lines 85 89) no Hoare annotation was computed. [2018-12-31 04:07:39,472 INFO L448 ceAbstractionStarter]: For program point L52(lines 52 56) no Hoare annotation was computed. [2018-12-31 04:07:39,472 INFO L444 ceAbstractionStarter]: At program point L85-2(lines 85 89) the Hoare annotation is: (and (= ULTIMATE.start___ieee754_hypotf_~y (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) (exists ((ULTIMATE.start___ieee754_hypotf_~hb~0 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0)))) (and (= .cse0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) (= .cse0 ULTIMATE.start___ieee754_hypotf_~b~0))))) [2018-12-31 04:07:39,472 INFO L448 ceAbstractionStarter]: For program point L85-3(lines 85 89) no Hoare annotation was computed. [2018-12-31 04:07:39,472 INFO L448 ceAbstractionStarter]: For program point L19-1(lines 19 23) no Hoare annotation was computed. [2018-12-31 04:07:39,472 INFO L448 ceAbstractionStarter]: For program point L52-2(lines 52 56) no Hoare annotation was computed. [2018-12-31 04:07:39,473 INFO L444 ceAbstractionStarter]: At program point L19-2(lines 19 23) the Hoare annotation is: false [2018-12-31 04:07:39,473 INFO L448 ceAbstractionStarter]: For program point L52-3(lines 52 56) no Hoare annotation was computed. [2018-12-31 04:07:39,473 INFO L448 ceAbstractionStarter]: For program point L19-3(lines 19 23) no Hoare annotation was computed. [2018-12-31 04:07:39,473 INFO L448 ceAbstractionStarter]: For program point L52-5(lines 52 56) no Hoare annotation was computed. [2018-12-31 04:07:39,473 INFO L448 ceAbstractionStarter]: For program point L19-5(lines 19 23) no Hoare annotation was computed. [2018-12-31 04:07:39,473 INFO L444 ceAbstractionStarter]: At program point L19-6(lines 19 23) the Hoare annotation is: false [2018-12-31 04:07:39,473 INFO L448 ceAbstractionStarter]: For program point L19-7(lines 19 23) no Hoare annotation was computed. [2018-12-31 04:07:39,473 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 04:07:39,473 INFO L448 ceAbstractionStarter]: For program point L185-1(lines 185 189) no Hoare annotation was computed. [2018-12-31 04:07:39,473 INFO L444 ceAbstractionStarter]: At program point L185-2(lines 185 189) the Hoare annotation is: false [2018-12-31 04:07:39,473 INFO L448 ceAbstractionStarter]: For program point L185-3(lines 185 189) no Hoare annotation was computed. [2018-12-31 04:07:39,474 INFO L444 ceAbstractionStarter]: At program point L219(lines 211 220) the Hoare annotation is: (let ((.cse10 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))) (let ((.cse5 (= (_ bv1 32) |ULTIMATE.start_isinf_float_#res|)) (.cse0 (= ULTIMATE.start___ieee754_hypotf_~y .cse10)) (.cse8 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0)))) (or (let ((.cse9 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0)))) (and .cse0 (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_26 (_ BitVec 32))) (= ULTIMATE.start___ieee754_hypotf_~hb~0 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_26))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_26 (_ BitVec 32)) (ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32))) (let ((.cse2 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_26)) (.cse1 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0)))) (and (= ULTIMATE.start_isinf_float_~x (fp.add roundNearestTiesToEven .cse1 (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))) (bvsgt (bvadd (bvneg .cse2) ULTIMATE.start___ieee754_hypotf_~ha~0) (_ bv251658240 32)) (= .cse1 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_26 (_ BitVec 32)) (ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32))) (let ((.cse3 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_26)) (.cse4 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0)))) (and (bvsgt (bvadd (bvneg .cse3) ULTIMATE.start___ieee754_hypotf_~ha~0) (_ bv251658240 32)) (= (fp.add roundNearestTiesToEven .cse4 (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) |ULTIMATE.start___ieee754_hypotf_#res|) (= .cse4 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))) .cse5 (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_26 (_ BitVec 32)) (ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32))) (let ((.cse6 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_26)) (.cse7 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0)))) (and (bvsgt (bvadd (bvneg .cse6) ULTIMATE.start___ieee754_hypotf_~ha~0) (_ bv251658240 32)) (= (fp ((_ extract 31 31) ULTIMATE.start_isinf_float_~ix~1) ((_ extract 30 23) ULTIMATE.start_isinf_float_~ix~1) ((_ extract 22 0) ULTIMATE.start_isinf_float_~ix~1)) (fp.add roundNearestTiesToEven .cse7 (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (= .cse7 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))) (= .cse8 ULTIMATE.start___ieee754_hypotf_~b~0) (= .cse9 ULTIMATE.start___ieee754_hypotf_~a~0) (= .cse9 .cse10))) (and (exists ((ULTIMATE.start___ieee754_hypotf_~hb~0 (_ BitVec 32))) (let ((.cse11 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0)))) (and (= .cse11 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) (= (fp ((_ extract 31 31) ULTIMATE.start_isinf_float_~ix~1) ((_ extract 30 23) ULTIMATE.start_isinf_float_~ix~1) ((_ extract 22 0) ULTIMATE.start_isinf_float_~ix~1)) .cse11)))) (exists ((ULTIMATE.start___ieee754_hypotf_~hb~0 (_ BitVec 32))) (let ((.cse12 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0)))) (and (= .cse12 ULTIMATE.start___ieee754_hypotf_~w~0) (= .cse12 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))) .cse5 (exists ((ULTIMATE.start___ieee754_hypotf_~hb~0 (_ BitVec 32))) (let ((.cse13 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0)))) (and (= .cse13 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) (= .cse13 |ULTIMATE.start___ieee754_hypotf_#res|)))) (and .cse0 (= .cse8 .cse10) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_26 (_ BitVec 32))) (= ULTIMATE.start___ieee754_hypotf_~ha~0 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_26)))) (exists ((ULTIMATE.start___ieee754_hypotf_~hb~0 (_ BitVec 32))) (let ((.cse14 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0)))) (and (= .cse14 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) (= ULTIMATE.start_isinf_float_~x .cse14)))) (exists ((ULTIMATE.start___ieee754_hypotf_~hb~0 (_ BitVec 32))) (let ((.cse15 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0)))) (and (= .cse15 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) (= .cse15 ULTIMATE.start___ieee754_hypotf_~b~0)))))))) [2018-12-31 04:07:39,474 INFO L448 ceAbstractionStarter]: For program point L121(lines 121 144) no Hoare annotation was computed. [2018-12-31 04:07:39,474 INFO L448 ceAbstractionStarter]: For program point L121-1(lines 81 208) no Hoare annotation was computed. [2018-12-31 04:07:39,474 INFO L448 ceAbstractionStarter]: For program point L122(lines 122 129) no Hoare annotation was computed. [2018-12-31 04:07:39,475 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 04:07:39,475 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 125) no Hoare annotation was computed. [2018-12-31 04:07:39,475 INFO L448 ceAbstractionStarter]: For program point L91-1(lines 91 95) no Hoare annotation was computed. [2018-12-31 04:07:39,475 INFO L448 ceAbstractionStarter]: For program point L124-2(lines 122 129) no Hoare annotation was computed. [2018-12-31 04:07:39,475 INFO L444 ceAbstractionStarter]: At program point L91-2(lines 91 95) the Hoare annotation is: (and (= ULTIMATE.start___ieee754_hypotf_~y (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_25 (_ BitVec 32))) (= ULTIMATE.start___ieee754_hypotf_~ha~0 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_25))) (exists ((ULTIMATE.start___ieee754_hypotf_~hb~0 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0)))) (and (= .cse0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) (= .cse0 ULTIMATE.start___ieee754_hypotf_~b~0))))) [2018-12-31 04:07:39,475 INFO L448 ceAbstractionStarter]: For program point L91-3(lines 91 95) no Hoare annotation was computed. [2018-12-31 04:07:39,475 INFO L448 ceAbstractionStarter]: For program point L191-1(lines 191 195) no Hoare annotation was computed. [2018-12-31 04:07:39,475 INFO L444 ceAbstractionStarter]: At program point L191-2(lines 191 195) the Hoare annotation is: false [2018-12-31 04:07:39,475 INFO L448 ceAbstractionStarter]: For program point L191-3(lines 191 195) no Hoare annotation was computed. [2018-12-31 04:07:39,476 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 27) no Hoare annotation was computed. [2018-12-31 04:07:39,476 INFO L448 ceAbstractionStarter]: For program point L26-1(lines 26 27) no Hoare annotation was computed. [2018-12-31 04:07:39,476 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 126 127) no Hoare annotation was computed. [2018-12-31 04:07:39,476 INFO L448 ceAbstractionStarter]: For program point L61(lines 61 70) no Hoare annotation was computed. [2018-12-31 04:07:39,476 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 04:07:39,476 INFO L448 ceAbstractionStarter]: For program point L61-1(lines 61 70) no Hoare annotation was computed. [2018-12-31 04:07:39,476 INFO L448 ceAbstractionStarter]: For program point L161-1(lines 161 165) no Hoare annotation was computed. [2018-12-31 04:07:39,476 INFO L444 ceAbstractionStarter]: At program point L161-2(lines 161 165) the Hoare annotation is: false [2018-12-31 04:07:39,476 INFO L448 ceAbstractionStarter]: For program point L29(lines 29 30) no Hoare annotation was computed. [2018-12-31 04:07:39,476 INFO L448 ceAbstractionStarter]: For program point L29-1(lines 29 30) no Hoare annotation was computed. [2018-12-31 04:07:39,476 INFO L448 ceAbstractionStarter]: For program point L63(lines 63 69) no Hoare annotation was computed. [2018-12-31 04:07:39,477 INFO L448 ceAbstractionStarter]: For program point L63-2(lines 63 69) no Hoare annotation was computed. [2018-12-31 04:07:39,477 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 106) no Hoare annotation was computed. [2018-12-31 04:07:39,477 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 32) no Hoare annotation was computed. [2018-12-31 04:07:39,477 INFO L448 ceAbstractionStarter]: For program point L31-1(lines 31 32) no Hoare annotation was computed. [2018-12-31 04:07:39,477 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 68) no Hoare annotation was computed. [2018-12-31 04:07:39,477 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-31 04:07:39,477 INFO L448 ceAbstractionStarter]: For program point L65-3(lines 65 68) no Hoare annotation was computed. [2018-12-31 04:07:39,477 INFO L448 ceAbstractionStarter]: For program point L166(lines 166 170) no Hoare annotation was computed. [2018-12-31 04:07:39,477 INFO L448 ceAbstractionStarter]: For program point L166-1(lines 157 171) no Hoare annotation was computed. [2018-12-31 04:07:39,478 INFO L448 ceAbstractionStarter]: For program point L200-1(lines 200 204) no Hoare annotation was computed. [2018-12-31 04:07:39,478 INFO L444 ceAbstractionStarter]: At program point L200-2(lines 200 204) the Hoare annotation is: false [2018-12-31 04:07:39,478 INFO L448 ceAbstractionStarter]: For program point L134-1(lines 134 138) no Hoare annotation was computed. [2018-12-31 04:07:39,478 INFO L448 ceAbstractionStarter]: For program point L200-3(lines 200 204) no Hoare annotation was computed. [2018-12-31 04:07:39,478 INFO L444 ceAbstractionStarter]: At program point L134-2(lines 134 138) the Hoare annotation is: false [2018-12-31 04:07:39,478 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 39) no Hoare annotation was computed. [2018-12-31 04:07:39,497 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:446) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:105) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:560) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:257) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-12-31 04:07:39,503 INFO L168 Benchmark]: Toolchain (without parser) took 49380.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 215.0 MB). Free memory was 951.4 MB in the beginning and 908.4 MB in the end (delta: 42.9 MB). Peak memory consumption was 257.9 MB. Max. memory is 11.5 GB. [2018-12-31 04:07:39,507 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 04:07:39,508 INFO L168 Benchmark]: CACSL2BoogieTranslator took 632.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -182.3 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. [2018-12-31 04:07:39,509 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 04:07:39,511 INFO L168 Benchmark]: Boogie Preprocessor took 76.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-31 04:07:39,512 INFO L168 Benchmark]: RCFGBuilder took 6897.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 11.5 GB. [2018-12-31 04:07:39,514 INFO L168 Benchmark]: TraceAbstraction took 41692.19 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.7 MB). Free memory was 1.1 GB in the beginning and 908.4 MB in the end (delta: 171.3 MB). Peak memory consumption was 240.0 MB. Max. memory is 11.5 GB. [2018-12-31 04:07:39,519 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.40 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 632.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -182.3 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 76.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 76.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 6897.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 41692.19 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.7 MB). Free memory was 1.1 GB in the beginning and 908.4 MB in the end (delta: 171.3 MB). Peak memory consumption was 240.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 235]: 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 - ExceptionOrErrorResult: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...