./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/float-newlib/float_req_bl_1270a_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f 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_1270a_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 fa333650cb1e4cf3e280683e8b2ad72d19029b0d ......................................................................................................................................................................................................................................................................................................... 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_1270a_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 fa333650cb1e4cf3e280683e8b2ad72d19029b0d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-0ed9222-m [2019-01-12 09:16:37,739 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:16:37,740 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:16:37,756 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:16:37,757 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:16:37,758 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:16:37,759 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:16:37,762 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:16:37,764 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:16:37,767 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:16:37,770 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:16:37,771 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:16:37,772 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:16:37,772 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:16:37,773 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:16:37,774 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:16:37,774 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:16:37,776 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:16:37,778 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:16:37,780 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:16:37,781 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:16:37,782 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:16:37,788 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:16:37,788 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:16:37,788 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:16:37,791 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:16:37,792 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:16:37,792 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:16:37,794 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:16:37,797 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:16:37,799 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:16:37,800 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:16:37,800 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:16:37,800 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:16:37,802 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:16:37,804 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:16:37,806 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 09:16:37,838 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:16:37,839 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:16:37,841 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:16:37,842 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:16:37,842 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:16:37,842 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:16:37,842 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:16:37,843 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 09:16:37,843 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:16:37,843 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:16:37,843 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:16:37,843 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:16:37,843 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:16:37,844 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:16:37,845 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:16:37,846 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:16:37,846 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:16:37,846 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:16:37,846 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:16:37,846 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:16:37,846 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:16:37,847 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:16:37,848 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:16:37,848 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:16:37,849 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:16:37,849 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 09:16:37,849 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:16:37,849 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 09:16:37,849 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 -> fa333650cb1e4cf3e280683e8b2ad72d19029b0d [2019-01-12 09:16:37,908 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:16:37,925 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:16:37,932 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:16:37,933 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:16:37,934 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:16:37,934 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/float_req_bl_1270a_true-unreach-call.c [2019-01-12 09:16:37,997 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58ff7ea08/36c0f6974e3d41ae9a5478f2e0b2aee6/FLAG1719b16aa [2019-01-12 09:16:38,385 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:16:38,388 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/float_req_bl_1270a_true-unreach-call.c [2019-01-12 09:16:38,396 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58ff7ea08/36c0f6974e3d41ae9a5478f2e0b2aee6/FLAG1719b16aa [2019-01-12 09:16:38,748 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58ff7ea08/36c0f6974e3d41ae9a5478f2e0b2aee6 [2019-01-12 09:16:38,751 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:16:38,753 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:16:38,754 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:16:38,754 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:16:38,758 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:16:38,759 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:16:38" (1/1) ... [2019-01-12 09:16:38,762 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6842cce3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:38, skipping insertion in model container [2019-01-12 09:16:38,762 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:16:38" (1/1) ... [2019-01-12 09:16:38,770 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:16:38,799 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:16:39,127 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:16:39,138 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:16:39,207 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:16:39,234 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:16:39,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:39 WrapperNode [2019-01-12 09:16:39,235 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:16:39,236 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:16:39,236 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:16:39,236 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:16:39,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:39" (1/1) ... [2019-01-12 09:16:39,348 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:39" (1/1) ... [2019-01-12 09:16:39,424 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:16:39,424 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:16:39,425 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:16:39,425 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:16:39,438 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:39" (1/1) ... [2019-01-12 09:16:39,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:39" (1/1) ... [2019-01-12 09:16:39,444 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:39" (1/1) ... [2019-01-12 09:16:39,445 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:39" (1/1) ... [2019-01-12 09:16:39,462 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:39" (1/1) ... [2019-01-12 09:16:39,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:39" (1/1) ... [2019-01-12 09:16:39,489 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:39" (1/1) ... [2019-01-12 09:16:39,494 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:16:39,495 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:16:39,495 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:16:39,495 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:16:39,496 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:39" (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 [2019-01-12 09:16:39,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 09:16:39,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-01-12 09:16:39,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-12 09:16:39,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-01-12 09:16:39,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:16:39,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:16:39,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-12 09:16:39,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 09:16:40,821 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:16:40,822 INFO L286 CfgBuilder]: Removed 52 assue(true) statements. [2019-01-12 09:16:40,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:16:40 BoogieIcfgContainer [2019-01-12 09:16:40,824 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:16:40,825 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:16:40,825 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:16:40,829 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:16:40,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:16:38" (1/3) ... [2019-01-12 09:16:40,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b5dc0e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:16:40, skipping insertion in model container [2019-01-12 09:16:40,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:39" (2/3) ... [2019-01-12 09:16:40,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b5dc0e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:16:40, skipping insertion in model container [2019-01-12 09:16:40,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:16:40" (3/3) ... [2019-01-12 09:16:40,833 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1270a_true-unreach-call.c [2019-01-12 09:16:40,842 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:16:40,851 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 09:16:40,868 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 09:16:40,913 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:16:40,914 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:16:40,914 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:16:40,914 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:16:40,914 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:16:40,915 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:16:40,915 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:16:40,915 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:16:40,915 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:16:40,933 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2019-01-12 09:16:40,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 09:16:40,940 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:40,941 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:16:40,944 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:40,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:40,949 INFO L82 PathProgramCache]: Analyzing trace with hash 311741284, now seen corresponding path program 1 times [2019-01-12 09:16:40,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:16:40,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:16:40,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:16:40,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:40,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:16:41,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:41,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:16:41,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:41,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:16:41,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 09:16:41,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 09:16:41,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:16:41,089 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 2 states. [2019-01-12 09:16:41,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:41,122 INFO L93 Difference]: Finished difference Result 212 states and 358 transitions. [2019-01-12 09:16:41,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 09:16:41,123 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-01-12 09:16:41,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:41,135 INFO L225 Difference]: With dead ends: 212 [2019-01-12 09:16:41,136 INFO L226 Difference]: Without dead ends: 104 [2019-01-12 09:16:41,139 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 [2019-01-12 09:16:41,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-12 09:16:41,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-01-12 09:16:41,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-12 09:16:41,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 136 transitions. [2019-01-12 09:16:41,182 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 136 transitions. Word has length 16 [2019-01-12 09:16:41,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:41,183 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 136 transitions. [2019-01-12 09:16:41,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 09:16:41,183 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 136 transitions. [2019-01-12 09:16:41,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-12 09:16:41,184 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:41,184 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] [2019-01-12 09:16:41,185 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:41,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:41,186 INFO L82 PathProgramCache]: Analyzing trace with hash 2055151297, now seen corresponding path program 1 times [2019-01-12 09:16:41,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:16:41,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:16:41,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:16:41,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:41,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:16:41,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:16:41,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:16:41,427 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 09:16:41,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 09:16:41 BoogieIcfgContainer [2019-01-12 09:16:41,475 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 09:16:41,475 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 09:16:41,475 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 09:16:41,476 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 09:16:41,476 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:16:40" (3/4) ... [2019-01-12 09:16:41,483 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-12 09:16:41,483 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 09:16:41,484 INFO L168 Benchmark]: Toolchain (without parser) took 2732.09 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 951.3 MB in the beginning and 997.9 MB in the end (delta: -46.6 MB). Peak memory consumption was 53.0 MB. Max. memory is 11.5 GB. [2019-01-12 09:16:41,487 INFO L168 Benchmark]: CDTParser took 0.14 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. [2019-01-12 09:16:41,488 INFO L168 Benchmark]: CACSL2BoogieTranslator took 481.35 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 935.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-12 09:16:41,489 INFO L168 Benchmark]: Boogie Procedure Inliner took 188.62 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -150.8 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2019-01-12 09:16:41,492 INFO L168 Benchmark]: Boogie Preprocessor took 69.90 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:16:41,494 INFO L168 Benchmark]: RCFGBuilder took 1329.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.7 MB). Peak memory consumption was 53.7 MB. Max. memory is 11.5 GB. [2019-01-12 09:16:41,495 INFO L168 Benchmark]: TraceAbstraction took 649.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. [2019-01-12 09:16:41,496 INFO L168 Benchmark]: Witness Printer took 7.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 997.9 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-01-12 09:16:41,504 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.14 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 481.35 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 935.2 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 188.62 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -150.8 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 69.90 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1329.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.7 MB). Peak memory consumption was 53.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 649.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. * Witness Printer took 7.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 997.9 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 234]: 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 = 1.0f / 0.0f; [L230] float y = __VERIFIER_nondet_float(); [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] [L231] 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] [L233] COND TRUE !isinf_float(res) [L234] __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-0ed9222-m [2019-01-12 09:16:43,704 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:16:43,705 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:16:43,721 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:16:43,721 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:16:43,722 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:16:43,724 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:16:43,725 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:16:43,727 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:16:43,728 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:16:43,729 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:16:43,729 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:16:43,730 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:16:43,731 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:16:43,732 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:16:43,733 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:16:43,734 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:16:43,735 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:16:43,737 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:16:43,739 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:16:43,740 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:16:43,741 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:16:43,744 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:16:43,744 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:16:43,744 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:16:43,745 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:16:43,747 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:16:43,748 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:16:43,749 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:16:43,750 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:16:43,750 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:16:43,751 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:16:43,751 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:16:43,751 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:16:43,753 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:16:43,754 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:16:43,754 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-01-12 09:16:43,778 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:16:43,778 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:16:43,779 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:16:43,780 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:16:43,780 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:16:43,781 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:16:43,781 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:16:43,781 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:16:43,781 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:16:43,781 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:16:43,781 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:16:43,782 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:16:43,782 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-12 09:16:43,782 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-12 09:16:43,782 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:16:43,782 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:16:43,782 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:16:43,783 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:16:43,784 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:16:43,784 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:16:43,785 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:16:43,785 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:16:43,785 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:16:43,785 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:16:43,785 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:16:43,786 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:16:43,787 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-12 09:16:43,787 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:16:43,787 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-12 09:16:43,787 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2019-01-12 09:16:43,787 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 -> fa333650cb1e4cf3e280683e8b2ad72d19029b0d [2019-01-12 09:16:43,836 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:16:43,854 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:16:43,859 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:16:43,861 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:16:43,862 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:16:43,862 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/float_req_bl_1270a_true-unreach-call.c [2019-01-12 09:16:43,938 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d98844fed/0f67f334d4ec4323b79450e2ccf3dc05/FLAG49c77c5c8 [2019-01-12 09:16:44,335 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:16:44,335 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/float_req_bl_1270a_true-unreach-call.c [2019-01-12 09:16:44,344 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d98844fed/0f67f334d4ec4323b79450e2ccf3dc05/FLAG49c77c5c8 [2019-01-12 09:16:44,694 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d98844fed/0f67f334d4ec4323b79450e2ccf3dc05 [2019-01-12 09:16:44,697 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:16:44,698 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:16:44,699 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:16:44,699 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:16:44,703 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:16:44,704 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:16:44" (1/1) ... [2019-01-12 09:16:44,707 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@326cd82e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:44, skipping insertion in model container [2019-01-12 09:16:44,707 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:16:44" (1/1) ... [2019-01-12 09:16:44,716 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:16:44,759 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:16:45,058 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:16:45,066 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:16:45,131 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:16:45,161 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:16:45,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:45 WrapperNode [2019-01-12 09:16:45,161 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:16:45,162 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:16:45,162 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:16:45,162 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:16:45,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:45" (1/1) ... [2019-01-12 09:16:45,261 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:45" (1/1) ... [2019-01-12 09:16:45,314 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:16:45,319 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:16:45,319 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:16:45,319 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:16:45,341 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:45" (1/1) ... [2019-01-12 09:16:45,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:45" (1/1) ... [2019-01-12 09:16:45,357 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:45" (1/1) ... [2019-01-12 09:16:45,362 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:45" (1/1) ... [2019-01-12 09:16:45,401 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:45" (1/1) ... [2019-01-12 09:16:45,425 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:45" (1/1) ... [2019-01-12 09:16:45,431 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:45" (1/1) ... [2019-01-12 09:16:45,446 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:16:45,447 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:16:45,447 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:16:45,447 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:16:45,448 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:45" (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 [2019-01-12 09:16:45,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 09:16:45,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2019-01-12 09:16:45,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-01-12 09:16:45,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:16:45,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:16:45,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2019-01-12 09:16:45,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-01-12 09:16:45,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 09:16:45,932 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:16:46,098 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:16:48,461 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:16:51,558 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:16:51,667 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:16:52,232 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:16:52,233 INFO L286 CfgBuilder]: Removed 52 assue(true) statements. [2019-01-12 09:16:52,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:16:52 BoogieIcfgContainer [2019-01-12 09:16:52,234 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:16:52,235 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:16:52,235 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:16:52,237 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:16:52,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:16:44" (1/3) ... [2019-01-12 09:16:52,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51651373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:16:52, skipping insertion in model container [2019-01-12 09:16:52,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:45" (2/3) ... [2019-01-12 09:16:52,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51651373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:16:52, skipping insertion in model container [2019-01-12 09:16:52,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:16:52" (3/3) ... [2019-01-12 09:16:52,240 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1270a_true-unreach-call.c [2019-01-12 09:16:52,250 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:16:52,257 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 09:16:52,276 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 09:16:52,307 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:16:52,308 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:16:52,308 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:16:52,308 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:16:52,309 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:16:52,309 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:16:52,309 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:16:52,309 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:16:52,309 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:16:52,327 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2019-01-12 09:16:52,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 09:16:52,334 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:52,335 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:16:52,337 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:52,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:52,343 INFO L82 PathProgramCache]: Analyzing trace with hash 311741284, now seen corresponding path program 1 times [2019-01-12 09:16:52,346 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:16:52,347 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 [2019-01-12 09:16:52,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:52,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:16:52,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:16:52,464 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:16:52,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:52,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:16:52,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 09:16:52,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 09:16:52,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:16:52,501 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 2 states. [2019-01-12 09:16:52,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:52,531 INFO L93 Difference]: Finished difference Result 212 states and 358 transitions. [2019-01-12 09:16:52,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 09:16:52,533 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-01-12 09:16:52,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:52,544 INFO L225 Difference]: With dead ends: 212 [2019-01-12 09:16:52,545 INFO L226 Difference]: Without dead ends: 104 [2019-01-12 09:16:52,549 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 [2019-01-12 09:16:52,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-12 09:16:52,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-01-12 09:16:52,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-12 09:16:52,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 136 transitions. [2019-01-12 09:16:52,595 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 136 transitions. Word has length 16 [2019-01-12 09:16:52,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:52,596 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 136 transitions. [2019-01-12 09:16:52,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 09:16:52,596 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 136 transitions. [2019-01-12 09:16:52,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-12 09:16:52,597 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:52,598 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:16:52,598 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:52,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:52,598 INFO L82 PathProgramCache]: Analyzing trace with hash 2055151297, now seen corresponding path program 1 times [2019-01-12 09:16:52,602 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:16:52,602 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) [2019-01-12 09:16:52,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-01-12 09:16:52,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:52,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:16:53,084 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-01-12 09:16:54,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:16:54,536 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:16:54,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:54,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-12 09:16:54,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 09:16:54,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 09:16:54,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-01-12 09:16:54,558 INFO L87 Difference]: Start difference. First operand 104 states and 136 transitions. Second operand 12 states. [2019-01-12 09:16:55,711 WARN L181 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-12 09:16:56,889 WARN L181 SmtUtils]: Spent 683.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-01-12 09:16:59,281 WARN L181 SmtUtils]: Spent 1.72 s on a formula simplification that was a NOOP. DAG size: 53 [2019-01-12 09:17:01,948 WARN L181 SmtUtils]: Spent 1.75 s on a formula simplification that was a NOOP. DAG size: 56 [2019-01-12 09:17:04,178 WARN L181 SmtUtils]: Spent 1.66 s on a formula simplification that was a NOOP. DAG size: 61 [2019-01-12 09:17:09,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:17:09,355 INFO L93 Difference]: Finished difference Result 234 states and 296 transitions. [2019-01-12 09:17:09,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 09:17:09,367 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-01-12 09:17:09,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:17:09,370 INFO L225 Difference]: With dead ends: 234 [2019-01-12 09:17:09,370 INFO L226 Difference]: Without dead ends: 141 [2019-01-12 09:17:09,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2019-01-12 09:17:09,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-01-12 09:17:09,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 112. [2019-01-12 09:17:09,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-12 09:17:09,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 144 transitions. [2019-01-12 09:17:09,400 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 144 transitions. Word has length 21 [2019-01-12 09:17:09,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:17:09,400 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 144 transitions. [2019-01-12 09:17:09,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 09:17:09,406 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 144 transitions. [2019-01-12 09:17:09,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-12 09:17:09,409 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:17:09,409 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] [2019-01-12 09:17:09,409 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:17:09,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:17:09,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1653009985, now seen corresponding path program 1 times [2019-01-12 09:17:09,410 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:17:09,413 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) [2019-01-12 09:17:09,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-01-12 09:17:09,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:17:09,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:17:09,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:17:09,704 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:17:09,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:17:09,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 09:17:09,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 09:17:09,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 09:17:09,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 09:17:09,719 INFO L87 Difference]: Start difference. First operand 112 states and 144 transitions. Second operand 6 states. [2019-01-12 09:17:10,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:17:10,346 INFO L93 Difference]: Finished difference Result 285 states and 366 transitions. [2019-01-12 09:17:10,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 09:17:10,348 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-01-12 09:17:10,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:17:10,351 INFO L225 Difference]: With dead ends: 285 [2019-01-12 09:17:10,351 INFO L226 Difference]: Without dead ends: 204 [2019-01-12 09:17:10,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-01-12 09:17:10,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-01-12 09:17:10,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 114. [2019-01-12 09:17:10,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-12 09:17:10,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 145 transitions. [2019-01-12 09:17:10,394 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 145 transitions. Word has length 21 [2019-01-12 09:17:10,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:17:10,395 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 145 transitions. [2019-01-12 09:17:10,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 09:17:10,395 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 145 transitions. [2019-01-12 09:17:10,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-12 09:17:10,398 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:17:10,398 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] [2019-01-12 09:17:10,398 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:17:10,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:17:10,399 INFO L82 PathProgramCache]: Analyzing trace with hash -558668800, now seen corresponding path program 1 times [2019-01-12 09:17:10,400 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:17:10,400 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 [2019-01-12 09:17:10,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:17:10,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:17:10,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:17:10,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:17:10,675 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:17:10,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:17:10,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-12 09:17:10,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 09:17:10,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 09:17:10,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-01-12 09:17:10,692 INFO L87 Difference]: Start difference. First operand 114 states and 145 transitions. Second operand 10 states. [2019-01-12 09:17:25,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:17:25,194 INFO L93 Difference]: Finished difference Result 203 states and 255 transitions. [2019-01-12 09:17:25,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 09:17:25,241 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-01-12 09:17:25,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:17:25,243 INFO L225 Difference]: With dead ends: 203 [2019-01-12 09:17:25,243 INFO L226 Difference]: Without dead ends: 194 [2019-01-12 09:17:25,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2019-01-12 09:17:25,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-01-12 09:17:25,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 114. [2019-01-12 09:17:25,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-12 09:17:25,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 144 transitions. [2019-01-12 09:17:25,263 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 144 transitions. Word has length 26 [2019-01-12 09:17:25,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:17:25,264 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 144 transitions. [2019-01-12 09:17:25,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 09:17:25,265 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 144 transitions. [2019-01-12 09:17:25,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-12 09:17:25,266 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:17:25,266 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] [2019-01-12 09:17:25,266 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:17:25,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:17:25,266 INFO L82 PathProgramCache]: Analyzing trace with hash 121389570, now seen corresponding path program 1 times [2019-01-12 09:17:25,267 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:17:25,268 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 [2019-01-12 09:17:25,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:17:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:17:25,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:17:25,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:17:25,714 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:17:25,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:17:25,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-12 09:17:25,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 09:17:25,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 09:17:25,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-01-12 09:17:25,726 INFO L87 Difference]: Start difference. First operand 114 states and 144 transitions. Second operand 11 states. [2019-01-12 09:17:33,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:17:33,790 INFO L93 Difference]: Finished difference Result 133 states and 161 transitions. [2019-01-12 09:17:33,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 09:17:33,802 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2019-01-12 09:17:33,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:17:33,804 INFO L225 Difference]: With dead ends: 133 [2019-01-12 09:17:33,804 INFO L226 Difference]: Without dead ends: 115 [2019-01-12 09:17:33,805 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 [2019-01-12 09:17:33,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-12 09:17:33,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 105. [2019-01-12 09:17:33,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-12 09:17:33,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 134 transitions. [2019-01-12 09:17:33,821 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 134 transitions. Word has length 26 [2019-01-12 09:17:33,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:17:33,821 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 134 transitions. [2019-01-12 09:17:33,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 09:17:33,821 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 134 transitions. [2019-01-12 09:17:33,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-12 09:17:33,823 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:17:33,823 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] [2019-01-12 09:17:33,824 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:17:33,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:17:33,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1435475906, now seen corresponding path program 1 times [2019-01-12 09:17:33,825 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:17:33,825 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 [2019-01-12 09:17:33,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:17:33,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:17:33,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:17:34,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:17:34,094 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:17:34,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:17:34,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 09:17:34,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 09:17:34,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 09:17:34,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 09:17:34,106 INFO L87 Difference]: Start difference. First operand 105 states and 134 transitions. Second operand 6 states. [2019-01-12 09:17:34,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:17:34,297 INFO L93 Difference]: Finished difference Result 115 states and 143 transitions. [2019-01-12 09:17:34,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 09:17:34,299 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-01-12 09:17:34,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:17:34,299 INFO L225 Difference]: With dead ends: 115 [2019-01-12 09:17:34,299 INFO L226 Difference]: Without dead ends: 27 [2019-01-12 09:17:34,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-01-12 09:17:34,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-12 09:17:34,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-12 09:17:34,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-12 09:17:34,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 26 transitions. [2019-01-12 09:17:34,312 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 26 transitions. Word has length 26 [2019-01-12 09:17:34,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:17:34,313 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 26 transitions. [2019-01-12 09:17:34,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 09:17:34,313 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2019-01-12 09:17:34,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-12 09:17:34,316 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:17:34,317 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] [2019-01-12 09:17:34,317 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:17:34,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:17:34,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1042448896, now seen corresponding path program 1 times [2019-01-12 09:17:34,318 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:17:34,318 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-01-12 09:17:34,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:17:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:17:34,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:17:34,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:17:34,776 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:17:34,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:17:34,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-12 09:17:34,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 09:17:34,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 09:17:34,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-12 09:17:34,795 INFO L87 Difference]: Start difference. First operand 27 states and 26 transitions. Second operand 12 states. [2019-01-12 09:17:35,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:17:35,754 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2019-01-12 09:17:35,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 09:17:35,754 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-01-12 09:17:35,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:17:35,756 INFO L225 Difference]: With dead ends: 27 [2019-01-12 09:17:35,756 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 09:17:35,757 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 [2019-01-12 09:17:35,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 09:17:35,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 09:17:35,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 09:17:35,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 09:17:35,759 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2019-01-12 09:17:35,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:17:35,759 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 09:17:35,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 09:17:35,759 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 09:17:35,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 09:17:35,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 09:17:36,968 WARN L181 SmtUtils]: Spent 982.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2019-01-12 09:17:41,737 WARN L181 SmtUtils]: Spent 4.77 s on a formula simplification. DAG size of input: 111 DAG size of output: 86 [2019-01-12 09:17:43,893 WARN L181 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 93 DAG size of output: 71 [2019-01-12 09:17:43,928 INFO L448 ceAbstractionStarter]: For program point L35-2(lines 35 39) no Hoare annotation was computed. [2019-01-12 09:17:43,929 INFO L448 ceAbstractionStarter]: For program point L35-3(lines 35 39) no Hoare annotation was computed. [2019-01-12 09:17:43,929 INFO L448 ceAbstractionStarter]: For program point L35-5(lines 35 39) no Hoare annotation was computed. [2019-01-12 09:17:43,929 INFO L448 ceAbstractionStarter]: For program point L234(line 234) no Hoare annotation was computed. [2019-01-12 09:17:43,929 INFO L448 ceAbstractionStarter]: For program point L36-2(lines 36 37) no Hoare annotation was computed. [2019-01-12 09:17:43,930 INFO L444 ceAbstractionStarter]: At program point L36-3(lines 36 37) the Hoare annotation is: false [2019-01-12 09:17:43,930 INFO L448 ceAbstractionStarter]: For program point L36-4(lines 36 37) no Hoare annotation was computed. [2019-01-12 09:17:43,930 INFO L448 ceAbstractionStarter]: For program point L36-7(lines 36 37) no Hoare annotation was computed. [2019-01-12 09:17:43,930 INFO L444 ceAbstractionStarter]: At program point L36-8(lines 36 37) the Hoare annotation is: false [2019-01-12 09:17:43,930 INFO L448 ceAbstractionStarter]: For program point L36-9(lines 36 37) no Hoare annotation was computed. [2019-01-12 09:17:43,930 INFO L451 ceAbstractionStarter]: At program point L237(lines 222 238) the Hoare annotation is: true [2019-01-12 09:17:43,930 INFO L448 ceAbstractionStarter]: For program point L139(lines 139 143) no Hoare annotation was computed. [2019-01-12 09:17:43,930 INFO L448 ceAbstractionStarter]: For program point L139-1(lines 121 144) no Hoare annotation was computed. [2019-01-12 09:17:43,930 INFO L448 ceAbstractionStarter]: For program point L73-1(lines 73 77) no Hoare annotation was computed. [2019-01-12 09:17:43,930 INFO L444 ceAbstractionStarter]: At program point L73-2(lines 73 77) the Hoare annotation is: false [2019-01-12 09:17:43,931 INFO L448 ceAbstractionStarter]: For program point L73-3(lines 73 77) no Hoare annotation was computed. [2019-01-12 09:17:43,931 INFO L448 ceAbstractionStarter]: For program point L73-5(lines 73 77) no Hoare annotation was computed. [2019-01-12 09:17:43,931 INFO L444 ceAbstractionStarter]: At program point L73-6(lines 73 77) the Hoare annotation is: false [2019-01-12 09:17:43,931 INFO L448 ceAbstractionStarter]: For program point L73-7(lines 73 77) no Hoare annotation was computed. [2019-01-12 09:17:43,931 INFO L448 ceAbstractionStarter]: For program point L107(lines 107 111) no Hoare annotation was computed. [2019-01-12 09:17:43,931 INFO L448 ceAbstractionStarter]: For program point L107-1(lines 81 208) no Hoare annotation was computed. [2019-01-12 09:17:43,932 INFO L444 ceAbstractionStarter]: At program point L207(lines 81 208) the Hoare annotation is: (let ((.cse3 (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))) (.cse10 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))) (let ((.cse2 (= (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)) ULTIMATE.start___ieee754_hypotf_~b~0)) (.cse4 (= ULTIMATE.start___ieee754_hypotf_~x .cse10)) (.cse5 (= .cse3 .cse10))) (or (and (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_26 (_ BitVec 32)) (ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32))) (let ((.cse0 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~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 (bvsgt (bvadd (bvneg .cse0) ULTIMATE.start___ieee754_hypotf_~ha~0) (_ bv251658240 32)) (= (fp.add roundNearestTiesToEven .cse1 (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) |ULTIMATE.start___ieee754_hypotf_#res|) (= .cse1 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))) .cse2 (= .cse3 ULTIMATE.start___ieee754_hypotf_~a~0) .cse4 .cse5 (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_26 (_ BitVec 32))) (= ULTIMATE.start___ieee754_hypotf_~hb~0 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_26)))) (let ((.cse6 (fp (_ bv0 1) (_ bv255 8) (_ bv0 23)))) (and (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_29 (_ BitVec 32))) (= ULTIMATE.start___ieee754_hypotf_~hb~0 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_29))) .cse2 .cse4 (= .cse6 ULTIMATE.start___ieee754_hypotf_~w~0) (= .cse6 |ULTIMATE.start___ieee754_hypotf_#res|))) (and (exists ((ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32))) (let ((.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 (= .cse7 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) (= .cse7 |ULTIMATE.start___ieee754_hypotf_#res|)))) .cse4 (exists ((ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32))) (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 (= .cse8 ULTIMATE.start___ieee754_hypotf_~a~0) (= .cse8 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))) (exists ((ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32))) (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 (= .cse9 ULTIMATE.start___ieee754_hypotf_~w~0) (= .cse9 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))) .cse5)))) [2019-01-12 09:17:43,932 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 43) no Hoare annotation was computed. [2019-01-12 09:17:43,932 INFO L448 ceAbstractionStarter]: For program point L42-2(lines 42 43) no Hoare annotation was computed. [2019-01-12 09:17:43,932 INFO L448 ceAbstractionStarter]: For program point L42-3(lines 42 43) no Hoare annotation was computed. [2019-01-12 09:17:43,932 INFO L448 ceAbstractionStarter]: For program point L42-5(lines 42 43) no Hoare annotation was computed. [2019-01-12 09:17:43,932 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 198) no Hoare annotation was computed. [2019-01-12 09:17:43,932 INFO L448 ceAbstractionStarter]: For program point L175-2(lines 81 208) no Hoare annotation was computed. [2019-01-12 09:17:43,932 INFO L448 ceAbstractionStarter]: For program point L176-1(lines 176 180) no Hoare annotation was computed. [2019-01-12 09:17:43,932 INFO L444 ceAbstractionStarter]: At program point L176-2(lines 176 180) the Hoare annotation is: false [2019-01-12 09:17:43,932 INFO L448 ceAbstractionStarter]: For program point L176-3(lines 176 180) no Hoare annotation was computed. [2019-01-12 09:17:43,933 INFO L444 ceAbstractionStarter]: At program point L78(lines 14 79) the Hoare annotation is: false [2019-01-12 09:17:43,933 INFO L444 ceAbstractionStarter]: At program point L78-1(lines 14 79) the Hoare annotation is: false [2019-01-12 09:17:43,933 INFO L448 ceAbstractionStarter]: For program point L145(lines 145 172) no Hoare annotation was computed. [2019-01-12 09:17:43,933 INFO L448 ceAbstractionStarter]: For program point L112(lines 112 116) no Hoare annotation was computed. [2019-01-12 09:17:43,933 INFO L448 ceAbstractionStarter]: For program point L112-1(lines 81 208) no Hoare annotation was computed. [2019-01-12 09:17:43,933 INFO L448 ceAbstractionStarter]: For program point L112-2(lines 81 208) no Hoare annotation was computed. [2019-01-12 09:17:43,933 INFO L448 ceAbstractionStarter]: For program point L146(lines 146 171) no Hoare annotation was computed. [2019-01-12 09:17:43,933 INFO L448 ceAbstractionStarter]: For program point L213-1(lines 213 217) no Hoare annotation was computed. [2019-01-12 09:17:43,934 INFO L444 ceAbstractionStarter]: At program point L213-2(lines 213 217) the Hoare annotation is: (let ((.cse12 (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))) (.cse13 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))) (let ((.cse7 (= (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)) ULTIMATE.start___ieee754_hypotf_~b~0)) (.cse1 (= ULTIMATE.start___ieee754_hypotf_~x .cse13)) (.cse4 (= .cse12 .cse13))) (or (and (exists ((ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32))) (let ((.cse0 (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 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) (= .cse0 |ULTIMATE.start___ieee754_hypotf_#res|)))) .cse1 (exists ((ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32))) (let ((.cse2 (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 ULTIMATE.start___ieee754_hypotf_~a~0) (= .cse2 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))) (exists ((ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32))) (let ((.cse3 (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 (= .cse3 ULTIMATE.start___ieee754_hypotf_~w~0) (= .cse3 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))) .cse4 (exists ((ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32))) (let ((.cse5 (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 (= .cse5 ULTIMATE.start_isinf_float_~x) (= .cse5 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))))))) (let ((.cse6 (fp (_ bv0 1) (_ bv255 8) (_ bv0 23)))) (and (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_29 (_ BitVec 32))) (= ULTIMATE.start___ieee754_hypotf_~hb~0 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_29))) (= ULTIMATE.start_isinf_float_~x .cse6) .cse7 .cse1 (= .cse6 ULTIMATE.start___ieee754_hypotf_~w~0) (= .cse6 |ULTIMATE.start___ieee754_hypotf_#res|))) (and (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_26 (_ BitVec 32)) (ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32))) (let ((.cse8 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_26)) (.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 (bvsgt (bvadd (bvneg .cse8) ULTIMATE.start___ieee754_hypotf_~ha~0) (_ bv251658240 32)) (= (fp.add roundNearestTiesToEven .cse9 (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))) |ULTIMATE.start___ieee754_hypotf_#res|) (= .cse9 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_26 (_ BitVec 32)) (ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32))) (let ((.cse11 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~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 (= (fp.add roundNearestTiesToEven .cse10 (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11))) ULTIMATE.start_isinf_float_~x) (bvsgt (bvadd (bvneg .cse11) ULTIMATE.start___ieee754_hypotf_~ha~0) (_ bv251658240 32)) (= .cse10 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))) .cse7 (= .cse12 ULTIMATE.start___ieee754_hypotf_~a~0) .cse1 .cse4 (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_26 (_ BitVec 32))) (= ULTIMATE.start___ieee754_hypotf_~hb~0 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_26))))))) [2019-01-12 09:17:43,934 INFO L448 ceAbstractionStarter]: For program point L213-3(lines 213 217) no Hoare annotation was computed. [2019-01-12 09:17:43,934 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 171) no Hoare annotation was computed. [2019-01-12 09:17:43,934 INFO L448 ceAbstractionStarter]: For program point L149-1(lines 149 153) no Hoare annotation was computed. [2019-01-12 09:17:43,934 INFO L444 ceAbstractionStarter]: At program point L149-2(lines 149 153) the Hoare annotation is: false [2019-01-12 09:17:43,934 INFO L448 ceAbstractionStarter]: For program point L149-3(lines 149 153) no Hoare annotation was computed. [2019-01-12 09:17:43,934 INFO L444 ceAbstractionStarter]: At program point L50-2(lines 50 59) the Hoare annotation is: false [2019-01-12 09:17:43,935 INFO L448 ceAbstractionStarter]: For program point L50-3(lines 14 79) no Hoare annotation was computed. [2019-01-12 09:17:43,935 INFO L444 ceAbstractionStarter]: At program point L50-6(lines 50 59) the Hoare annotation is: false [2019-01-12 09:17:43,935 INFO L448 ceAbstractionStarter]: For program point L50-7(lines 14 79) no Hoare annotation was computed. [2019-01-12 09:17:43,935 INFO L448 ceAbstractionStarter]: For program point L85-1(lines 85 89) no Hoare annotation was computed. [2019-01-12 09:17:43,935 INFO L448 ceAbstractionStarter]: For program point L52(lines 52 56) no Hoare annotation was computed. [2019-01-12 09:17:43,935 INFO L444 ceAbstractionStarter]: At program point L85-2(lines 85 89) the Hoare annotation is: (and (= ULTIMATE.start___ieee754_hypotf_~x (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) (exists ((ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32))) (let ((.cse0 (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 ULTIMATE.start___ieee754_hypotf_~a~0) (= .cse0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))))))) [2019-01-12 09:17:43,935 INFO L448 ceAbstractionStarter]: For program point L85-3(lines 85 89) no Hoare annotation was computed. [2019-01-12 09:17:43,935 INFO L448 ceAbstractionStarter]: For program point L19-1(lines 19 23) no Hoare annotation was computed. [2019-01-12 09:17:43,935 INFO L448 ceAbstractionStarter]: For program point L52-2(lines 52 56) no Hoare annotation was computed. [2019-01-12 09:17:43,936 INFO L444 ceAbstractionStarter]: At program point L19-2(lines 19 23) the Hoare annotation is: false [2019-01-12 09:17:43,936 INFO L448 ceAbstractionStarter]: For program point L52-3(lines 52 56) no Hoare annotation was computed. [2019-01-12 09:17:43,936 INFO L448 ceAbstractionStarter]: For program point L19-3(lines 19 23) no Hoare annotation was computed. [2019-01-12 09:17:43,936 INFO L448 ceAbstractionStarter]: For program point L52-5(lines 52 56) no Hoare annotation was computed. [2019-01-12 09:17:43,936 INFO L448 ceAbstractionStarter]: For program point L19-5(lines 19 23) no Hoare annotation was computed. [2019-01-12 09:17:43,936 INFO L444 ceAbstractionStarter]: At program point L19-6(lines 19 23) the Hoare annotation is: false [2019-01-12 09:17:43,936 INFO L448 ceAbstractionStarter]: For program point L19-7(lines 19 23) no Hoare annotation was computed. [2019-01-12 09:17:43,936 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 09:17:43,936 INFO L448 ceAbstractionStarter]: For program point L185-1(lines 185 189) no Hoare annotation was computed. [2019-01-12 09:17:43,936 INFO L444 ceAbstractionStarter]: At program point L185-2(lines 185 189) the Hoare annotation is: false [2019-01-12 09:17:43,936 INFO L448 ceAbstractionStarter]: For program point L185-3(lines 185 189) no Hoare annotation was computed. [2019-01-12 09:17:43,937 INFO L444 ceAbstractionStarter]: At program point L219(lines 211 220) the Hoare annotation is: (let ((.cse14 (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))) (.cse17 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))) (let ((.cse1 (= (_ bv1 32) |ULTIMATE.start_isinf_float_#res|)) (.cse9 (= (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)) ULTIMATE.start___ieee754_hypotf_~b~0)) (.cse2 (= ULTIMATE.start___ieee754_hypotf_~x .cse17)) (.cse6 (= .cse14 .cse17))) (or (and (exists ((ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32))) (let ((.cse0 (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 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) (= .cse0 |ULTIMATE.start___ieee754_hypotf_#res|)))) .cse1 .cse2 (exists ((ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32))) (let ((.cse3 (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 (= .cse3 ULTIMATE.start___ieee754_hypotf_~a~0) (= .cse3 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))) (exists ((ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32))) (let ((.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 (= .cse4 (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))) (= .cse4 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))) (exists ((ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32))) (let ((.cse5 (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 (= .cse5 ULTIMATE.start___ieee754_hypotf_~w~0) (= .cse5 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))) .cse6 (exists ((ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32))) (let ((.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 (= .cse7 ULTIMATE.start_isinf_float_~x) (= .cse7 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))))))) (let ((.cse8 (fp (_ bv0 1) (_ bv255 8) (_ bv0 23)))) (and (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_29 (_ BitVec 32))) (= ULTIMATE.start___ieee754_hypotf_~hb~0 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_29))) .cse1 (= ULTIMATE.start_isinf_float_~x .cse8) .cse9 (= (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)) .cse8) .cse2 (= .cse8 ULTIMATE.start___ieee754_hypotf_~w~0) (= .cse8 |ULTIMATE.start___ieee754_hypotf_#res|))) (and .cse1 (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_26 (_ BitVec 32)) (ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32))) (let ((.cse10 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_26)) (.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 (bvsgt (bvadd (bvneg .cse10) ULTIMATE.start___ieee754_hypotf_~ha~0) (_ bv251658240 32)) (= (fp.add roundNearestTiesToEven .cse11 (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))) |ULTIMATE.start___ieee754_hypotf_#res|) (= .cse11 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_26 (_ BitVec 32)) (ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32))) (let ((.cse13 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_26)) (.cse12 (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 (= (fp.add roundNearestTiesToEven .cse12 (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13))) ULTIMATE.start_isinf_float_~x) (bvsgt (bvadd (bvneg .cse13) ULTIMATE.start___ieee754_hypotf_~ha~0) (_ bv251658240 32)) (= .cse12 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))) .cse9 (= .cse14 ULTIMATE.start___ieee754_hypotf_~a~0) .cse2 (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_26 (_ BitVec 32)) (ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32))) (let ((.cse16 (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))) (.cse15 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_26))) (and (bvsgt (bvadd (bvneg .cse15) ULTIMATE.start___ieee754_hypotf_~ha~0) (_ bv251658240 32)) (= .cse16 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) (= (fp.add roundNearestTiesToEven .cse16 (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15))) (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)))))) .cse6 (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_26 (_ BitVec 32))) (= ULTIMATE.start___ieee754_hypotf_~hb~0 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_26))))))) [2019-01-12 09:17:43,937 INFO L448 ceAbstractionStarter]: For program point L121(lines 121 144) no Hoare annotation was computed. [2019-01-12 09:17:43,937 INFO L448 ceAbstractionStarter]: For program point L121-1(lines 81 208) no Hoare annotation was computed. [2019-01-12 09:17:43,938 INFO L448 ceAbstractionStarter]: For program point L122(lines 122 129) no Hoare annotation was computed. [2019-01-12 09:17:43,938 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 09:17:43,938 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 125) no Hoare annotation was computed. [2019-01-12 09:17:43,938 INFO L448 ceAbstractionStarter]: For program point L91-1(lines 91 95) no Hoare annotation was computed. [2019-01-12 09:17:43,938 INFO L448 ceAbstractionStarter]: For program point L124-2(lines 122 129) no Hoare annotation was computed. [2019-01-12 09:17:43,938 INFO L444 ceAbstractionStarter]: At program point L91-2(lines 91 95) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))) (and (= ULTIMATE.start___ieee754_hypotf_~x .cse0) (exists ((ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32))) (let ((.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 (= .cse1 ULTIMATE.start___ieee754_hypotf_~a~0) (= .cse1 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))) (= (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)) .cse0))) [2019-01-12 09:17:43,938 INFO L448 ceAbstractionStarter]: For program point L91-3(lines 91 95) no Hoare annotation was computed. [2019-01-12 09:17:43,938 INFO L448 ceAbstractionStarter]: For program point L191-1(lines 191 195) no Hoare annotation was computed. [2019-01-12 09:17:43,938 INFO L444 ceAbstractionStarter]: At program point L191-2(lines 191 195) the Hoare annotation is: false [2019-01-12 09:17:43,939 INFO L448 ceAbstractionStarter]: For program point L191-3(lines 191 195) no Hoare annotation was computed. [2019-01-12 09:17:43,939 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 27) no Hoare annotation was computed. [2019-01-12 09:17:43,939 INFO L448 ceAbstractionStarter]: For program point L26-1(lines 26 27) no Hoare annotation was computed. [2019-01-12 09:17:43,939 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 126 127) no Hoare annotation was computed. [2019-01-12 09:17:43,939 INFO L448 ceAbstractionStarter]: For program point L61(lines 61 70) no Hoare annotation was computed. [2019-01-12 09:17:43,939 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 09:17:43,939 INFO L448 ceAbstractionStarter]: For program point L61-1(lines 61 70) no Hoare annotation was computed. [2019-01-12 09:17:43,939 INFO L448 ceAbstractionStarter]: For program point L161-1(lines 161 165) no Hoare annotation was computed. [2019-01-12 09:17:43,939 INFO L444 ceAbstractionStarter]: At program point L161-2(lines 161 165) the Hoare annotation is: false [2019-01-12 09:17:43,939 INFO L448 ceAbstractionStarter]: For program point L29(lines 29 30) no Hoare annotation was computed. [2019-01-12 09:17:43,940 INFO L448 ceAbstractionStarter]: For program point L29-1(lines 29 30) no Hoare annotation was computed. [2019-01-12 09:17:43,940 INFO L448 ceAbstractionStarter]: For program point L63(lines 63 69) no Hoare annotation was computed. [2019-01-12 09:17:43,940 INFO L448 ceAbstractionStarter]: For program point L63-2(lines 63 69) no Hoare annotation was computed. [2019-01-12 09:17:43,940 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 106) no Hoare annotation was computed. [2019-01-12 09:17:43,940 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 32) no Hoare annotation was computed. [2019-01-12 09:17:43,940 INFO L448 ceAbstractionStarter]: For program point L31-1(lines 31 32) no Hoare annotation was computed. [2019-01-12 09:17:43,940 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 68) no Hoare annotation was computed. [2019-01-12 09:17:43,940 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 09:17:43,941 INFO L448 ceAbstractionStarter]: For program point L65-3(lines 65 68) no Hoare annotation was computed. [2019-01-12 09:17:43,941 INFO L448 ceAbstractionStarter]: For program point L166(lines 166 170) no Hoare annotation was computed. [2019-01-12 09:17:43,941 INFO L448 ceAbstractionStarter]: For program point L166-1(lines 157 171) no Hoare annotation was computed. [2019-01-12 09:17:43,941 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 234) no Hoare annotation was computed. [2019-01-12 09:17:43,941 INFO L448 ceAbstractionStarter]: For program point L233(lines 233 236) no Hoare annotation was computed. [2019-01-12 09:17:43,941 INFO L448 ceAbstractionStarter]: For program point L200-1(lines 200 204) no Hoare annotation was computed. [2019-01-12 09:17:43,941 INFO L444 ceAbstractionStarter]: At program point L200-2(lines 200 204) the Hoare annotation is: false [2019-01-12 09:17:43,942 INFO L448 ceAbstractionStarter]: For program point L134-1(lines 134 138) no Hoare annotation was computed. [2019-01-12 09:17:43,942 INFO L448 ceAbstractionStarter]: For program point L200-3(lines 200 204) no Hoare annotation was computed. [2019-01-12 09:17:43,942 INFO L444 ceAbstractionStarter]: At program point L134-2(lines 134 138) the Hoare annotation is: false [2019-01-12 09:17:43,942 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 39) no Hoare annotation was computed. [2019-01-12 09:17:43,950 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) [2019-01-12 09:17:43,956 INFO L168 Benchmark]: Toolchain (without parser) took 59258.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 202.4 MB). Free memory was 947.3 MB in the beginning and 867.2 MB in the end (delta: 80.1 MB). Peak memory consumption was 282.5 MB. Max. memory is 11.5 GB. [2019-01-12 09:17:43,965 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:17:43,966 INFO L168 Benchmark]: CACSL2BoogieTranslator took 462.45 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 931.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-12 09:17:43,969 INFO L168 Benchmark]: Boogie Procedure Inliner took 156.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -201.4 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-01-12 09:17:43,970 INFO L168 Benchmark]: Boogie Preprocessor took 127.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. [2019-01-12 09:17:43,971 INFO L168 Benchmark]: RCFGBuilder took 6786.93 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.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 11.5 GB. [2019-01-12 09:17:43,975 INFO L168 Benchmark]: TraceAbstraction took 51720.63 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 58.7 MB). Free memory was 1.1 GB in the beginning and 867.2 MB in the end (delta: 213.4 MB). Peak memory consumption was 272.1 MB. Max. memory is 11.5 GB. [2019-01-12 09:17:43,981 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 462.45 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 931.2 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 156.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -201.4 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 127.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 6786.93 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.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 51720.63 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 58.7 MB). Free memory was 1.1 GB in the beginning and 867.2 MB in the end (delta: 213.4 MB). Peak memory consumption was 272.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 234]: 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...