/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/Ultimate.py --spec ../../../trunk/examples/svcomp/ReachSafety.prp --file ../../../trunk/examples/svcomp/float-benchs/filter1_true-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 40ef5092 Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-benchs/filter1_true-unreach-call_true-termination.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 20183bacfea343fcbafe493366fbda56f082cdb8 ................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-benchs/filter1_true-unreach-call_true-termination.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 20183bacfea343fcbafe493366fbda56f082cdb8 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (fp.leq (_ FloatingPoint 11 53) (_ FloatingPoint 11 53) Bool) --- Real Ultimate output --- This is Ultimate 0.1.23-40ef509 [2018-09-20 13:56:50,818 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-20 13:56:50,820 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-20 13:56:50,837 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-20 13:56:50,838 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-20 13:56:50,839 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-20 13:56:50,843 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-20 13:56:50,846 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-20 13:56:50,850 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-20 13:56:50,857 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-20 13:56:50,859 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-20 13:56:50,859 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-20 13:56:50,860 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-20 13:56:50,861 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-20 13:56:50,865 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-20 13:56:50,866 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-20 13:56:50,867 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-20 13:56:50,873 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-20 13:56:50,875 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-20 13:56:50,876 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-20 13:56:50,877 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-20 13:56:50,880 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-20 13:56:50,882 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-20 13:56:50,882 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-20 13:56:50,882 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-20 13:56:50,883 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-20 13:56:50,886 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-20 13:56:50,887 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-20 13:56:50,888 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-20 13:56:50,893 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-20 13:56:50,895 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-20 13:56:50,896 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-20 13:56:50,896 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-20 13:56:50,896 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-20 13:56:50,899 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-20 13:56:50,901 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-20 13:56:50,903 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-20 13:56:50,930 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-20 13:56:50,931 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-20 13:56:50,932 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-20 13:56:50,936 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-20 13:56:50,937 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-20 13:56:50,937 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-20 13:56:50,937 INFO L133 SettingsManager]: * Use SBE=true [2018-09-20 13:56:50,937 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-20 13:56:50,939 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-20 13:56:50,939 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-20 13:56:50,941 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-20 13:56:50,942 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-20 13:56:50,942 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-20 13:56:50,942 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-20 13:56:50,942 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-20 13:56:50,942 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-20 13:56:50,943 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-20 13:56:50,943 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-20 13:56:50,943 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-20 13:56:50,943 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-20 13:56:50,943 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-20 13:56:50,943 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-20 13:56:50,944 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 13:56:50,944 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-20 13:56:50,944 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-20 13:56:50,944 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-20 13:56:50,949 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-20 13:56:50,949 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-20 13:56:50,949 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-20 13:56:50,949 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 -> 20183bacfea343fcbafe493366fbda56f082cdb8 [2018-09-20 13:56:51,037 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-20 13:56:51,052 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-20 13:56:51,056 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-20 13:56:51,057 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-20 13:56:51,058 INFO L276 PluginConnector]: CDTParser initialized [2018-09-20 13:56:51,059 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/filter1_true-unreach-call_true-termination.c [2018-09-20 13:56:51,406 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19db3fa34/9a6a5d84b1774bdea12598d06bbd6525/FLAGa86b6c002 [2018-09-20 13:56:51,527 INFO L277 CDTParser]: Found 1 translation units. [2018-09-20 13:56:51,528 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/filter1_true-unreach-call_true-termination.c [2018-09-20 13:56:51,535 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19db3fa34/9a6a5d84b1774bdea12598d06bbd6525/FLAGa86b6c002 [2018-09-20 13:56:51,552 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19db3fa34/9a6a5d84b1774bdea12598d06bbd6525 [2018-09-20 13:56:51,560 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-20 13:56:51,565 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-20 13:56:51,566 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-20 13:56:51,566 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-20 13:56:51,574 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-20 13:56:51,575 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:56:51" (1/1) ... [2018-09-20 13:56:51,578 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4aac9be2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:56:51, skipping insertion in model container [2018-09-20 13:56:51,579 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:56:51" (1/1) ... [2018-09-20 13:56:51,591 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-20 13:56:51,811 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 13:56:51,832 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-20 13:56:51,843 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 13:56:51,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:56:51 WrapperNode [2018-09-20 13:56:51,863 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-20 13:56:51,864 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-20 13:56:51,864 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-20 13:56:51,864 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-20 13:56:51,881 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:56:51" (1/1) ... [2018-09-20 13:56:51,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:56:51" (1/1) ... [2018-09-20 13:56:51,891 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:56:51" (1/1) ... [2018-09-20 13:56:51,892 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:56:51" (1/1) ... [2018-09-20 13:56:51,895 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:56:51" (1/1) ... [2018-09-20 13:56:51,902 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:56:51" (1/1) ... [2018-09-20 13:56:51,904 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:56:51" (1/1) ... [2018-09-20 13:56:51,912 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-20 13:56:51,915 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-20 13:56:51,915 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-20 13:56:51,915 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-20 13:56:51,916 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:56:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 13:56:51,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-20 13:56:51,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-20 13:56:51,991 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-09-20 13:56:51,991 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-20 13:56:51,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-20 13:56:51,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-09-20 13:56:51,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-09-20 13:56:51,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-09-20 13:56:51,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-09-20 13:56:51,992 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-20 13:56:51,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-20 13:56:51,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-20 13:56:52,307 INFO L365 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-20 13:56:52,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:56:52 BoogieIcfgContainer [2018-09-20 13:56:52,311 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-20 13:56:52,312 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-20 13:56:52,312 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-20 13:56:52,316 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-20 13:56:52,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:56:51" (1/3) ... [2018-09-20 13:56:52,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@febf7b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:56:52, skipping insertion in model container [2018-09-20 13:56:52,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:56:51" (2/3) ... [2018-09-20 13:56:52,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@febf7b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:56:52, skipping insertion in model container [2018-09-20 13:56:52,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:56:52" (3/3) ... [2018-09-20 13:56:52,321 INFO L112 eAbstractionObserver]: Analyzing ICFG filter1_true-unreach-call_true-termination.c [2018-09-20 13:56:52,332 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-20 13:56:52,340 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-20 13:56:52,393 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-20 13:56:52,394 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-20 13:56:52,394 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-20 13:56:52,394 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-20 13:56:52,394 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-20 13:56:52,395 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-20 13:56:52,395 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-20 13:56:52,395 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-20 13:56:52,395 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-20 13:56:52,416 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-09-20 13:56:52,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-20 13:56:52,423 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 13:56:52,424 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 13:56:52,427 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 13:56:52,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1867248710, now seen corresponding path program 1 times [2018-09-20 13:56:52,435 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 13:56:52,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 13:56:52,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 13:56:52,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 13:56:52,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 13:56:52,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-20 13:56:52,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-20 13:56:52,565 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-20 13:56:52,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:56:52 BoogieIcfgContainer [2018-09-20 13:56:52,588 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-20 13:56:52,588 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-09-20 13:56:52,589 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-09-20 13:56:52,589 INFO L276 PluginConnector]: Witness Printer initialized [2018-09-20 13:56:52,589 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:56:52" (3/4) ... [2018-09-20 13:56:52,594 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-09-20 13:56:52,594 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-09-20 13:56:52,595 INFO L168 Benchmark]: Toolchain (without parser) took 1033.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 953.2 MB in the beginning and 1.1 GB in the end (delta: -145.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 13:56:52,598 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 13:56:52,600 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.04 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-09-20 13:56:52,602 INFO L168 Benchmark]: Boogie Preprocessor took 50.24 ms. Allocated memory is still 1.0 GB. Free memory is still 942.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 13:56:52,603 INFO L168 Benchmark]: RCFGBuilder took 396.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -172.1 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. [2018-09-20 13:56:52,604 INFO L168 Benchmark]: TraceAbstraction took 275.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. [2018-09-20 13:56:52,605 INFO L168 Benchmark]: Witness Printer took 5.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 13:56:52,610 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 298.04 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.24 ms. Allocated memory is still 1.0 GB. Free memory is still 942.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 396.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -172.1 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 275.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. * Witness Printer took 5.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.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: 12]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 26, overapproximation of to_real at line 29. Possible FailurePath: [L17] double E0, E1, S; [L18] int i; [L20] E1 = 0 [L21] S = 0 [L23] i = 0 VAL [i=0] [L23] COND TRUE i <= 1000000 [L25] E0 = __VERIFIER_nondet_double() [L28] COND TRUE __VERIFIER_nondet_int() [L29] S = 0 VAL [E0=2, i=0] [L34] E1 = E0 VAL [E0=2, E1=2, i=0] [L36] CALL __VERIFIER_assert(S >= -10000. && S <= 10000.) VAL [\old(cond)=0] [L12] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L12] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. UNSAFE Result, 0.2s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 13 NumberOfCodeBlocks, 13 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-40ef509 [2018-09-20 13:56:55,035 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-20 13:56:55,037 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-20 13:56:55,056 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-20 13:56:55,056 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-20 13:56:55,057 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-20 13:56:55,058 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-20 13:56:55,060 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-20 13:56:55,062 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-20 13:56:55,063 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-20 13:56:55,064 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-20 13:56:55,064 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-20 13:56:55,066 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-20 13:56:55,067 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-20 13:56:55,068 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-20 13:56:55,069 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-20 13:56:55,070 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-20 13:56:55,072 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-20 13:56:55,074 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-20 13:56:55,076 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-20 13:56:55,077 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-20 13:56:55,079 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-20 13:56:55,081 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-20 13:56:55,082 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-20 13:56:55,082 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-20 13:56:55,083 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-20 13:56:55,084 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-20 13:56:55,085 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-20 13:56:55,086 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-20 13:56:55,087 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-20 13:56:55,088 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-20 13:56:55,089 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-20 13:56:55,089 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-20 13:56:55,089 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-20 13:56:55,090 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-20 13:56:55,091 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-20 13:56:55,092 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-09-20 13:56:55,113 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-20 13:56:55,114 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-20 13:56:55,115 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-20 13:56:55,115 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-20 13:56:55,115 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-20 13:56:55,116 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-20 13:56:55,116 INFO L133 SettingsManager]: * Use SBE=true [2018-09-20 13:56:55,116 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-20 13:56:55,116 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-20 13:56:55,116 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-20 13:56:55,117 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-20 13:56:55,117 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-20 13:56:55,117 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-20 13:56:55,117 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-20 13:56:55,117 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-20 13:56:55,117 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-20 13:56:55,118 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-20 13:56:55,118 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-20 13:56:55,118 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-20 13:56:55,118 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-20 13:56:55,119 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-20 13:56:55,120 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-20 13:56:55,120 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-20 13:56:55,120 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 13:56:55,120 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-20 13:56:55,121 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-20 13:56:55,121 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-20 13:56:55,121 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-20 13:56:55,121 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-20 13:56:55,122 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-20 13:56:55,122 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-20 13:56:55,122 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 -> 20183bacfea343fcbafe493366fbda56f082cdb8 [2018-09-20 13:56:55,183 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-20 13:56:55,205 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-20 13:56:55,211 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-20 13:56:55,212 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-20 13:56:55,212 INFO L276 PluginConnector]: CDTParser initialized [2018-09-20 13:56:55,213 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/filter1_true-unreach-call_true-termination.c [2018-09-20 13:56:55,568 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f49ff631/a3d13794f20c44d29988e350b41385ea/FLAG4fb85420f [2018-09-20 13:56:55,727 INFO L277 CDTParser]: Found 1 translation units. [2018-09-20 13:56:55,728 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/filter1_true-unreach-call_true-termination.c [2018-09-20 13:56:55,733 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f49ff631/a3d13794f20c44d29988e350b41385ea/FLAG4fb85420f [2018-09-20 13:56:55,751 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f49ff631/a3d13794f20c44d29988e350b41385ea [2018-09-20 13:56:55,756 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-20 13:56:55,760 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-20 13:56:55,761 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-20 13:56:55,762 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-20 13:56:55,772 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-20 13:56:55,773 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:56:55" (1/1) ... [2018-09-20 13:56:55,783 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57464139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:56:55, skipping insertion in model container [2018-09-20 13:56:55,784 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:56:55" (1/1) ... [2018-09-20 13:56:55,796 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-20 13:56:56,072 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 13:56:56,097 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-20 13:56:56,106 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 13:56:56,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:56:56 WrapperNode [2018-09-20 13:56:56,131 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-20 13:56:56,133 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-20 13:56:56,133 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-20 13:56:56,133 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-20 13:56:56,145 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:56:56" (1/1) ... [2018-09-20 13:56:56,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:56:56" (1/1) ... [2018-09-20 13:56:56,156 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:56:56" (1/1) ... [2018-09-20 13:56:56,156 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:56:56" (1/1) ... [2018-09-20 13:56:56,161 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:56:56" (1/1) ... [2018-09-20 13:56:56,166 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:56:56" (1/1) ... [2018-09-20 13:56:56,168 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:56:56" (1/1) ... [2018-09-20 13:56:56,171 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-20 13:56:56,171 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-20 13:56:56,171 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-20 13:56:56,172 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-20 13:56:56,173 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:56:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 13:56:56,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-20 13:56:56,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-20 13:56:56,240 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-09-20 13:56:56,241 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-20 13:56:56,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-20 13:56:56,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-09-20 13:56:56,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-09-20 13:56:56,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-09-20 13:56:56,242 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-09-20 13:56:56,242 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-20 13:56:56,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-20 13:56:56,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-20 13:56:57,445 INFO L365 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-20 13:56:57,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:56:57 BoogieIcfgContainer [2018-09-20 13:56:57,447 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-20 13:56:57,453 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-20 13:56:57,453 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-20 13:56:57,456 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-20 13:56:57,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:56:55" (1/3) ... [2018-09-20 13:56:57,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a0af96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:56:57, skipping insertion in model container [2018-09-20 13:56:57,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:56:56" (2/3) ... [2018-09-20 13:56:57,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a0af96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:56:57, skipping insertion in model container [2018-09-20 13:56:57,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:56:57" (3/3) ... [2018-09-20 13:56:57,462 INFO L112 eAbstractionObserver]: Analyzing ICFG filter1_true-unreach-call_true-termination.c [2018-09-20 13:56:57,475 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-20 13:56:57,484 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-20 13:56:57,540 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-20 13:56:57,541 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-20 13:56:57,541 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-20 13:56:57,541 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-20 13:56:57,541 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-20 13:56:57,541 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-20 13:56:57,542 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-20 13:56:57,542 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-20 13:56:57,542 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-20 13:56:57,560 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-09-20 13:56:57,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-20 13:56:57,567 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 13:56:57,569 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 13:56:57,572 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 13:56:57,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1867248710, now seen corresponding path program 1 times [2018-09-20 13:56:57,581 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 13:56:57,582 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-09-20 13:56:57,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 13:56:57,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 13:56:57,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 13:56:57,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 13:56:57,830 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 13:56:57,846 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 13:56:57,846 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-20 13:56:57,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-20 13:56:57,866 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-20 13:56:57,867 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-20 13:56:57,869 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 5 states. [2018-09-20 13:56:59,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 13:56:59,158 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2018-09-20 13:56:59,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-20 13:56:59,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-09-20 13:56:59,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 13:56:59,170 INFO L225 Difference]: With dead ends: 52 [2018-09-20 13:56:59,170 INFO L226 Difference]: Without dead ends: 27 [2018-09-20 13:56:59,175 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-09-20 13:56:59,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-20 13:56:59,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2018-09-20 13:56:59,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-20 13:56:59,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-09-20 13:56:59,216 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 13 [2018-09-20 13:56:59,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 13:56:59,217 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-09-20 13:56:59,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-20 13:56:59,217 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-09-20 13:56:59,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-20 13:56:59,218 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 13:56:59,218 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 13:56:59,219 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 13:56:59,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1924507012, now seen corresponding path program 1 times [2018-09-20 13:56:59,219 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 13:56:59,220 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-09-20 13:56:59,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 13:56:59,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 13:56:59,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 13:57:00,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 13:57:00,079 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 13:57:00,095 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 13:57:00,096 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-20 13:57:00,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-20 13:57:00,098 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-20 13:57:00,099 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-09-20 13:57:00,099 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 7 states. [2018-09-20 13:57:05,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 13:57:05,181 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-09-20 13:57:05,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-20 13:57:05,227 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-09-20 13:57:05,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 13:57:05,231 INFO L225 Difference]: With dead ends: 39 [2018-09-20 13:57:05,231 INFO L226 Difference]: Without dead ends: 37 [2018-09-20 13:57:05,233 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-09-20 13:57:05,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-20 13:57:05,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2018-09-20 13:57:05,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-20 13:57:05,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-09-20 13:57:05,242 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 13 [2018-09-20 13:57:05,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 13:57:05,243 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-09-20 13:57:05,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-20 13:57:05,243 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-09-20 13:57:05,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-20 13:57:05,245 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 13:57:05,245 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 13:57:05,245 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 13:57:05,246 INFO L82 PathProgramCache]: Analyzing trace with hash 521295018, now seen corresponding path program 1 times [2018-09-20 13:57:05,246 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 13:57:05,246 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-09-20 13:57:05,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 13:57:05,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 13:57:05,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 13:57:06,095 WARN L178 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-09-20 13:57:08,220 WARN L819 $PredicateComparison]: unable to prove that (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse1 (fp.neg .cse0))) (and (fp.leq main_~E0~0 .cse0) (fp.geq main_~E1~0 .cse1) (fp.leq main_~E1~0 .cse0) (fp.geq main_~E0~0 .cse1) (= (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) ((_ to_fp 11 53) RNE (_ bv0 32))) main_~E0~0) main_~E1~0) c_main_~S~0))))) is different from true [2018-09-20 13:57:48,298 WARN L178 SmtUtils]: Spent 25.43 s on a formula simplification that was a NOOP. DAG size: 44 [2018-09-20 13:58:20,815 WARN L178 SmtUtils]: Spent 21.32 s on a formula simplification that was a NOOP. DAG size: 44 [2018-09-20 13:58:30,890 WARN L797 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_3 (_ FloatingPoint 11 53)) (v_prenex_1 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse1 (fp.neg .cse0))) (and (fp.leq v_prenex_3 .cse0) (not (fp.geq (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) ((_ to_fp 11 53) RNE (_ bv0 32))) v_prenex_3) v_prenex_1) (fp.neg ((_ to_fp 11 53) RNE 10000.0)))) (fp.geq v_prenex_1 .cse1) (fp.geq v_prenex_3 .cse1) (fp.leq v_prenex_1 .cse0))))) (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse3 (fp.neg .cse2))) (and (fp.leq main_~E0~0 .cse2) (fp.geq main_~E1~0 .cse3) (fp.leq main_~E1~0 .cse2) (fp.geq main_~E0~0 .cse3) (not (fp.leq (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) ((_ to_fp 11 53) RNE (_ bv0 32))) main_~E0~0) main_~E1~0) ((_ to_fp 11 53) RNE 10000.0)))))))) is different from false [2018-09-20 13:58:32,904 WARN L819 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_3 (_ FloatingPoint 11 53)) (v_prenex_1 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse1 (fp.neg .cse0))) (and (fp.leq v_prenex_3 .cse0) (not (fp.geq (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) ((_ to_fp 11 53) RNE (_ bv0 32))) v_prenex_3) v_prenex_1) (fp.neg ((_ to_fp 11 53) RNE 10000.0)))) (fp.geq v_prenex_1 .cse1) (fp.geq v_prenex_3 .cse1) (fp.leq v_prenex_1 .cse0))))) (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse3 (fp.neg .cse2))) (and (fp.leq main_~E0~0 .cse2) (fp.geq main_~E1~0 .cse3) (fp.leq main_~E1~0 .cse2) (fp.geq main_~E0~0 .cse3) (not (fp.leq (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) ((_ to_fp 11 53) RNE (_ bv0 32))) main_~E0~0) main_~E1~0) ((_ to_fp 11 53) RNE 10000.0)))))))) is different from true [2018-09-20 13:58:32,910 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-09-20 13:58:32,910 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 13:58:42,410 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) c_main_~S~0) c_main_~E0~0) c_main_~E1~0)) (.cse1 ((_ to_fp 11 53) RNE 10000.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2018-09-20 13:58:44,454 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) c_main_~S~0) c_main_~E0~0) c_main_~E1~0)) (.cse1 ((_ to_fp 11 53) RNE 10000.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from true [2018-09-20 13:58:46,530 WARN L819 $PredicateComparison]: unable to prove that (and (forall ((v_main_~E0~0_5 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (or (fp.leq (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) c_main_~S~0) v_main_~E0~0_5) c_main_~E1~0) ((_ to_fp 11 53) RNE 10000.0)) (not (fp.leq v_main_~E0~0_5 .cse0)) (not (fp.geq v_main_~E0~0_5 (fp.neg .cse0)))))) (forall ((v_prenex_4 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) RNE 1.0))) (or (fp.geq (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) c_main_~S~0) v_prenex_4) c_main_~E1~0) (fp.neg ((_ to_fp 11 53) RNE 10000.0))) (not (fp.geq v_prenex_4 (fp.neg .cse1))) (not (fp.leq v_prenex_4 .cse1)))))) is different from true [2018-09-20 13:58:46,563 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-20 13:58:46,564 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-20 13:58:46,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 13:58:54,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 13:58:54,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 13:59:25,802 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-09-20 13:59:25,802 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 13:59:27,886 WARN L819 $PredicateComparison]: unable to prove that (and (forall ((|main_#t~nondet1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (or (not (fp.geq |main_#t~nondet1| (fp.neg .cse0))) (fp.geq (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) c_main_~S~0) |main_#t~nondet1|) c_main_~E1~0) (fp.neg ((_ to_fp 11 53) RNE 10000.0))) (not (fp.leq |main_#t~nondet1| .cse0))))) (forall ((v_prenex_8 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) RNE 1.0))) (or (not (fp.geq v_prenex_8 (fp.neg .cse1))) (fp.leq (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) c_main_~S~0) v_prenex_8) c_main_~E1~0) ((_ to_fp 11 53) RNE 10000.0)) (not (fp.leq v_prenex_8 .cse1)))))) is different from true [2018-09-20 13:59:30,022 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) RNE 10000.0))) (let ((.cse1 (not (fp.leq c_main_~S~0 .cse4))) (.cse2 (not (fp.geq c_main_~S~0 (fp.neg .cse4))))) (and (or (forall ((|main_#t~nondet1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (or (not (fp.geq |main_#t~nondet1| (fp.neg .cse0))) (fp.geq (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) c_main_~S~0) |main_#t~nondet1|) c_main_~E1~0) (fp.neg ((_ to_fp 11 53) RNE 10000.0))) (not (fp.leq |main_#t~nondet1| .cse0))))) .cse1 .cse2) (or .cse1 .cse2 (forall ((v_prenex_8 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) RNE 1.0))) (or (not (fp.geq v_prenex_8 (fp.neg .cse3))) (fp.leq (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) c_main_~S~0) v_prenex_8) c_main_~E1~0) ((_ to_fp 11 53) RNE 10000.0)) (not (fp.leq v_prenex_8 .cse3))))))))) is different from true [2018-09-20 13:59:30,062 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-20 13:59:30,062 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 11 [2018-09-20 13:59:30,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-20 13:59:30,063 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-20 13:59:30,066 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=106, Unknown=10, NotChecked=150, Total=306 [2018-09-20 13:59:30,067 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 12 states. [2018-09-20 13:59:41,807 WARN L178 SmtUtils]: Spent 2.44 s on a formula simplification that was a NOOP. DAG size: 22 [2018-09-20 13:59:45,074 WARN L178 SmtUtils]: Spent 2.73 s on a formula simplification. DAG size of input: 46 DAG size of output: 5 [2018-09-20 14:00:01,464 WARN L178 SmtUtils]: Spent 14.28 s on a formula simplification. DAG size of input: 54 DAG size of output: 8 [2018-09-20 14:01:12,987 WARN L178 SmtUtils]: Spent 56.99 s on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2018-09-20 14:01:25,861 WARN L797 $PredicateComparison]: unable to prove that (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (or (exists ((v_prenex_3 (_ FloatingPoint 11 53)) (v_prenex_1 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse1 (fp.neg .cse0))) (and (fp.leq v_prenex_3 .cse0) (not (fp.geq (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) ((_ to_fp 11 53) RNE (_ bv0 32))) v_prenex_3) v_prenex_1) (fp.neg ((_ to_fp 11 53) RNE 10000.0)))) (fp.geq v_prenex_1 .cse1) (fp.geq v_prenex_3 .cse1) (fp.leq v_prenex_1 .cse0))))) (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse3 (fp.neg .cse2))) (and (fp.leq main_~E0~0 .cse2) (fp.geq main_~E1~0 .cse3) (fp.leq main_~E1~0 .cse2) (fp.geq main_~E0~0 .cse3) (not (fp.leq (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) ((_ to_fp 11 53) RNE (_ bv0 32))) main_~E0~0) main_~E1~0) ((_ to_fp 11 53) RNE 10000.0))))))))) is different from false [2018-09-20 14:01:27,874 WARN L819 $PredicateComparison]: unable to prove that (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (or (exists ((v_prenex_3 (_ FloatingPoint 11 53)) (v_prenex_1 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse1 (fp.neg .cse0))) (and (fp.leq v_prenex_3 .cse0) (not (fp.geq (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) ((_ to_fp 11 53) RNE (_ bv0 32))) v_prenex_3) v_prenex_1) (fp.neg ((_ to_fp 11 53) RNE 10000.0)))) (fp.geq v_prenex_1 .cse1) (fp.geq v_prenex_3 .cse1) (fp.leq v_prenex_1 .cse0))))) (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse3 (fp.neg .cse2))) (and (fp.leq main_~E0~0 .cse2) (fp.geq main_~E1~0 .cse3) (fp.leq main_~E1~0 .cse2) (fp.geq main_~E0~0 .cse3) (not (fp.leq (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) ((_ to_fp 11 53) RNE (_ bv0 32))) main_~E0~0) main_~E1~0) ((_ to_fp 11 53) RNE 10000.0))))))))) is different from true [2018-09-20 14:01:27,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:01:27,900 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-09-20 14:01:27,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-20 14:01:27,901 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-09-20 14:01:27,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:01:27,903 INFO L225 Difference]: With dead ends: 43 [2018-09-20 14:01:27,903 INFO L226 Difference]: Without dead ends: 41 [2018-09-20 14:01:27,904 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 186.4s TimeCoverageRelationStatistics Valid=70, Invalid=210, Unknown=20, NotChecked=252, Total=552 [2018-09-20 14:01:27,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-20 14:01:27,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2018-09-20 14:01:27,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-09-20 14:01:27,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-09-20 14:01:27,920 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 23 [2018-09-20 14:01:27,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:01:27,920 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-09-20 14:01:27,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-20 14:01:27,921 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-09-20 14:01:27,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-20 14:01:27,924 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:01:27,925 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 14:01:27,925 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:01:27,925 INFO L82 PathProgramCache]: Analyzing trace with hash -499773336, now seen corresponding path program 1 times [2018-09-20 14:01:27,926 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 14:01:27,926 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-09-20 14:01:27,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 14:01:29,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 14:01:29,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 14:01:32,083 WARN L797 $PredicateComparison]: unable to prove that (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse1 (fp.neg .cse0))) (and (fp.leq main_~E0~0 .cse0) (fp.geq main_~E1~0 .cse1) (fp.leq main_~E1~0 .cse0) (fp.geq main_~E0~0 .cse1) (= (fp.sub RNE (fp.add RNE (let ((.cse2 ((_ to_fp 11 53) RNE (/ 999.0 1000.0)))) (fp.mul RNE .cse2 (let ((.cse3 ((_ to_fp 11 53) RNE (_ bv0 32)))) (fp.sub RNE (fp.add RNE (fp.mul RNE .cse2 .cse3) main_~E1~0) .cse3)))) main_~E0~0) main_~E1~0) c_main_~S~0))))) is different from false [2018-09-20 14:01:34,133 WARN L819 $PredicateComparison]: unable to prove that (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse1 (fp.neg .cse0))) (and (fp.leq main_~E0~0 .cse0) (fp.geq main_~E1~0 .cse1) (fp.leq main_~E1~0 .cse0) (fp.geq main_~E0~0 .cse1) (= (fp.sub RNE (fp.add RNE (let ((.cse2 ((_ to_fp 11 53) RNE (/ 999.0 1000.0)))) (fp.mul RNE .cse2 (let ((.cse3 ((_ to_fp 11 53) RNE (_ bv0 32)))) (fp.sub RNE (fp.add RNE (fp.mul RNE .cse2 .cse3) main_~E1~0) .cse3)))) main_~E0~0) main_~E1~0) c_main_~S~0))))) is different from true [2018-09-20 14:01:50,598 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (or (and (exists ((v_prenex_10 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse1 (fp.neg .cse0))) (and (fp.leq v_prenex_9 .cse0) (fp.geq v_prenex_9 .cse1) (fp.geq v_prenex_10 .cse1) (fp.leq v_prenex_10 .cse0) (not (fp.leq (fp.sub RNE (fp.add RNE (let ((.cse2 ((_ to_fp 11 53) RNE (/ 999.0 1000.0)))) (fp.mul RNE .cse2 (let ((.cse3 ((_ to_fp 11 53) RNE (_ bv0 32)))) (fp.sub RNE (fp.add RNE (fp.mul RNE .cse2 .cse3) v_prenex_9) .cse3)))) v_prenex_10) v_prenex_9) ((_ to_fp 11 53) RNE 10000.0))))))) .cse4) (and (exists ((v_prenex_12 (_ FloatingPoint 11 53)) (v_prenex_13 (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse6 (fp.sub RNE (fp.add RNE (let ((.cse9 ((_ to_fp 11 53) RNE (/ 999.0 1000.0)))) (fp.mul RNE .cse9 (let ((.cse10 ((_ to_fp 11 53) RNE (_ bv0 32)))) (fp.sub RNE (fp.add RNE (fp.mul RNE .cse9 .cse10) v_prenex_12) .cse10)))) v_prenex_13) v_prenex_12)) (.cse7 ((_ to_fp 11 53) RNE 10000.0)) (.cse8 (fp.neg .cse5))) (and (fp.leq v_prenex_13 .cse5) (fp.geq .cse6 (fp.neg .cse7)) (fp.leq .cse6 .cse7) (fp.geq v_prenex_12 .cse8) (fp.geq v_prenex_13 .cse8) (fp.leq v_prenex_12 .cse5))))) (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))) (and (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse13 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse14 (fp.neg .cse13))) (and (not (fp.geq (fp.sub RNE (fp.add RNE (let ((.cse11 ((_ to_fp 11 53) RNE (/ 999.0 1000.0)))) (fp.mul RNE .cse11 (let ((.cse12 ((_ to_fp 11 53) RNE (_ bv0 32)))) (fp.sub RNE (fp.add RNE (fp.mul RNE .cse11 .cse12) main_~E1~0) .cse12)))) main_~E0~0) main_~E1~0) (fp.neg ((_ to_fp 11 53) RNE 10000.0)))) (fp.leq main_~E0~0 .cse13) (fp.geq main_~E1~0 .cse14) (fp.leq main_~E1~0 .cse13) (fp.geq main_~E0~0 .cse14))))) .cse4))) is different from false [2018-09-20 14:02:05,121 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse6 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (or (and (exists ((v_prenex_12 (_ FloatingPoint 11 53)) (v_prenex_13 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse1 (fp.sub RNE (fp.add RNE (let ((.cse4 ((_ to_fp 11 53) RNE (/ 999.0 1000.0)))) (fp.mul RNE .cse4 (let ((.cse5 ((_ to_fp 11 53) RNE (_ bv0 32)))) (fp.sub RNE (fp.add RNE (fp.mul RNE .cse4 .cse5) v_prenex_12) .cse5)))) v_prenex_13) v_prenex_12)) (.cse2 ((_ to_fp 11 53) RNE 10000.0)) (.cse3 (fp.neg .cse0))) (and (fp.leq v_prenex_13 .cse0) (fp.geq .cse1 (fp.neg .cse2)) (fp.leq .cse1 .cse2) (fp.geq v_prenex_12 .cse3) (fp.geq v_prenex_13 .cse3) (fp.leq v_prenex_12 .cse0))))) (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))) (and .cse6 (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse9 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse10 (fp.neg .cse9))) (and (not (fp.geq (fp.sub RNE (fp.add RNE (let ((.cse7 ((_ to_fp 11 53) RNE (/ 999.0 1000.0)))) (fp.mul RNE .cse7 (let ((.cse8 ((_ to_fp 11 53) RNE (_ bv0 32)))) (fp.sub RNE (fp.add RNE (fp.mul RNE .cse7 .cse8) main_~E1~0) .cse8)))) main_~E0~0) main_~E1~0) (fp.neg ((_ to_fp 11 53) RNE 10000.0)))) (fp.leq main_~E0~0 .cse9) (fp.geq main_~E1~0 .cse10) (fp.leq main_~E1~0 .cse9) (fp.geq main_~E0~0 .cse10)))))) (and .cse6 (exists ((v_prenex_10 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53))) (let ((.cse11 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse12 (fp.neg .cse11))) (and (fp.leq v_prenex_9 .cse11) (fp.geq v_prenex_9 .cse12) (fp.geq v_prenex_10 .cse12) (fp.leq v_prenex_10 .cse11) (not (fp.leq (fp.sub RNE (fp.add RNE (let ((.cse13 ((_ to_fp 11 53) RNE (/ 999.0 1000.0)))) (fp.mul RNE .cse13 (let ((.cse14 ((_ to_fp 11 53) RNE (_ bv0 32)))) (fp.sub RNE (fp.add RNE (fp.mul RNE .cse13 .cse14) v_prenex_9) .cse14)))) v_prenex_10) v_prenex_9) ((_ to_fp 11 53) RNE 10000.0)))))))))) is different from false [2018-09-20 14:02:15,421 WARN L797 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_10 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse1 (fp.neg .cse0))) (and (fp.leq v_prenex_9 .cse0) (fp.geq v_prenex_9 .cse1) (fp.geq v_prenex_10 .cse1) (fp.leq v_prenex_10 .cse0) (not (fp.leq (fp.sub RNE (fp.add RNE (let ((.cse2 ((_ to_fp 11 53) RNE (/ 999.0 1000.0)))) (fp.mul RNE .cse2 (let ((.cse3 ((_ to_fp 11 53) RNE (_ bv0 32)))) (fp.sub RNE (fp.add RNE (fp.mul RNE .cse2 .cse3) v_prenex_9) .cse3)))) v_prenex_10) v_prenex_9) ((_ to_fp 11 53) RNE 10000.0))))))) (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse6 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse7 (fp.neg .cse6))) (and (not (fp.geq (fp.sub RNE (fp.add RNE (let ((.cse4 ((_ to_fp 11 53) RNE (/ 999.0 1000.0)))) (fp.mul RNE .cse4 (let ((.cse5 ((_ to_fp 11 53) RNE (_ bv0 32)))) (fp.sub RNE (fp.add RNE (fp.mul RNE .cse4 .cse5) main_~E1~0) .cse5)))) main_~E0~0) main_~E1~0) (fp.neg ((_ to_fp 11 53) RNE 10000.0)))) (fp.leq main_~E0~0 .cse6) (fp.geq main_~E1~0 .cse7) (fp.leq main_~E1~0 .cse6) (fp.geq main_~E0~0 .cse7)))))) is different from false [2018-09-20 14:02:17,471 WARN L819 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_10 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse1 (fp.neg .cse0))) (and (fp.leq v_prenex_9 .cse0) (fp.geq v_prenex_9 .cse1) (fp.geq v_prenex_10 .cse1) (fp.leq v_prenex_10 .cse0) (not (fp.leq (fp.sub RNE (fp.add RNE (let ((.cse2 ((_ to_fp 11 53) RNE (/ 999.0 1000.0)))) (fp.mul RNE .cse2 (let ((.cse3 ((_ to_fp 11 53) RNE (_ bv0 32)))) (fp.sub RNE (fp.add RNE (fp.mul RNE .cse2 .cse3) v_prenex_9) .cse3)))) v_prenex_10) v_prenex_9) ((_ to_fp 11 53) RNE 10000.0))))))) (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse6 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse7 (fp.neg .cse6))) (and (not (fp.geq (fp.sub RNE (fp.add RNE (let ((.cse4 ((_ to_fp 11 53) RNE (/ 999.0 1000.0)))) (fp.mul RNE .cse4 (let ((.cse5 ((_ to_fp 11 53) RNE (_ bv0 32)))) (fp.sub RNE (fp.add RNE (fp.mul RNE .cse4 .cse5) main_~E1~0) .cse5)))) main_~E0~0) main_~E1~0) (fp.neg ((_ to_fp 11 53) RNE 10000.0)))) (fp.leq main_~E0~0 .cse6) (fp.geq main_~E1~0 .cse7) (fp.leq main_~E1~0 .cse6) (fp.geq main_~E0~0 .cse7)))))) is different from true [2018-09-20 14:02:17,476 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-09-20 14:02:17,476 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 14:02:19,652 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) c_main_~S~0) c_main_~E0~0) c_main_~E1~0)) (.cse1 ((_ to_fp 11 53) RNE 10000.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2018-09-20 14:02:23,328 WARN L819 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_15 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (or (not (fp.leq v_prenex_15 .cse0)) (fp.leq (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) c_main_~S~0) v_prenex_15) c_main_~E1~0) ((_ to_fp 11 53) RNE 10000.0)) (not (fp.geq v_prenex_15 (fp.neg .cse0)))))) (forall ((v_main_~E0~0_7 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) RNE 1.0))) (or (not (fp.leq v_main_~E0~0_7 .cse1)) (not (fp.geq v_main_~E0~0_7 (fp.neg .cse1))) (fp.geq (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) c_main_~S~0) v_main_~E0~0_7) c_main_~E1~0) (fp.neg ((_ to_fp 11 53) RNE 10000.0))))))) is different from true [2018-09-20 14:03:07,820 WARN L178 SmtUtils]: Spent 27.90 s on a formula simplification that was a NOOP. DAG size: 39 [2018-09-20 14:03:07,840 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-20 14:03:07,840 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-20 14:03:07,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 14:03:19,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-09-20 14:03:20,263 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-20 14:03:20,263 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-20 14:03:20,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-20 14:03:20,264 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-20 14:03:20,264 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=96, Unknown=15, NotChecked=150, Total=306 [2018-09-20 14:03:20,265 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 13 states. [2018-09-20 14:03:23,945 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (and (fp.leq c_main_~E0~0 .cse0) (fp.geq c_main_~E0~0 (fp.neg .cse0)) (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse2 (fp.neg .cse1))) (and (fp.leq main_~E0~0 .cse1) (fp.geq main_~E1~0 .cse2) (fp.leq main_~E1~0 .cse1) (fp.geq main_~E0~0 .cse2) (= (fp.sub RNE (fp.add RNE (let ((.cse3 ((_ to_fp 11 53) RNE (/ 999.0 1000.0)))) (fp.mul RNE .cse3 (let ((.cse4 ((_ to_fp 11 53) RNE (_ bv0 32)))) (fp.sub RNE (fp.add RNE (fp.mul RNE .cse3 .cse4) main_~E1~0) .cse4)))) main_~E0~0) main_~E1~0) c_main_~S~0))))) (= (let ((.cse5 ((_ to_fp 11 53) RNE (_ bv0 32)))) (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) .cse5) c_main_~E0~0) .cse5)) c_main_~S~0))) is different from false [2018-09-20 14:03:26,031 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (and (fp.geq c_main_~E1~0 (fp.neg .cse0)) (fp.leq c_main_~E1~0 .cse0) (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse2 (fp.neg .cse1))) (and (fp.leq main_~E0~0 .cse1) (fp.geq main_~E1~0 .cse2) (fp.leq main_~E1~0 .cse1) (fp.geq main_~E0~0 .cse2) (= (fp.sub RNE (fp.add RNE (let ((.cse3 ((_ to_fp 11 53) RNE (/ 999.0 1000.0)))) (fp.mul RNE .cse3 (let ((.cse4 ((_ to_fp 11 53) RNE (_ bv0 32)))) (fp.sub RNE (fp.add RNE (fp.mul RNE .cse3 .cse4) main_~E1~0) .cse4)))) main_~E0~0) main_~E1~0) c_main_~S~0))))) (= (let ((.cse5 ((_ to_fp 11 53) RNE (_ bv0 32)))) (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) .cse5) c_main_~E1~0) .cse5)) c_main_~S~0))) is different from false [2018-09-20 14:03:28,192 WARN L797 $PredicateComparison]: unable to prove that (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (let ((.cse6 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (or (and (exists ((v_prenex_12 (_ FloatingPoint 11 53)) (v_prenex_13 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse1 (fp.sub RNE (fp.add RNE (let ((.cse4 ((_ to_fp 11 53) RNE (/ 999.0 1000.0)))) (fp.mul RNE .cse4 (let ((.cse5 ((_ to_fp 11 53) RNE (_ bv0 32)))) (fp.sub RNE (fp.add RNE (fp.mul RNE .cse4 .cse5) v_prenex_12) .cse5)))) v_prenex_13) v_prenex_12)) (.cse2 ((_ to_fp 11 53) RNE 10000.0)) (.cse3 (fp.neg .cse0))) (and (fp.leq v_prenex_13 .cse0) (fp.geq .cse1 (fp.neg .cse2)) (fp.leq .cse1 .cse2) (fp.geq v_prenex_12 .cse3) (fp.geq v_prenex_13 .cse3) (fp.leq v_prenex_12 .cse0))))) (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))) (and .cse6 (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse9 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse10 (fp.neg .cse9))) (and (not (fp.geq (fp.sub RNE (fp.add RNE (let ((.cse7 ((_ to_fp 11 53) RNE (/ 999.0 1000.0)))) (fp.mul RNE .cse7 (let ((.cse8 ((_ to_fp 11 53) RNE (_ bv0 32)))) (fp.sub RNE (fp.add RNE (fp.mul RNE .cse7 .cse8) main_~E1~0) .cse8)))) main_~E0~0) main_~E1~0) (fp.neg ((_ to_fp 11 53) RNE 10000.0)))) (fp.leq main_~E0~0 .cse9) (fp.geq main_~E1~0 .cse10) (fp.leq main_~E1~0 .cse9) (fp.geq main_~E0~0 .cse10)))))) (and .cse6 (exists ((v_prenex_10 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53))) (let ((.cse11 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse12 (fp.neg .cse11))) (and (fp.leq v_prenex_9 .cse11) (fp.geq v_prenex_9 .cse12) (fp.geq v_prenex_10 .cse12) (fp.leq v_prenex_10 .cse11) (not (fp.leq (fp.sub RNE (fp.add RNE (let ((.cse13 ((_ to_fp 11 53) RNE (/ 999.0 1000.0)))) (fp.mul RNE .cse13 (let ((.cse14 ((_ to_fp 11 53) RNE (_ bv0 32)))) (fp.sub RNE (fp.add RNE (fp.mul RNE .cse13 .cse14) v_prenex_9) .cse14)))) v_prenex_10) v_prenex_9) ((_ to_fp 11 53) RNE 10000.0))))))))))) is different from false [2018-09-20 14:03:34,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:03:34,748 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2018-09-20 14:03:34,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-20 14:03:34,749 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-09-20 14:03:34,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:03:34,750 INFO L225 Difference]: With dead ends: 55 [2018-09-20 14:03:34,751 INFO L226 Difference]: Without dead ends: 53 [2018-09-20 14:03:34,751 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 71.7s TimeCoverageRelationStatistics Valid=56, Invalid=117, Unknown=19, NotChecked=270, Total=462 [2018-09-20 14:03:34,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-20 14:03:34,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 36. [2018-09-20 14:03:34,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-09-20 14:03:34,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-09-20 14:03:34,766 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 23 [2018-09-20 14:03:34,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:03:34,766 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2018-09-20 14:03:34,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-20 14:03:34,767 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-09-20 14:03:34,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-09-20 14:03:34,769 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:03:34,769 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 14:03:34,769 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:03:34,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1001818126, now seen corresponding path program 2 times [2018-09-20 14:03:34,770 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 14:03:34,771 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-09-20 14:03:34,782 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-09-20 14:03:36,371 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-20 14:03:36,371 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-20 14:03:36,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 14:03:38,815 WARN L797 $PredicateComparison]: unable to prove that (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53)) (v_main_~S~0_18 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse2 (fp.neg .cse1)) (.cse0 ((_ to_fp 11 53) RNE 10000.0))) (and (= (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) v_main_~S~0_18) main_~E0~0) main_~E1~0) c_main_~S~0) (fp.geq v_main_~S~0_18 (fp.neg .cse0)) (fp.leq main_~E0~0 .cse1) (fp.geq main_~E1~0 .cse2) (fp.leq main_~E1~0 .cse1) (fp.geq main_~E0~0 .cse2) (fp.leq v_main_~S~0_18 .cse0))))) is different from false [2018-09-20 14:03:40,869 WARN L819 $PredicateComparison]: unable to prove that (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53)) (v_main_~S~0_18 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse2 (fp.neg .cse1)) (.cse0 ((_ to_fp 11 53) RNE 10000.0))) (and (= (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) v_main_~S~0_18) main_~E0~0) main_~E1~0) c_main_~S~0) (fp.geq v_main_~S~0_18 (fp.neg .cse0)) (fp.leq main_~E0~0 .cse1) (fp.geq main_~E1~0 .cse2) (fp.leq main_~E1~0 .cse1) (fp.geq main_~E0~0 .cse2) (fp.leq v_main_~S~0_18 .cse0))))) is different from true [2018-09-20 14:03:57,424 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse3 (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (or (and (exists ((v_prenex_16 (_ FloatingPoint 11 53)) (v_prenex_17 (_ FloatingPoint 11 53)) (v_prenex_19 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse1 (fp.neg .cse2)) (.cse0 ((_ to_fp 11 53) RNE 10000.0))) (and (fp.leq v_prenex_19 .cse0) (fp.geq v_prenex_16 .cse1) (fp.geq v_prenex_17 .cse1) (fp.leq v_prenex_17 .cse2) (fp.leq v_prenex_16 .cse2) (fp.geq v_prenex_19 (fp.neg .cse0)) (not (fp.leq (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) v_prenex_19) v_prenex_17) v_prenex_16) .cse0)))))) .cse3) (and (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53)) (v_main_~S~0_18 (_ FloatingPoint 11 53))) (let ((.cse8 ((_ to_fp 11 53) RNE 10000.0)) (.cse5 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse6 (fp.neg .cse5)) (.cse7 (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) v_main_~S~0_18) main_~E0~0) main_~E1~0)) (.cse4 (fp.neg .cse8))) (and (fp.geq v_main_~S~0_18 .cse4) (fp.leq main_~E0~0 .cse5) (fp.geq main_~E1~0 .cse6) (fp.leq main_~E1~0 .cse5) (fp.geq main_~E0~0 .cse6) (fp.leq .cse7 .cse8) (fp.leq v_main_~S~0_18 .cse8) (fp.geq .cse7 .cse4)))))) (and (exists ((v_prenex_23 (_ FloatingPoint 11 53)) (v_prenex_21 (_ FloatingPoint 11 53)) (v_prenex_20 (_ FloatingPoint 11 53))) (let ((.cse9 ((_ to_fp 11 53) RNE 1.0)) (.cse12 ((_ to_fp 11 53) RNE 10000.0))) (let ((.cse10 (fp.neg .cse12)) (.cse11 (fp.neg .cse9))) (and (fp.leq v_prenex_20 .cse9) (fp.geq v_prenex_23 .cse10) (fp.geq v_prenex_20 .cse11) (fp.leq v_prenex_23 .cse12) (not (fp.geq (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) v_prenex_23) v_prenex_21) v_prenex_20) .cse10)) (fp.geq v_prenex_21 .cse11) (fp.leq v_prenex_21 .cse9))))) .cse3))) is different from false [2018-09-20 14:04:11,955 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse5 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (or (and (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53)) (v_main_~S~0_18 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) RNE 10000.0)) (.cse1 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse2 (fp.neg .cse1)) (.cse3 (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) v_main_~S~0_18) main_~E0~0) main_~E1~0)) (.cse0 (fp.neg .cse4))) (and (fp.geq v_main_~S~0_18 .cse0) (fp.leq main_~E0~0 .cse1) (fp.geq main_~E1~0 .cse2) (fp.leq main_~E1~0 .cse1) (fp.geq main_~E0~0 .cse2) (fp.leq .cse3 .cse4) (fp.leq v_main_~S~0_18 .cse4) (fp.geq .cse3 .cse0))))) (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))) (and .cse5 (exists ((v_prenex_16 (_ FloatingPoint 11 53)) (v_prenex_17 (_ FloatingPoint 11 53)) (v_prenex_19 (_ FloatingPoint 11 53))) (let ((.cse8 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse7 (fp.neg .cse8)) (.cse6 ((_ to_fp 11 53) RNE 10000.0))) (and (fp.leq v_prenex_19 .cse6) (fp.geq v_prenex_16 .cse7) (fp.geq v_prenex_17 .cse7) (fp.leq v_prenex_17 .cse8) (fp.leq v_prenex_16 .cse8) (fp.geq v_prenex_19 (fp.neg .cse6)) (not (fp.leq (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) v_prenex_19) v_prenex_17) v_prenex_16) .cse6))))))) (and .cse5 (exists ((v_prenex_23 (_ FloatingPoint 11 53)) (v_prenex_21 (_ FloatingPoint 11 53)) (v_prenex_20 (_ FloatingPoint 11 53))) (let ((.cse9 ((_ to_fp 11 53) RNE 1.0)) (.cse12 ((_ to_fp 11 53) RNE 10000.0))) (let ((.cse10 (fp.neg .cse12)) (.cse11 (fp.neg .cse9))) (and (fp.leq v_prenex_20 .cse9) (fp.geq v_prenex_23 .cse10) (fp.geq v_prenex_20 .cse11) (fp.leq v_prenex_23 .cse12) (not (fp.geq (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) v_prenex_23) v_prenex_21) v_prenex_20) .cse10)) (fp.geq v_prenex_21 .cse11) (fp.leq v_prenex_21 .cse9)))))))) is different from false [2018-09-20 14:04:22,248 WARN L797 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_16 (_ FloatingPoint 11 53)) (v_prenex_17 (_ FloatingPoint 11 53)) (v_prenex_19 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse1 (fp.neg .cse2)) (.cse0 ((_ to_fp 11 53) RNE 10000.0))) (and (fp.leq v_prenex_19 .cse0) (fp.geq v_prenex_16 .cse1) (fp.geq v_prenex_17 .cse1) (fp.leq v_prenex_17 .cse2) (fp.leq v_prenex_16 .cse2) (fp.geq v_prenex_19 (fp.neg .cse0)) (not (fp.leq (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) v_prenex_19) v_prenex_17) v_prenex_16) .cse0)))))) (exists ((v_prenex_23 (_ FloatingPoint 11 53)) (v_prenex_21 (_ FloatingPoint 11 53)) (v_prenex_20 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) RNE 1.0)) (.cse6 ((_ to_fp 11 53) RNE 10000.0))) (let ((.cse4 (fp.neg .cse6)) (.cse5 (fp.neg .cse3))) (and (fp.leq v_prenex_20 .cse3) (fp.geq v_prenex_23 .cse4) (fp.geq v_prenex_20 .cse5) (fp.leq v_prenex_23 .cse6) (not (fp.geq (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) v_prenex_23) v_prenex_21) v_prenex_20) .cse4)) (fp.geq v_prenex_21 .cse5) (fp.leq v_prenex_21 .cse3)))))) is different from false [2018-09-20 14:04:24,304 WARN L819 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_16 (_ FloatingPoint 11 53)) (v_prenex_17 (_ FloatingPoint 11 53)) (v_prenex_19 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse1 (fp.neg .cse2)) (.cse0 ((_ to_fp 11 53) RNE 10000.0))) (and (fp.leq v_prenex_19 .cse0) (fp.geq v_prenex_16 .cse1) (fp.geq v_prenex_17 .cse1) (fp.leq v_prenex_17 .cse2) (fp.leq v_prenex_16 .cse2) (fp.geq v_prenex_19 (fp.neg .cse0)) (not (fp.leq (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) v_prenex_19) v_prenex_17) v_prenex_16) .cse0)))))) (exists ((v_prenex_23 (_ FloatingPoint 11 53)) (v_prenex_21 (_ FloatingPoint 11 53)) (v_prenex_20 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) RNE 1.0)) (.cse6 ((_ to_fp 11 53) RNE 10000.0))) (let ((.cse4 (fp.neg .cse6)) (.cse5 (fp.neg .cse3))) (and (fp.leq v_prenex_20 .cse3) (fp.geq v_prenex_23 .cse4) (fp.geq v_prenex_20 .cse5) (fp.leq v_prenex_23 .cse6) (not (fp.geq (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) v_prenex_23) v_prenex_21) v_prenex_20) .cse4)) (fp.geq v_prenex_21 .cse5) (fp.leq v_prenex_21 .cse3)))))) is different from true [2018-09-20 14:04:24,310 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2018-09-20 14:04:24,310 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 14:04:26,424 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) c_main_~S~0) c_main_~E0~0) c_main_~E1~0)) (.cse1 ((_ to_fp 11 53) RNE 10000.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2018-09-20 14:04:28,477 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) c_main_~S~0) c_main_~E0~0) c_main_~E1~0)) (.cse1 ((_ to_fp 11 53) RNE 10000.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from true [2018-09-20 14:04:30,558 WARN L819 $PredicateComparison]: unable to prove that (and (forall ((v_main_~E0~0_8 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (or (fp.geq (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) c_main_~S~0) v_main_~E0~0_8) c_main_~E1~0) (fp.neg ((_ to_fp 11 53) RNE 10000.0))) (not (fp.leq v_main_~E0~0_8 .cse0)) (not (fp.geq v_main_~E0~0_8 (fp.neg .cse0)))))) (forall ((v_prenex_24 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) RNE 1.0))) (or (not (fp.geq v_prenex_24 (fp.neg .cse1))) (not (fp.leq v_prenex_24 .cse1)) (fp.leq (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) c_main_~S~0) v_prenex_24) c_main_~E1~0) ((_ to_fp 11 53) RNE 10000.0)))))) is different from true [2018-09-20 14:04:32,659 WARN L797 $PredicateComparison]: unable to prove that (and (forall ((v_main_~E0~0_8 (_ FloatingPoint 11 53)) (main_~S~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) RNE 10000.0))) (let ((.cse1 ((_ to_fp 11 53) RNE 1.0)) (.cse0 (fp.neg .cse2))) (or (fp.geq (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) main_~S~0) v_main_~E0~0_8) c_main_~E1~0) .cse0) (not (fp.leq v_main_~E0~0_8 .cse1)) (not (fp.leq main_~S~0 .cse2)) (not (fp.geq v_main_~E0~0_8 (fp.neg .cse1))) (not (fp.geq main_~S~0 .cse0)))))) (forall ((v_prenex_26 (_ FloatingPoint 11 53)) (v_prenex_24 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) RNE 1.0)) (.cse3 ((_ to_fp 11 53) RNE 10000.0))) (or (fp.leq (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) v_prenex_26) v_prenex_24) c_main_~E1~0) .cse3) (not (fp.leq v_prenex_26 .cse3)) (not (fp.geq v_prenex_24 (fp.neg .cse4))) (not (fp.leq v_prenex_24 .cse4)) (not (fp.geq v_prenex_26 (fp.neg .cse3))))))) is different from false [2018-09-20 14:04:34,767 WARN L819 $PredicateComparison]: unable to prove that (and (forall ((v_main_~E0~0_8 (_ FloatingPoint 11 53)) (main_~S~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) RNE 10000.0))) (let ((.cse1 ((_ to_fp 11 53) RNE 1.0)) (.cse0 (fp.neg .cse2))) (or (fp.geq (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) main_~S~0) v_main_~E0~0_8) c_main_~E1~0) .cse0) (not (fp.leq v_main_~E0~0_8 .cse1)) (not (fp.leq main_~S~0 .cse2)) (not (fp.geq v_main_~E0~0_8 (fp.neg .cse1))) (not (fp.geq main_~S~0 .cse0)))))) (forall ((v_prenex_26 (_ FloatingPoint 11 53)) (v_prenex_24 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) RNE 1.0)) (.cse3 ((_ to_fp 11 53) RNE 10000.0))) (or (fp.leq (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) v_prenex_26) v_prenex_24) c_main_~E1~0) .cse3) (not (fp.leq v_prenex_26 .cse3)) (not (fp.geq v_prenex_24 (fp.neg .cse4))) (not (fp.leq v_prenex_24 .cse4)) (not (fp.geq v_prenex_26 (fp.neg .cse3))))))) is different from true [2018-09-20 14:04:34,785 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-20 14:04:34,785 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-20 14:04:34,797 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-20 14:04:48,682 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-20 14:04:48,683 INFO L243 tOrderPrioritization]: Conjunction of SSA is unknown [2018-09-20 14:04:48,925 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-20 14:04:48,925 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-20 14:04:48,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-20 14:04:48,926 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-20 14:04:48,926 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=70, Unknown=11, NotChecked=154, Total=272 [2018-09-20 14:04:48,926 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 12 states. [2018-09-20 14:04:57,449 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse1 (fp.neg .cse0))) (and (fp.leq c_main_~E0~0 .cse0) (fp.geq c_main_~E1~0 .cse1) (fp.leq c_main_~E1~0 .cse0) (fp.geq c_main_~E0~0 .cse1) (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53)) (v_main_~S~0_18 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse4 (fp.neg .cse3)) (.cse2 ((_ to_fp 11 53) RNE 10000.0))) (and (= (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) v_main_~S~0_18) main_~E0~0) main_~E1~0) c_main_~S~0) (fp.geq v_main_~S~0_18 (fp.neg .cse2)) (fp.leq main_~E0~0 .cse3) (fp.geq main_~E1~0 .cse4) (fp.leq main_~E1~0 .cse3) (fp.geq main_~E0~0 .cse4) (fp.leq v_main_~S~0_18 .cse2)))))))) is different from false [2018-09-20 14:04:59,533 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (and (fp.geq c_main_~E1~0 (fp.neg .cse0)) (fp.leq c_main_~E1~0 .cse0) (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53)) (v_main_~S~0_18 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse3 (fp.neg .cse2)) (.cse1 ((_ to_fp 11 53) RNE 10000.0))) (and (= (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) v_main_~S~0_18) main_~E0~0) main_~E1~0) c_main_~S~0) (fp.geq v_main_~S~0_18 (fp.neg .cse1)) (fp.leq main_~E0~0 .cse2) (fp.geq main_~E1~0 .cse3) (fp.leq main_~E1~0 .cse2) (fp.geq main_~E0~0 .cse3) (fp.leq v_main_~S~0_18 .cse1))))))) is different from false [2018-09-20 14:05:01,713 WARN L797 $PredicateComparison]: unable to prove that (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (let ((.cse5 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (or (and (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53)) (v_main_~S~0_18 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) RNE 10000.0)) (.cse1 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse2 (fp.neg .cse1)) (.cse3 (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) v_main_~S~0_18) main_~E0~0) main_~E1~0)) (.cse0 (fp.neg .cse4))) (and (fp.geq v_main_~S~0_18 .cse0) (fp.leq main_~E0~0 .cse1) (fp.geq main_~E1~0 .cse2) (fp.leq main_~E1~0 .cse1) (fp.geq main_~E0~0 .cse2) (fp.leq .cse3 .cse4) (fp.leq v_main_~S~0_18 .cse4) (fp.geq .cse3 .cse0))))) (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))) (and .cse5 (exists ((v_prenex_16 (_ FloatingPoint 11 53)) (v_prenex_17 (_ FloatingPoint 11 53)) (v_prenex_19 (_ FloatingPoint 11 53))) (let ((.cse8 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse7 (fp.neg .cse8)) (.cse6 ((_ to_fp 11 53) RNE 10000.0))) (and (fp.leq v_prenex_19 .cse6) (fp.geq v_prenex_16 .cse7) (fp.geq v_prenex_17 .cse7) (fp.leq v_prenex_17 .cse8) (fp.leq v_prenex_16 .cse8) (fp.geq v_prenex_19 (fp.neg .cse6)) (not (fp.leq (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) v_prenex_19) v_prenex_17) v_prenex_16) .cse6))))))) (and .cse5 (exists ((v_prenex_23 (_ FloatingPoint 11 53)) (v_prenex_21 (_ FloatingPoint 11 53)) (v_prenex_20 (_ FloatingPoint 11 53))) (let ((.cse9 ((_ to_fp 11 53) RNE 1.0)) (.cse12 ((_ to_fp 11 53) RNE 10000.0))) (let ((.cse10 (fp.neg .cse12)) (.cse11 (fp.neg .cse9))) (and (fp.leq v_prenex_20 .cse9) (fp.geq v_prenex_23 .cse10) (fp.geq v_prenex_20 .cse11) (fp.leq v_prenex_23 .cse12) (not (fp.geq (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) v_prenex_23) v_prenex_21) v_prenex_20) .cse10)) (fp.geq v_prenex_21 .cse11) (fp.leq v_prenex_21 .cse9))))))))) is different from false [2018-09-20 14:05:01,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:05:01,764 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-09-20 14:05:01,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-20 14:05:01,767 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2018-09-20 14:05:01,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:05:01,770 INFO L225 Difference]: With dead ends: 45 [2018-09-20 14:05:01,770 INFO L226 Difference]: Without dead ends: 0 [2018-09-20 14:05:01,771 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 29.7s TimeCoverageRelationStatistics Valid=48, Invalid=88, Unknown=14, NotChecked=270, Total=420 [2018-09-20 14:05:01,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-20 14:05:01,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-20 14:05:01,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-20 14:05:01,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-20 14:05:01,772 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2018-09-20 14:05:01,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:05:01,775 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-20 14:05:01,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-20 14:05:01,776 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-20 14:05:01,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-20 14:05:01,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-20 14:05:01,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-20 14:07:02,410 WARN L178 SmtUtils]: Spent 2.01 m on a formula simplification. DAG size of input: 202 DAG size of output: 1 [2018-09-20 14:08:41,369 WARN L178 SmtUtils]: Spent 1.65 m on a formula simplification. DAG size of input: 56 DAG size of output: 37 [2018-09-20 14:08:41,615 WARN L178 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 23 [2018-09-20 14:08:41,619 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-09-20 14:08:41,619 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-20 14:08:41,619 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-20 14:08:41,619 INFO L429 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-09-20 14:08:41,620 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-20 14:08:41,620 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-20 14:08:41,620 INFO L429 ceAbstractionStarter]: At program point mainENTRY(lines 15 39) the Hoare annotation is: true [2018-09-20 14:08:41,620 INFO L426 ceAbstractionStarter]: For program point L28(lines 28 33) no Hoare annotation was computed. [2018-09-20 14:08:41,620 INFO L426 ceAbstractionStarter]: For program point L28-2(lines 28 33) no Hoare annotation was computed. [2018-09-20 14:08:41,620 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 15 39) no Hoare annotation was computed. [2018-09-20 14:08:41,620 INFO L426 ceAbstractionStarter]: For program point L23-1(lines 23 37) no Hoare annotation was computed. [2018-09-20 14:08:41,621 INFO L422 ceAbstractionStarter]: At program point L23-3(lines 23 37) the Hoare annotation is: (or (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse1 (fp.neg .cse0)) (.cse2 ((_ to_fp 11 53) RNE 10000.0))) (and (fp.leq main_~E0~0 .cse0) (fp.geq main_~E1~0 .cse1) (fp.leq main_~E1~0 .cse0) (fp.geq main_~E0~0 .cse1) (fp.geq main_~S~0 (fp.neg .cse2)) (fp.leq main_~S~0 .cse2)))) (let ((.cse3 ((_ to_fp 11 53) RNE (_ bv0 32)))) (and (= .cse3 main_~S~0) (= main_~E1~0 .cse3)))) [2018-09-20 14:08:41,621 INFO L426 ceAbstractionStarter]: For program point L23-4(lines 23 37) no Hoare annotation was computed. [2018-09-20 14:08:41,621 INFO L426 ceAbstractionStarter]: For program point mainFINAL(lines 15 39) no Hoare annotation was computed. [2018-09-20 14:08:41,621 INFO L422 ceAbstractionStarter]: At program point L36(line 36) the Hoare annotation is: (let ((.cse10 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse9 (fp.neg .cse10))) (let ((.cse0 (fp.leq main_~E0~0 .cse10)) (.cse1 (fp.geq main_~E1~0 .cse9)) (.cse2 (fp.leq main_~E1~0 .cse10)) (.cse3 (fp.geq main_~E0~0 .cse9))) (or (and .cse0 .cse1 .cse2 (= ((_ to_fp 11 53) RNE (_ bv0 32)) main_~S~0) .cse3 (exists ((main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) RNE 1.0))) (and (fp.leq main_~E0~0 .cse4) (fp.geq main_~E0~0 (fp.neg .cse4)) (= (let ((.cse5 ((_ to_fp 11 53) RNE (_ bv0 32)))) (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) .cse5) main_~E0~0) .cse5)) main_~S~0))))) (and .cse0 .cse1 .cse2 .cse3 (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53)) (v_main_~S~0_18 (_ FloatingPoint 11 53))) (let ((.cse7 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse8 (fp.neg .cse7)) (.cse6 ((_ to_fp 11 53) RNE 10000.0))) (and (= (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) v_main_~S~0_18) main_~E0~0) main_~E1~0) main_~S~0) (fp.geq v_main_~S~0_18 (fp.neg .cse6)) (fp.leq main_~E0~0 .cse7) (fp.geq main_~E1~0 .cse8) (fp.leq main_~E1~0 .cse7) (fp.geq main_~E0~0 .cse8) (fp.leq v_main_~S~0_18 .cse6)))))))))) [2018-09-20 14:08:41,621 INFO L426 ceAbstractionStarter]: For program point L36-1(lines 23 37) no Hoare annotation was computed. [2018-09-20 14:08:41,621 INFO L429 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(line 12) the Hoare annotation is: true [2018-09-20 14:08:41,621 INFO L426 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2018-09-20 14:08:41,621 INFO L426 ceAbstractionStarter]: For program point L12-1(line 12) no Hoare annotation was computed. [2018-09-20 14:08:41,622 INFO L426 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(line 12) no Hoare annotation was computed. [2018-09-20 14:08:41,622 INFO L426 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2018-09-20 14:08:41,622 INFO L426 ceAbstractionStarter]: For program point L12-3(line 12) no Hoare annotation was computed. [2018-09-20 14:08:41,627 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (fp.leq (_ FloatingPoint 11 53) (_ FloatingPoint 11 53) Bool) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:539) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:234) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:128) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:164) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:128) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:164) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:128) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:356) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:108) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:92) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:238) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:195) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-09-20 14:08:41,630 INFO L168 Benchmark]: Toolchain (without parser) took 705872.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 953.2 MB in the beginning and 1.1 GB in the end (delta: -146.2 MB). Peak memory consumption was 290.9 MB. Max. memory is 11.5 GB. [2018-09-20 14:08:41,636 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 14:08:41,637 INFO L168 Benchmark]: CACSL2BoogieTranslator took 371.24 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-09-20 14:08:41,638 INFO L168 Benchmark]: Boogie Preprocessor took 37.90 ms. Allocated memory is still 1.0 GB. Free memory is still 942.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 14:08:41,638 INFO L168 Benchmark]: RCFGBuilder took 1275.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -184.7 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. [2018-09-20 14:08:41,643 INFO L168 Benchmark]: TraceAbstraction took 704176.26 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -5.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.8 MB). Peak memory consumption was 318.1 MB. Max. memory is 11.5 GB. [2018-09-20 14:08:41,652 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.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 371.24 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.90 ms. Allocated memory is still 1.0 GB. Free memory is still 942.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1275.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -184.7 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 704176.26 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -5.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.8 MB). Peak memory consumption was 318.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (fp.leq (_ FloatingPoint 11 53) (_ FloatingPoint 11 53) Bool) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (fp.leq (_ FloatingPoint 11 53) (_ FloatingPoint 11 53) Bool): de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:539) RESULT: Ultimate could not prove your program: Toolchain returned no result. [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...