./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/float-newlib/double_req_bl_1232a_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/double_req_bl_1232a_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 4284cb37841cd94fe17da64cc250a8a1e69c6375 ....................................................................................................................................................................................................................................................................................................................................................... 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/double_req_bl_1232a_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 4284cb37841cd94fe17da64cc250a8a1e69c6375 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 09:09:03,763 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:09:03,765 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:09:03,782 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:09:03,782 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:09:03,783 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:09:03,786 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:09:03,788 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:09:03,791 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:09:03,793 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:09:03,795 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:09:03,796 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:09:03,797 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:09:03,799 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:09:03,802 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:09:03,803 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:09:03,804 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:09:03,807 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:09:03,817 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:09:03,820 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:09:03,822 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:09:03,823 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:09:03,826 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:09:03,828 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:09:03,828 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:09:03,829 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:09:03,830 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:09:03,831 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:09:03,831 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:09:03,834 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:09:03,835 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:09:03,835 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:09:03,836 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:09:03,837 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:09:03,838 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:09:03,838 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:09:03,839 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:09:03,865 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:09:03,865 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:09:03,867 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:09:03,867 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:09:03,868 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:09:03,868 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:09:03,868 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:09:03,869 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 09:09:03,869 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:09:03,869 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:09:03,869 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:09:03,869 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:09:03,869 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:09:03,870 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:09:03,870 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:09:03,870 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:09:03,870 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:09:03,870 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:09:03,870 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:09:03,871 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:09:03,872 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:09:03,872 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:09:03,872 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:09:03,872 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:09:03,873 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:09:03,873 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 09:09:03,873 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:09:03,873 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 09:09:03,873 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 -> 4284cb37841cd94fe17da64cc250a8a1e69c6375 [2019-01-12 09:09:03,928 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:09:03,940 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:09:03,944 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:09:03,946 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:09:03,946 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:09:03,947 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_1232a_true-unreach-call.c [2019-01-12 09:09:04,004 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f42f2a0a9/2ce959d6d13243569474119659cca6b5/FLAG63e761fbf [2019-01-12 09:09:04,458 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:09:04,459 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_1232a_true-unreach-call.c [2019-01-12 09:09:04,467 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f42f2a0a9/2ce959d6d13243569474119659cca6b5/FLAG63e761fbf [2019-01-12 09:09:04,805 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f42f2a0a9/2ce959d6d13243569474119659cca6b5 [2019-01-12 09:09:04,810 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:09:04,811 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:09:04,813 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:09:04,813 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:09:04,817 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:09:04,818 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:09:04" (1/1) ... [2019-01-12 09:09:04,822 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d054b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:09:04, skipping insertion in model container [2019-01-12 09:09:04,822 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:09:04" (1/1) ... [2019-01-12 09:09:04,831 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:09:04,856 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:09:05,119 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:09:05,124 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:09:05,162 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:09:05,190 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:09:05,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:09:05 WrapperNode [2019-01-12 09:09:05,192 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:09:05,193 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:09:05,193 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:09:05,193 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:09:05,203 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:09:05" (1/1) ... [2019-01-12 09:09:05,221 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:09:05" (1/1) ... [2019-01-12 09:09:05,252 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:09:05,253 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:09:05,253 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:09:05,253 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:09:05,325 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:09:05" (1/1) ... [2019-01-12 09:09:05,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:09:05" (1/1) ... [2019-01-12 09:09:05,329 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:09:05" (1/1) ... [2019-01-12 09:09:05,330 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:09:05" (1/1) ... [2019-01-12 09:09:05,339 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:09:05" (1/1) ... [2019-01-12 09:09:05,350 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:09:05" (1/1) ... [2019-01-12 09:09:05,354 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:09:05" (1/1) ... [2019-01-12 09:09:05,360 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:09:05,361 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:09:05,361 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:09:05,361 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:09:05,365 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:09:05" (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:09:05,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 09:09:05,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-01-12 09:09:05,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:09:05,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:09:05,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-12 09:09:05,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 09:09:05,970 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:09:05,971 INFO L286 CfgBuilder]: Removed 18 assue(true) statements. [2019-01-12 09:09:05,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:09:05 BoogieIcfgContainer [2019-01-12 09:09:05,973 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:09:05,973 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:09:05,974 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:09:05,977 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:09:05,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:09:04" (1/3) ... [2019-01-12 09:09:05,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69ab548b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:09:05, skipping insertion in model container [2019-01-12 09:09:05,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:09:05" (2/3) ... [2019-01-12 09:09:05,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69ab548b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:09:05, skipping insertion in model container [2019-01-12 09:09:05,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:09:05" (3/3) ... [2019-01-12 09:09:05,982 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1232a_true-unreach-call.c [2019-01-12 09:09:05,993 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:09:06,001 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 09:09:06,019 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 09:09:06,059 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:09:06,059 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:09:06,060 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:09:06,060 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:09:06,060 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:09:06,060 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:09:06,060 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:09:06,061 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:09:06,061 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:09:06,080 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-01-12 09:09:06,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 09:09:06,091 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:09:06,092 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:09:06,096 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:09:06,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:09:06,105 INFO L82 PathProgramCache]: Analyzing trace with hash -958075201, now seen corresponding path program 1 times [2019-01-12 09:09:06,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:09:06,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:09:06,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:09:06,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:09:06,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:09:06,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:09:06,226 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:09:06,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:09:06,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:09:06,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 09:09:06,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 09:09:06,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:09:06,248 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-01-12 09:09:06,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:09:06,268 INFO L93 Difference]: Finished difference Result 62 states and 98 transitions. [2019-01-12 09:09:06,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 09:09:06,269 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-01-12 09:09:06,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:09:06,280 INFO L225 Difference]: With dead ends: 62 [2019-01-12 09:09:06,281 INFO L226 Difference]: Without dead ends: 29 [2019-01-12 09:09:06,284 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:09:06,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-12 09:09:06,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-12 09:09:06,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-12 09:09:06,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2019-01-12 09:09:06,319 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 10 [2019-01-12 09:09:06,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:09:06,320 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2019-01-12 09:09:06,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 09:09:06,320 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2019-01-12 09:09:06,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-12 09:09:06,321 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:09:06,321 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:09:06,321 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:09:06,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:09:06,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1001584898, now seen corresponding path program 1 times [2019-01-12 09:09:06,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:09:06,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:09:06,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:09:06,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:09:06,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:09:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:09:06,417 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:09:06,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:09:06,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:09:06,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:09:06,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:09:06,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:09:06,421 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 4 states. [2019-01-12 09:09:06,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:09:06,630 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2019-01-12 09:09:06,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:09:06,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-01-12 09:09:06,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:09:06,631 INFO L225 Difference]: With dead ends: 53 [2019-01-12 09:09:06,632 INFO L226 Difference]: Without dead ends: 44 [2019-01-12 09:09:06,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:09:06,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-12 09:09:06,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2019-01-12 09:09:06,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-12 09:09:06,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-01-12 09:09:06,642 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 11 [2019-01-12 09:09:06,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:09:06,642 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-01-12 09:09:06,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:09:06,642 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2019-01-12 09:09:06,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-12 09:09:06,646 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:09:06,646 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:09:06,646 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:09:06,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:09:06,647 INFO L82 PathProgramCache]: Analyzing trace with hash -555760345, now seen corresponding path program 1 times [2019-01-12 09:09:06,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:09:06,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:09:06,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:09:06,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:09:06,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:09:06,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:09:06,818 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:09:06,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:09:06,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:09:06,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:09:06,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:09:06,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:09:06,820 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 4 states. [2019-01-12 09:09:06,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:09:06,984 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2019-01-12 09:09:06,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:09:06,985 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-01-12 09:09:06,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:09:06,986 INFO L225 Difference]: With dead ends: 55 [2019-01-12 09:09:06,986 INFO L226 Difference]: Without dead ends: 46 [2019-01-12 09:09:06,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:09:06,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-12 09:09:06,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2019-01-12 09:09:06,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-12 09:09:06,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-01-12 09:09:06,993 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 14 [2019-01-12 09:09:06,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:09:06,993 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-01-12 09:09:06,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:09:06,994 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2019-01-12 09:09:06,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-12 09:09:06,995 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:09:06,995 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:09:06,995 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:09:06,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:09:06,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1219247017, now seen corresponding path program 1 times [2019-01-12 09:09:06,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:09:06,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:09:06,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:09:06,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:09:06,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:09:07,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:09:07,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:09:07,063 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 09:09:07,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 09:09:07 BoogieIcfgContainer [2019-01-12 09:09:07,089 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 09:09:07,090 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 09:09:07,090 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 09:09:07,090 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 09:09:07,091 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:09:05" (3/4) ... [2019-01-12 09:09:07,094 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-12 09:09:07,094 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 09:09:07,095 INFO L168 Benchmark]: Toolchain (without parser) took 2284.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -107.4 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2019-01-12 09:09:07,097 INFO L168 Benchmark]: CDTParser took 0.18 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:09:07,097 INFO L168 Benchmark]: CACSL2BoogieTranslator took 379.72 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 932.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 09:09:07,098 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.63 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-12 09:09:07,099 INFO L168 Benchmark]: Boogie Preprocessor took 107.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 927.2 MB in the beginning and 1.1 GB in the end (delta: -187.9 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-12 09:09:07,100 INFO L168 Benchmark]: RCFGBuilder took 611.86 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: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-01-12 09:09:07,101 INFO L168 Benchmark]: TraceAbstraction took 1115.86 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: 40.0 MB). Peak memory consumption was 40.0 MB. Max. memory is 11.5 GB. [2019-01-12 09:09:07,102 INFO L168 Benchmark]: Witness Printer took 4.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:09:07,107 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.18 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 379.72 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 932.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.63 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 107.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 927.2 MB in the beginning and 1.1 GB in the end (delta: -187.9 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 611.86 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: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1115.86 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: 40.0 MB). Peak memory consumption was 40.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 80]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someUnaryDOUBLEoperation at line 75. Possible FailurePath: [L74] double x = 0.0; [L75] double y = -0.0; [L19] __uint32_t msw, lsw; [L22] ieee_double_shape_type ew_u; [L23] ew_u.value = (x) [L24] EXPR ew_u.parts.msw [L24] (msw) = ew_u.parts.msw [L25] EXPR ew_u.parts.lsw [L25] (lsw) = ew_u.parts.lsw [L28-L29] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) [L31-L32] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) [L34-L35] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) [L38-L39] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L42] return 0; [L46] COND TRUE __fpclassify_double(x) == 0 [L47] return y; [L76] double res = fmin_double(x, y); [L79] EXPR res == -0.0 && __signbit_double(res) == 1 [L79] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L80] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 1 error locations. UNSAFE Result, 1.0s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 135 SDtfs, 32 SDslu, 140 SDs, 0 SdLazy, 30 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 28 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 32 ConstructedInterpolants, 0 QuantifiedInterpolants, 442 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-0ed9222-m [2019-01-12 09:09:09,323 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:09:09,325 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:09:09,340 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:09:09,340 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:09:09,342 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:09:09,343 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:09:09,345 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:09:09,346 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:09:09,348 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:09:09,348 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:09:09,349 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:09:09,350 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:09:09,351 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:09:09,352 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:09:09,353 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:09:09,354 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:09:09,356 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:09:09,358 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:09:09,360 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:09:09,361 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:09:09,362 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:09:09,370 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:09:09,370 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:09:09,370 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:09:09,371 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:09:09,373 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:09:09,373 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:09:09,374 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:09:09,378 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:09:09,380 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:09:09,381 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:09:09,381 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:09:09,381 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:09:09,385 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:09:09,385 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:09:09,386 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:09:09,422 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:09:09,422 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:09:09,424 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:09:09,424 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:09:09,424 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:09:09,424 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:09:09,424 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:09:09,425 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:09:09,427 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:09:09,427 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:09:09,427 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:09:09,427 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:09:09,427 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-12 09:09:09,427 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-12 09:09:09,428 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:09:09,429 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:09:09,429 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:09:09,429 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:09:09,429 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:09:09,429 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:09:09,430 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:09:09,432 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:09:09,433 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:09:09,433 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:09:09,433 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:09:09,433 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:09:09,433 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-12 09:09:09,433 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:09:09,434 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-12 09:09:09,434 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2019-01-12 09:09:09,434 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 -> 4284cb37841cd94fe17da64cc250a8a1e69c6375 [2019-01-12 09:09:09,496 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:09:09,509 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:09:09,516 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:09:09,519 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:09:09,520 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:09:09,520 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_1232a_true-unreach-call.c [2019-01-12 09:09:09,584 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54696232c/9aba6248849e45b0a812b29738b8b423/FLAG296405547 [2019-01-12 09:09:10,054 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:09:10,055 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_1232a_true-unreach-call.c [2019-01-12 09:09:10,063 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54696232c/9aba6248849e45b0a812b29738b8b423/FLAG296405547 [2019-01-12 09:09:10,406 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54696232c/9aba6248849e45b0a812b29738b8b423 [2019-01-12 09:09:10,409 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:09:10,411 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:09:10,411 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:09:10,412 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:09:10,416 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:09:10,416 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:09:10" (1/1) ... [2019-01-12 09:09:10,420 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5492b8b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:09:10, skipping insertion in model container [2019-01-12 09:09:10,420 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:09:10" (1/1) ... [2019-01-12 09:09:10,428 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:09:10,452 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:09:10,706 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:09:10,716 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:09:10,762 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:09:10,801 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:09:10,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:09:10 WrapperNode [2019-01-12 09:09:10,802 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:09:10,803 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:09:10,803 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:09:10,803 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:09:10,812 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:09:10" (1/1) ... [2019-01-12 09:09:10,824 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:09:10" (1/1) ... [2019-01-12 09:09:10,851 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:09:10,852 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:09:10,852 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:09:10,852 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:09:10,928 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:09:10" (1/1) ... [2019-01-12 09:09:10,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:09:10" (1/1) ... [2019-01-12 09:09:10,935 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:09:10" (1/1) ... [2019-01-12 09:09:10,935 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:09:10" (1/1) ... [2019-01-12 09:09:10,948 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:09:10" (1/1) ... [2019-01-12 09:09:10,959 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:09:10" (1/1) ... [2019-01-12 09:09:10,964 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:09:10" (1/1) ... [2019-01-12 09:09:10,975 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:09:10,977 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:09:10,977 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:09:10,978 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:09:10,982 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:09:10" (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:09:11,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-01-12 09:09:11,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 09:09:11,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-01-12 09:09:11,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:09:11,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:09:11,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 09:09:11,401 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:09:11,638 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:09:11,784 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:09:11,840 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:09:11,841 INFO L286 CfgBuilder]: Removed 18 assue(true) statements. [2019-01-12 09:09:11,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:09:11 BoogieIcfgContainer [2019-01-12 09:09:11,842 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:09:11,843 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:09:11,843 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:09:11,847 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:09:11,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:09:10" (1/3) ... [2019-01-12 09:09:11,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7859df08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:09:11, skipping insertion in model container [2019-01-12 09:09:11,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:09:10" (2/3) ... [2019-01-12 09:09:11,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7859df08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:09:11, skipping insertion in model container [2019-01-12 09:09:11,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:09:11" (3/3) ... [2019-01-12 09:09:11,852 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1232a_true-unreach-call.c [2019-01-12 09:09:11,863 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:09:11,872 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 09:09:11,888 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 09:09:11,915 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:09:11,915 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:09:11,916 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:09:11,916 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:09:11,916 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:09:11,916 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:09:11,916 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:09:11,917 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:09:11,917 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:09:11,930 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-01-12 09:09:11,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 09:09:11,938 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:09:11,939 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:09:11,942 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:09:11,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:09:11,948 INFO L82 PathProgramCache]: Analyzing trace with hash -958075201, now seen corresponding path program 1 times [2019-01-12 09:09:11,951 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:09:11,952 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:09:11,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:09:12,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:09:12,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:09:12,035 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:09:12,036 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:09:12,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:09:12,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:09:12,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 09:09:12,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 09:09:12,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:09:12,067 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-01-12 09:09:12,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:09:12,090 INFO L93 Difference]: Finished difference Result 62 states and 98 transitions. [2019-01-12 09:09:12,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 09:09:12,093 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-01-12 09:09:12,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:09:12,103 INFO L225 Difference]: With dead ends: 62 [2019-01-12 09:09:12,103 INFO L226 Difference]: Without dead ends: 29 [2019-01-12 09:09:12,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 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:09:12,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-12 09:09:12,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-12 09:09:12,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-12 09:09:12,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2019-01-12 09:09:12,140 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 10 [2019-01-12 09:09:12,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:09:12,141 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2019-01-12 09:09:12,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 09:09:12,141 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2019-01-12 09:09:12,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-12 09:09:12,142 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:09:12,142 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:09:12,142 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:09:12,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:09:12,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1001584898, now seen corresponding path program 1 times [2019-01-12 09:09:12,144 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:09:12,145 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:09:12,155 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:09:12,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:09:12,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:09:12,295 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:09:12,295 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:09:12,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:09:12,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:09:12,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:09:12,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:09:12,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:09:12,310 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 4 states. [2019-01-12 09:09:12,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:09:12,682 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2019-01-12 09:09:12,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:09:12,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-01-12 09:09:12,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:09:12,684 INFO L225 Difference]: With dead ends: 53 [2019-01-12 09:09:12,684 INFO L226 Difference]: Without dead ends: 44 [2019-01-12 09:09:12,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:09:12,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-12 09:09:12,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2019-01-12 09:09:12,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-12 09:09:12,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-01-12 09:09:12,693 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 11 [2019-01-12 09:09:12,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:09:12,694 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-01-12 09:09:12,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:09:12,694 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2019-01-12 09:09:12,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-12 09:09:12,695 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:09:12,695 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:09:12,695 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:09:12,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:09:12,696 INFO L82 PathProgramCache]: Analyzing trace with hash 502201410, now seen corresponding path program 1 times [2019-01-12 09:09:12,697 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:09:12,697 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-01-12 09:09:12,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:09:12,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:09:12,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:09:12,881 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:09:12,881 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:09:12,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:09:12,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:09:12,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:09:12,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:09:12,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:09:12,902 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 4 states. [2019-01-12 09:09:13,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:09:13,154 INFO L93 Difference]: Finished difference Result 61 states and 79 transitions. [2019-01-12 09:09:13,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:09:13,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-01-12 09:09:13,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:09:13,156 INFO L225 Difference]: With dead ends: 61 [2019-01-12 09:09:13,156 INFO L226 Difference]: Without dead ends: 39 [2019-01-12 09:09:13,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:09:13,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-12 09:09:13,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2019-01-12 09:09:13,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-12 09:09:13,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2019-01-12 09:09:13,165 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 12 [2019-01-12 09:09:13,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:09:13,165 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2019-01-12 09:09:13,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:09:13,166 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2019-01-12 09:09:13,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-12 09:09:13,166 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:09:13,167 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:09:13,167 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:09:13,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:09:13,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1951233721, now seen corresponding path program 1 times [2019-01-12 09:09:13,168 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:09:13,169 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:09:13,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:09:13,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:09:13,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:09:13,247 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:09:13,248 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:09:13,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:09:13,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:09:13,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:09:13,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:09:13,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:09:13,259 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand 4 states. [2019-01-12 09:09:13,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:09:13,369 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2019-01-12 09:09:13,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:09:13,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-01-12 09:09:13,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:09:13,372 INFO L225 Difference]: With dead ends: 52 [2019-01-12 09:09:13,372 INFO L226 Difference]: Without dead ends: 43 [2019-01-12 09:09:13,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:09:13,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-12 09:09:13,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2019-01-12 09:09:13,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-12 09:09:13,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-01-12 09:09:13,379 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 13 [2019-01-12 09:09:13,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:09:13,379 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-01-12 09:09:13,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:09:13,380 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2019-01-12 09:09:13,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 09:09:13,380 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:09:13,380 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:09:13,382 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:09:13,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:09:13,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1012446717, now seen corresponding path program 1 times [2019-01-12 09:09:13,383 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:09:13,383 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:09:13,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:09:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:09:13,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:09:13,489 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:09:13,489 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:09:13,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:09:13,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:09:13,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:09:13,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:09:13,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:09:13,501 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 4 states. [2019-01-12 09:09:13,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:09:13,602 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2019-01-12 09:09:13,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:09:13,604 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-01-12 09:09:13,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:09:13,605 INFO L225 Difference]: With dead ends: 52 [2019-01-12 09:09:13,605 INFO L226 Difference]: Without dead ends: 43 [2019-01-12 09:09:13,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:09:13,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-12 09:09:13,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2019-01-12 09:09:13,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-12 09:09:13,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-01-12 09:09:13,613 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 16 [2019-01-12 09:09:13,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:09:13,613 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-01-12 09:09:13,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:09:13,614 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2019-01-12 09:09:13,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 09:09:13,614 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:09:13,614 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:09:13,615 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:09:13,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:09:13,615 INFO L82 PathProgramCache]: Analyzing trace with hash 874935118, now seen corresponding path program 1 times [2019-01-12 09:09:13,616 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:09:13,617 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:09:13,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:09:13,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:09:13,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:09:13,996 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:09:13,996 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:09:14,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:09:14,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 09:09:14,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 09:09:14,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 09:09:14,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:09:14,014 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2019-01-12 09:09:14,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:09:14,440 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2019-01-12 09:09:14,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 09:09:14,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-01-12 09:09:14,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:09:14,443 INFO L225 Difference]: With dead ends: 43 [2019-01-12 09:09:14,443 INFO L226 Difference]: Without dead ends: 29 [2019-01-12 09:09:14,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 09:09:14,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-12 09:09:14,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-12 09:09:14,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-12 09:09:14,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-01-12 09:09:14,452 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 17 [2019-01-12 09:09:14,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:09:14,452 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-01-12 09:09:14,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 09:09:14,453 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-01-12 09:09:14,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 09:09:14,455 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:09:14,455 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:09:14,455 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:09:14,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:09:14,456 INFO L82 PathProgramCache]: Analyzing trace with hash -414082333, now seen corresponding path program 1 times [2019-01-12 09:09:14,457 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:09:14,457 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:09:14,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:09:14,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:09:14,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:09:14,605 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:09:14,605 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:09:14,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:09:14,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 09:09:14,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 09:09:14,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 09:09:14,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:09:14,626 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 3 states. [2019-01-12 09:09:14,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:09:14,664 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2019-01-12 09:09:14,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 09:09:14,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-01-12 09:09:14,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:09:14,666 INFO L225 Difference]: With dead ends: 39 [2019-01-12 09:09:14,667 INFO L226 Difference]: Without dead ends: 29 [2019-01-12 09:09:14,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:09:14,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-12 09:09:14,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-12 09:09:14,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-12 09:09:14,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-01-12 09:09:14,682 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 18 [2019-01-12 09:09:14,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:09:14,682 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-01-12 09:09:14,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 09:09:14,682 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-01-12 09:09:14,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 09:09:14,684 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:09:14,684 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:09:14,685 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:09:14,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:09:14,685 INFO L82 PathProgramCache]: Analyzing trace with hash -356824031, now seen corresponding path program 1 times [2019-01-12 09:09:14,685 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:09:14,685 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-01-12 09:09:14,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:09:14,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:09:14,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:09:14,903 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:09:14,903 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:09:14,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:09:14,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 09:09:14,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 09:09:14,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 09:09:14,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 09:09:14,916 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 6 states. [2019-01-12 09:09:15,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:09:15,162 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2019-01-12 09:09:15,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 09:09:15,163 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-01-12 09:09:15,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:09:15,164 INFO L225 Difference]: With dead ends: 41 [2019-01-12 09:09:15,164 INFO L226 Difference]: Without dead ends: 38 [2019-01-12 09:09:15,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-01-12 09:09:15,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-12 09:09:15,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2019-01-12 09:09:15,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-12 09:09:15,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-01-12 09:09:15,173 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 18 [2019-01-12 09:09:15,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:09:15,173 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-01-12 09:09:15,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 09:09:15,173 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2019-01-12 09:09:15,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 09:09:15,174 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:09:15,174 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:09:15,175 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:09:15,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:09:15,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1049593954, now seen corresponding path program 1 times [2019-01-12 09:09:15,175 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:09:15,176 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-01-12 09:09:15,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:09:15,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:09:15,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:09:15,276 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:09:15,276 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:09:15,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:09:15,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:09:15,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:09:15,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:09:15,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:09:15,289 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 4 states. [2019-01-12 09:09:15,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:09:15,356 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-01-12 09:09:15,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:09:15,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-01-12 09:09:15,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:09:15,357 INFO L225 Difference]: With dead ends: 51 [2019-01-12 09:09:15,358 INFO L226 Difference]: Without dead ends: 42 [2019-01-12 09:09:15,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:09:15,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-12 09:09:15,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 27. [2019-01-12 09:09:15,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-12 09:09:15,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-01-12 09:09:15,366 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 18 [2019-01-12 09:09:15,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:09:15,366 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-01-12 09:09:15,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:09:15,367 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-01-12 09:09:15,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 09:09:15,367 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:09:15,368 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] [2019-01-12 09:09:15,369 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:09:15,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:09:15,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1524231306, now seen corresponding path program 1 times [2019-01-12 09:09:15,370 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:09:15,370 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2019-01-12 09:09:15,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-01-12 09:09:15,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:09:15,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:09:15,631 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:09:15,631 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:09:15,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:09:15,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-12 09:09:15,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 09:09:15,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 09:09:15,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-01-12 09:09:15,652 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 10 states. [2019-01-12 09:09:16,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:09:16,179 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-01-12 09:09:16,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 09:09:16,180 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-01-12 09:09:16,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:09:16,181 INFO L225 Difference]: With dead ends: 27 [2019-01-12 09:09:16,181 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 09:09:16,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-01-12 09:09:16,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 09:09:16,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 09:09:16,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 09:09:16,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 09:09:16,183 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-01-12 09:09:16,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:09:16,184 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 09:09:16,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 09:09:16,184 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 09:09:16,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 09:09:16,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 09:09:16,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 09:09:16,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 09:09:16,401 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-12 09:09:16,675 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-12 09:09:16,905 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-01-12 09:09:16,908 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 09:09:16,908 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 09:09:16,908 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2019-01-12 09:09:16,908 INFO L448 ceAbstractionStarter]: For program point L21-1(lines 21 26) no Hoare annotation was computed. [2019-01-12 09:09:16,908 INFO L444 ceAbstractionStarter]: At program point L21-2(lines 21 26) the Hoare annotation is: (and (= ULTIMATE.start_fmin_double_~y (fp.neg (_ +zero 11 53))) (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x) (= ULTIMATE.start___fpclassify_double_~x (_ +zero 11 53))) [2019-01-12 09:09:16,909 INFO L448 ceAbstractionStarter]: For program point L21-3(lines 18 43) no Hoare annotation was computed. [2019-01-12 09:09:16,909 INFO L448 ceAbstractionStarter]: For program point L21-5(lines 21 26) no Hoare annotation was computed. [2019-01-12 09:09:16,909 INFO L444 ceAbstractionStarter]: At program point L21-6(lines 21 26) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= ULTIMATE.start_fmin_double_~y .cse0) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x))) [2019-01-12 09:09:16,909 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-01-12 09:09:16,909 INFO L448 ceAbstractionStarter]: For program point L46(lines 46 47) no Hoare annotation was computed. [2019-01-12 09:09:16,909 INFO L448 ceAbstractionStarter]: For program point L21-7(lines 18 43) no Hoare annotation was computed. [2019-01-12 09:09:16,909 INFO L448 ceAbstractionStarter]: For program point L79-2(lines 79 82) no Hoare annotation was computed. [2019-01-12 09:09:16,910 INFO L448 ceAbstractionStarter]: For program point L38(lines 38 42) no Hoare annotation was computed. [2019-01-12 09:09:16,910 INFO L448 ceAbstractionStarter]: For program point L38-1(lines 38 42) no Hoare annotation was computed. [2019-01-12 09:09:16,910 INFO L444 ceAbstractionStarter]: At program point L63(lines 54 64) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= ULTIMATE.start_fmin_double_~y .cse0) (= |ULTIMATE.start_fmin_double_#res| .cse0) (= ULTIMATE.start_main_~res~0 .cse0) (= ULTIMATE.start___signbit_double_~x .cse0) (exists ((|v_q#valueAsBitvector_5| (_ BitVec 64))) (and (= ((_ extract 63 32) |v_q#valueAsBitvector_5|) ULTIMATE.start___signbit_double_~msw~1) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_5|) ((_ extract 62 52) |v_q#valueAsBitvector_5|) ((_ extract 51 0) |v_q#valueAsBitvector_5|)) (fp.neg (_ +zero 11 53))))) (= (_ bv1 32) |ULTIMATE.start___signbit_double_#res|) (exists ((|v_q#valueAsBitvector_4| (_ BitVec 64))) (and (= (fp.neg (_ +zero 11 53)) (fp ((_ extract 63 63) |v_q#valueAsBitvector_4|) ((_ extract 62 52) |v_q#valueAsBitvector_4|) ((_ extract 51 0) |v_q#valueAsBitvector_4|))) (= ULTIMATE.start___fpclassify_double_~msw~0 ((_ extract 63 32) |v_q#valueAsBitvector_4|)))) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x) |ULTIMATE.start_main_#t~short11|)) [2019-01-12 09:09:16,910 INFO L448 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-01-12 09:09:16,910 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 42) no Hoare annotation was computed. [2019-01-12 09:09:16,910 INFO L448 ceAbstractionStarter]: For program point L31-1(lines 31 42) no Hoare annotation was computed. [2019-01-12 09:09:16,910 INFO L448 ceAbstractionStarter]: For program point L48(lines 48 49) no Hoare annotation was computed. [2019-01-12 09:09:16,911 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 09:09:16,911 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 57 61) no Hoare annotation was computed. [2019-01-12 09:09:16,911 INFO L444 ceAbstractionStarter]: At program point L57-2(lines 57 61) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= ULTIMATE.start_fmin_double_~y .cse0) (= |ULTIMATE.start_fmin_double_#res| .cse0) (= ULTIMATE.start_main_~res~0 .cse0) (= ULTIMATE.start___signbit_double_~x .cse0) (exists ((|v_q#valueAsBitvector_4| (_ BitVec 64))) (and (= (fp.neg (_ +zero 11 53)) (fp ((_ extract 63 63) |v_q#valueAsBitvector_4|) ((_ extract 62 52) |v_q#valueAsBitvector_4|) ((_ extract 51 0) |v_q#valueAsBitvector_4|))) (= ULTIMATE.start___fpclassify_double_~msw~0 ((_ extract 63 32) |v_q#valueAsBitvector_4|)))) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x) |ULTIMATE.start_main_#t~short11|)) [2019-01-12 09:09:16,911 INFO L448 ceAbstractionStarter]: For program point L57-3(lines 57 61) no Hoare annotation was computed. [2019-01-12 09:09:16,911 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 09:09:16,911 INFO L444 ceAbstractionStarter]: At program point L42(lines 18 43) the Hoare annotation is: (and (= ULTIMATE.start_fmin_double_~y (fp.neg (_ +zero 11 53))) (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x) (let ((.cse0 (= ULTIMATE.start___fpclassify_double_~x (_ +zero 11 53))) (.cse1 (exists ((v_prenex_11 (_ BitVec 64))) (and (= ULTIMATE.start___fpclassify_double_~msw~0 ((_ extract 63 32) v_prenex_11)) (= (_ +zero 11 53) (fp ((_ extract 63 63) v_prenex_11) ((_ extract 62 52) v_prenex_11) ((_ extract 51 0) v_prenex_11))))))) (or (and (= (bvadd |ULTIMATE.start___fpclassify_double_#res| (_ bv4294967294 32)) (_ bv0 32)) .cse0 .cse1) (and .cse0 (= (bvadd |ULTIMATE.start___fpclassify_double_#res| (_ bv4294967293 32)) (_ bv0 32)) .cse1)))) [2019-01-12 09:09:16,912 INFO L444 ceAbstractionStarter]: At program point L42-1(lines 18 43) the Hoare annotation is: (let ((.cse4 (fp.neg (_ +zero 11 53)))) (let ((.cse0 (= ULTIMATE.start_fmin_double_~y .cse4)) (.cse1 (exists ((|v_q#valueAsBitvector_4| (_ BitVec 64))) (and (= (fp.neg (_ +zero 11 53)) (fp ((_ extract 63 63) |v_q#valueAsBitvector_4|) ((_ extract 62 52) |v_q#valueAsBitvector_4|) ((_ extract 51 0) |v_q#valueAsBitvector_4|))) (= ULTIMATE.start___fpclassify_double_~msw~0 ((_ extract 63 32) |v_q#valueAsBitvector_4|))))) (.cse2 (= ULTIMATE.start___fpclassify_double_~x .cse4)) (.cse3 (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x))) (or (and .cse0 .cse1 .cse2 .cse3 (= (bvadd |ULTIMATE.start___fpclassify_double_#res| (_ bv4294967293 32)) (_ bv0 32))) (and .cse0 (= (bvadd |ULTIMATE.start___fpclassify_double_#res| (_ bv4294967294 32)) (_ bv0 32)) .cse1 .cse2 .cse3)))) [2019-01-12 09:09:16,912 INFO L448 ceAbstractionStarter]: For program point L34(lines 34 42) no Hoare annotation was computed. [2019-01-12 09:09:16,912 INFO L448 ceAbstractionStarter]: For program point L34-1(lines 34 42) no Hoare annotation was computed. [2019-01-12 09:09:16,912 INFO L451 ceAbstractionStarter]: At program point L84(lines 66 85) the Hoare annotation is: true [2019-01-12 09:09:16,912 INFO L448 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-01-12 09:09:16,912 INFO L448 ceAbstractionStarter]: For program point L51-2(line 51) no Hoare annotation was computed. [2019-01-12 09:09:16,913 INFO L444 ceAbstractionStarter]: At program point L51-3(lines 45 52) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= ULTIMATE.start_fmin_double_~y .cse0) (= |ULTIMATE.start_fmin_double_#res| .cse0) (exists ((|v_q#valueAsBitvector_4| (_ BitVec 64))) (and (= (fp.neg (_ +zero 11 53)) (fp ((_ extract 63 63) |v_q#valueAsBitvector_4|) ((_ extract 62 52) |v_q#valueAsBitvector_4|) ((_ extract 51 0) |v_q#valueAsBitvector_4|))) (= ULTIMATE.start___fpclassify_double_~msw~0 ((_ extract 63 32) |v_q#valueAsBitvector_4|)))) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x))) [2019-01-12 09:09:16,920 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:09:16,921 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:09:16,922 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:09:16,922 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:09:16,922 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:16,922 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:16,922 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:16,923 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:16,932 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:09:16,935 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:09:16,935 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:09:16,935 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:09:16,935 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:16,936 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:16,936 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:16,936 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:16,940 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2019-01-12 09:09:16,941 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2019-01-12 09:09:16,941 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2019-01-12 09:09:16,941 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2019-01-12 09:09:16,941 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2019-01-12 09:09:16,941 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2019-01-12 09:09:16,943 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2019-01-12 09:09:16,943 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2019-01-12 09:09:16,944 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2019-01-12 09:09:16,944 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2019-01-12 09:09:16,944 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2019-01-12 09:09:16,944 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2019-01-12 09:09:16,946 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2019-01-12 09:09:16,946 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2019-01-12 09:09:16,946 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2019-01-12 09:09:16,947 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2019-01-12 09:09:16,947 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:16,948 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:16,949 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:16,949 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:16,950 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:16,950 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:16,950 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:16,950 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:16,952 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:16,952 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:16,953 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:16,953 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:16,955 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:16,956 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:16,961 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:16,961 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:16,962 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:16,962 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:16,963 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:16,963 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:16,963 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:16,963 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:16,966 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:16,967 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:16,968 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:16,968 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:16,969 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:16,969 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:16,969 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:16,969 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:16,970 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:16,970 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:16,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 09:09:16 BoogieIcfgContainer [2019-01-12 09:09:16,974 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 09:09:16,975 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 09:09:16,975 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 09:09:16,975 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 09:09:16,976 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:09:11" (3/4) ... [2019-01-12 09:09:16,981 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 09:09:16,995 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2019-01-12 09:09:16,995 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-01-12 09:09:16,996 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-12 09:09:17,023 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && ~Pluszero~LONGDOUBLE() == x) && (((~bvadd64(\result, 4294967294bv32) == 0bv32 && x == ~Pluszero~LONGDOUBLE()) && (\exists v_prenex_11 : bv64 :: msw == v_prenex_11[63:32] && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_prenex_11[63:63], v_prenex_11[62:52], v_prenex_11[51:0]))) || ((x == ~Pluszero~LONGDOUBLE() && ~bvadd64(\result, 4294967293bv32) == 0bv32) && (\exists v_prenex_11 : bv64 :: msw == v_prenex_11[63:32] && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_prenex_11[63:63], v_prenex_11[62:52], v_prenex_11[51:0])))) [2019-01-12 09:09:17,023 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && \result == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && (\exists v_q#valueAsBitvector_4 : bv64 :: ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_4[63:63], v_q#valueAsBitvector_4[62:52], v_q#valueAsBitvector_4[51:0]) && msw == v_q#valueAsBitvector_4[63:32])) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x [2019-01-12 09:09:17,024 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && \result == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && res == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && (\exists v_q#valueAsBitvector_4 : bv64 :: ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_4[63:63], v_q#valueAsBitvector_4[62:52], v_q#valueAsBitvector_4[51:0]) && msw == v_q#valueAsBitvector_4[63:32])) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x) && aux-res == -0.0 && __signbit_double(res) == 1-aux [2019-01-12 09:09:17,025 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && \result == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && res == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && (\exists v_q#valueAsBitvector_5 : bv64 :: v_q#valueAsBitvector_5[63:32] == msw && ~fp~LONGDOUBLE(v_q#valueAsBitvector_5[63:63], v_q#valueAsBitvector_5[62:52], v_q#valueAsBitvector_5[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()))) && 1bv32 == \result) && (\exists v_q#valueAsBitvector_4 : bv64 :: ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_4[63:63], v_q#valueAsBitvector_4[62:52], v_q#valueAsBitvector_4[51:0]) && msw == v_q#valueAsBitvector_4[63:32])) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x) && aux-res == -0.0 && __signbit_double(res) == 1-aux [2019-01-12 09:09:17,025 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && (\exists v_q#valueAsBitvector_4 : bv64 :: ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_4[63:63], v_q#valueAsBitvector_4[62:52], v_q#valueAsBitvector_4[51:0]) && msw == v_q#valueAsBitvector_4[63:32])) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x) && ~bvadd64(\result, 4294967293bv32) == 0bv32) || ((((y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && ~bvadd64(\result, 4294967294bv32) == 0bv32) && (\exists v_q#valueAsBitvector_4 : bv64 :: ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_4[63:63], v_q#valueAsBitvector_4[62:52], v_q#valueAsBitvector_4[51:0]) && msw == v_q#valueAsBitvector_4[63:32])) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x) [2019-01-12 09:09:17,071 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 09:09:17,072 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 09:09:17,073 INFO L168 Benchmark]: Toolchain (without parser) took 6663.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 951.3 MB in the beginning and 842.5 MB in the end (delta: 108.9 MB). Peak memory consumption was 250.4 MB. Max. memory is 11.5 GB. [2019-01-12 09:09:17,074 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:09:17,075 INFO L168 Benchmark]: CACSL2BoogieTranslator took 390.62 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 09:09:17,076 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.12 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-12 09:09:17,077 INFO L168 Benchmark]: Boogie Preprocessor took 124.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -195.0 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2019-01-12 09:09:17,078 INFO L168 Benchmark]: RCFGBuilder took 865.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-01-12 09:09:17,079 INFO L168 Benchmark]: TraceAbstraction took 5131.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 842.5 MB in the end (delta: 260.9 MB). Peak memory consumption was 260.9 MB. Max. memory is 11.5 GB. [2019-01-12 09:09:17,080 INFO L168 Benchmark]: Witness Printer took 97.50 ms. Allocated memory is still 1.2 GB. Free memory is still 842.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:09:17,084 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 390.62 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.12 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 124.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -195.0 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 865.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5131.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 842.5 MB in the end (delta: 260.9 MB). Peak memory consumption was 260.9 MB. Max. memory is 11.5 GB. * Witness Printer took 97.50 ms. Allocated memory is still 1.2 GB. Free memory is still 842.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 54]: Loop Invariant [2019-01-12 09:09:17,098 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:09:17,098 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:09:17,099 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:09:17,099 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:09:17,099 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:17,099 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:17,099 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:17,100 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:17,106 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:09:17,106 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:09:17,106 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:09:17,106 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:09:17,107 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:17,107 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:17,107 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:17,107 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] Derived loop invariant: ((((((((y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && \result == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && res == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && (\exists v_q#valueAsBitvector_5 : bv64 :: v_q#valueAsBitvector_5[63:32] == msw && ~fp~LONGDOUBLE(v_q#valueAsBitvector_5[63:63], v_q#valueAsBitvector_5[62:52], v_q#valueAsBitvector_5[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()))) && 1bv32 == \result) && (\exists v_q#valueAsBitvector_4 : bv64 :: ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_4[63:63], v_q#valueAsBitvector_4[62:52], v_q#valueAsBitvector_4[51:0]) && msw == v_q#valueAsBitvector_4[63:32])) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x) && aux-res == -0.0 && __signbit_double(res) == 1-aux - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x - InvariantResult [Line: 18]: Loop Invariant [2019-01-12 09:09:17,111 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2019-01-12 09:09:17,111 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2019-01-12 09:09:17,112 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2019-01-12 09:09:17,112 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2019-01-12 09:09:17,112 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2019-01-12 09:09:17,112 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2019-01-12 09:09:17,112 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2019-01-12 09:09:17,113 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2019-01-12 09:09:17,116 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2019-01-12 09:09:17,117 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2019-01-12 09:09:17,117 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2019-01-12 09:09:17,117 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2019-01-12 09:09:17,117 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2019-01-12 09:09:17,117 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2019-01-12 09:09:17,117 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2019-01-12 09:09:17,118 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] Derived loop invariant: (y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && ~Pluszero~LONGDOUBLE() == x) && (((~bvadd64(\result, 4294967294bv32) == 0bv32 && x == ~Pluszero~LONGDOUBLE()) && (\exists v_prenex_11 : bv64 :: msw == v_prenex_11[63:32] && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_prenex_11[63:63], v_prenex_11[62:52], v_prenex_11[51:0]))) || ((x == ~Pluszero~LONGDOUBLE() && ~bvadd64(\result, 4294967293bv32) == 0bv32) && (\exists v_prenex_11 : bv64 :: msw == v_prenex_11[63:32] && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_prenex_11[63:63], v_prenex_11[62:52], v_prenex_11[51:0])))) - InvariantResult [Line: 45]: Loop Invariant [2019-01-12 09:09:17,118 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:17,118 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:17,119 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:17,119 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:17,119 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:17,119 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:17,120 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:17,120 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] Derived loop invariant: (((y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && \result == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && (\exists v_q#valueAsBitvector_4 : bv64 :: ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_4[63:63], v_q#valueAsBitvector_4[62:52], v_q#valueAsBitvector_4[51:0]) && msw == v_q#valueAsBitvector_4[63:32])) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x - InvariantResult [Line: 57]: Loop Invariant [2019-01-12 09:09:17,120 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:17,120 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:17,124 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:17,124 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:17,125 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:17,125 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:17,125 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:17,125 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] Derived loop invariant: ((((((y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && \result == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && res == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && (\exists v_q#valueAsBitvector_4 : bv64 :: ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_4[63:63], v_q#valueAsBitvector_4[62:52], v_q#valueAsBitvector_4[51:0]) && msw == v_q#valueAsBitvector_4[63:32])) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x) && aux-res == -0.0 && __signbit_double(res) == 1-aux - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && ~Pluszero~LONGDOUBLE() == x) && x == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 18]: Loop Invariant [2019-01-12 09:09:17,129 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:17,130 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:17,130 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:17,130 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:17,130 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:17,130 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:17,134 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:17,134 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:17,135 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:17,135 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:17,135 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:17,135 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:17,135 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:17,136 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:17,136 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:09:17,136 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] Derived loop invariant: ((((y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && (\exists v_q#valueAsBitvector_4 : bv64 :: ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_4[63:63], v_q#valueAsBitvector_4[62:52], v_q#valueAsBitvector_4[51:0]) && msw == v_q#valueAsBitvector_4[63:32])) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x) && ~bvadd64(\result, 4294967293bv32) == 0bv32) || ((((y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && ~bvadd64(\result, 4294967294bv32) == 0bv32) && (\exists v_q#valueAsBitvector_4 : bv64 :: ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_4[63:63], v_q#valueAsBitvector_4[62:52], v_q#valueAsBitvector_4[51:0]) && msw == v_q#valueAsBitvector_4[63:32])) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x) - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 1 error locations. SAFE Result, 5.0s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 2.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 344 SDtfs, 238 SDslu, 501 SDs, 0 SdLazy, 174 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 162 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred 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, 10 MinimizatonAttempts, 72 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 16 NumberOfFragments, 281 HoareAnnotationTreeSize, 8 FomulaSimplifications, 388 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 8 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 155 NumberOfCodeBlocks, 155 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 145 ConstructedInterpolants, 8 QuantifiedInterpolants, 7690 SizeOfPredicates, 37 NumberOfNonLiveVariables, 568 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...