./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1211b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2880296f Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1211b.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b1a3baf542071d98053e6ea7d2c93dcbd3d31b35 ................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1211b.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b1a3baf542071d98053e6ea7d2c93dcbd3d31b35 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.2.0-2880296 [2020-12-02 15:34:27,829 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-02 15:34:27,833 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-02 15:34:27,888 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-02 15:34:27,889 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-02 15:34:27,891 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-02 15:34:27,893 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-02 15:34:27,895 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-02 15:34:27,898 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-02 15:34:27,899 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-02 15:34:27,901 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-02 15:34:27,902 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-02 15:34:27,903 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-02 15:34:27,904 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-02 15:34:27,906 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-02 15:34:27,907 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-02 15:34:27,909 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-02 15:34:27,910 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-02 15:34:27,912 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-02 15:34:27,915 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-02 15:34:27,917 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-02 15:34:27,919 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-02 15:34:27,921 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-02 15:34:27,922 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-02 15:34:27,925 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-02 15:34:27,926 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-02 15:34:27,927 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-02 15:34:27,928 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-02 15:34:27,929 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-02 15:34:27,930 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-02 15:34:27,931 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-02 15:34:27,932 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-02 15:34:27,934 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-02 15:34:27,935 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-02 15:34:27,936 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-02 15:34:27,937 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-02 15:34:27,938 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-02 15:34:27,938 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-02 15:34:27,939 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-02 15:34:27,940 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-02 15:34:27,941 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-02 15:34:27,945 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-12-02 15:34:27,975 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-02 15:34:27,976 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-02 15:34:27,978 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-02 15:34:27,978 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-02 15:34:27,979 INFO L138 SettingsManager]: * Use SBE=true [2020-12-02 15:34:27,979 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-02 15:34:27,979 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-02 15:34:27,980 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-02 15:34:27,980 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-02 15:34:27,981 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-02 15:34:27,981 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-02 15:34:27,982 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-02 15:34:27,982 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-02 15:34:27,982 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-02 15:34:27,983 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-02 15:34:27,983 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-02 15:34:27,984 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-02 15:34:27,984 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-02 15:34:27,984 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-02 15:34:27,985 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-02 15:34:27,985 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-02 15:34:27,985 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 15:34:27,986 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-02 15:34:27,986 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-02 15:34:27,987 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-02 15:34:27,987 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-02 15:34:27,987 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-02 15:34:27,988 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-02 15:34:27,988 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-02 15:34:27,988 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(reach_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 -> b1a3baf542071d98053e6ea7d2c93dcbd3d31b35 [2020-12-02 15:34:28,386 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-02 15:34:28,414 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-02 15:34:28,417 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-02 15:34:28,419 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-02 15:34:28,420 INFO L275 PluginConnector]: CDTParser initialized [2020-12-02 15:34:28,421 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1211b.c [2020-12-02 15:34:28,497 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6230e8e58/74e2d5094b00476cb31081431de362a6/FLAG603060d35 [2020-12-02 15:34:29,116 INFO L306 CDTParser]: Found 1 translation units. [2020-12-02 15:34:29,117 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1211b.c [2020-12-02 15:34:29,125 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6230e8e58/74e2d5094b00476cb31081431de362a6/FLAG603060d35 [2020-12-02 15:34:29,445 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6230e8e58/74e2d5094b00476cb31081431de362a6 [2020-12-02 15:34:29,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-02 15:34:29,451 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-02 15:34:29,453 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-02 15:34:29,453 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-02 15:34:29,460 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-02 15:34:29,461 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:34:29" (1/1) ... [2020-12-02 15:34:29,466 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bd23d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:29, skipping insertion in model container [2020-12-02 15:34:29,467 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:34:29" (1/1) ... [2020-12-02 15:34:29,476 INFO L146 MainTranslator]: Starting translation in SV-COMP mode [2020-12-02 15:34:29,521 INFO L179 MainTranslator]: Built tables and reachable declarations [2020-12-02 15:34:29,747 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1211b.c[3718,3731] [2020-12-02 15:34:29,757 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-12-02 15:34:29,773 INFO L212 MainTranslator]: Completed pre-run [2020-12-02 15:34:29,830 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1211b.c[3718,3731] [2020-12-02 15:34:29,831 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-12-02 15:34:29,849 INFO L217 MainTranslator]: Completed translation [2020-12-02 15:34:29,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:29 WrapperNode [2020-12-02 15:34:29,850 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-02 15:34:29,852 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-02 15:34:29,852 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-02 15:34:29,852 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-02 15:34:29,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:29" (1/1) ... [2020-12-02 15:34:29,874 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:29" (1/1) ... [2020-12-02 15:34:29,915 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-02 15:34:29,916 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-02 15:34:29,916 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-02 15:34:29,933 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-02 15:34:29,942 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:29" (1/1) ... [2020-12-02 15:34:29,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:29" (1/1) ... [2020-12-02 15:34:29,958 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:29" (1/1) ... [2020-12-02 15:34:29,958 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:29" (1/1) ... [2020-12-02 15:34:29,995 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:29" (1/1) ... [2020-12-02 15:34:30,017 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:29" (1/1) ... [2020-12-02 15:34:30,021 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:29" (1/1) ... [2020-12-02 15:34:30,033 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-02 15:34:30,035 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-02 15:34:30,035 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-02 15:34:30,035 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-02 15:34:30,036 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:29" (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 [2020-12-02 15:34:30,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-02 15:34:30,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-02 15:34:30,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-12-02 15:34:30,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-02 15:34:30,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-12-02 15:34:30,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-02 15:34:30,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-02 15:34:30,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2020-12-02 15:34:30,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-02 15:34:30,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-02 15:34:30,853 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-02 15:34:30,854 INFO L298 CfgBuilder]: Removed 34 assume(true) statements. [2020-12-02 15:34:30,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:34:30 BoogieIcfgContainer [2020-12-02 15:34:30,856 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-02 15:34:30,858 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-02 15:34:30,859 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-02 15:34:30,863 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-02 15:34:30,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:34:29" (1/3) ... [2020-12-02 15:34:30,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@acc4df7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:34:30, skipping insertion in model container [2020-12-02 15:34:30,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:29" (2/3) ... [2020-12-02 15:34:30,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@acc4df7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:34:30, skipping insertion in model container [2020-12-02 15:34:30,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:34:30" (3/3) ... [2020-12-02 15:34:30,868 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1211b.c [2020-12-02 15:34:30,886 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-02 15:34:30,891 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-02 15:34:30,905 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-02 15:34:30,937 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-02 15:34:30,937 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-02 15:34:30,937 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-02 15:34:30,937 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-02 15:34:30,938 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-02 15:34:30,938 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-02 15:34:30,938 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-02 15:34:30,938 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-02 15:34:30,956 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2020-12-02 15:34:30,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-02 15:34:30,963 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 15:34:30,964 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 15:34:30,965 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 15:34:30,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 15:34:30,976 INFO L82 PathProgramCache]: Analyzing trace with hash -892017235, now seen corresponding path program 1 times [2020-12-02 15:34:30,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 15:34:30,987 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477162301] [2020-12-02 15:34:30,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 15:34:31,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 15:34:31,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 15:34:31,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477162301] [2020-12-02 15:34:31,160 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 15:34:31,160 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-02 15:34:31,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725564798] [2020-12-02 15:34:31,166 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-02 15:34:31,166 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 15:34:31,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-02 15:34:31,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-02 15:34:31,185 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 2 states. [2020-12-02 15:34:31,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 15:34:31,211 INFO L93 Difference]: Finished difference Result 102 states and 164 transitions. [2020-12-02 15:34:31,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-02 15:34:31,213 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2020-12-02 15:34:31,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 15:34:31,225 INFO L225 Difference]: With dead ends: 102 [2020-12-02 15:34:31,225 INFO L226 Difference]: Without dead ends: 49 [2020-12-02 15:34:31,229 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-02 15:34:31,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-12-02 15:34:31,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-12-02 15:34:31,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-12-02 15:34:31,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2020-12-02 15:34:31,281 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 15 [2020-12-02 15:34:31,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 15:34:31,282 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2020-12-02 15:34:31,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-02 15:34:31,282 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2020-12-02 15:34:31,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-02 15:34:31,284 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 15:34:31,284 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 15:34:31,284 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-02 15:34:31,284 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 15:34:31,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 15:34:31,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1752581688, now seen corresponding path program 1 times [2020-12-02 15:34:31,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 15:34:31,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439083208] [2020-12-02 15:34:31,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 15:34:31,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 15:34:31,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 15:34:31,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439083208] [2020-12-02 15:34:31,479 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 15:34:31,479 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-02 15:34:31,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737760571] [2020-12-02 15:34:31,481 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-02 15:34:31,481 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 15:34:31,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-02 15:34:31,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 15:34:31,482 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 3 states. [2020-12-02 15:34:31,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 15:34:31,501 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2020-12-02 15:34:31,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-02 15:34:31,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-12-02 15:34:31,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 15:34:31,503 INFO L225 Difference]: With dead ends: 52 [2020-12-02 15:34:31,503 INFO L226 Difference]: Without dead ends: 49 [2020-12-02 15:34:31,504 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 15:34:31,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-12-02 15:34:31,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-12-02 15:34:31,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-12-02 15:34:31,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2020-12-02 15:34:31,512 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 18 [2020-12-02 15:34:31,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 15:34:31,512 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2020-12-02 15:34:31,513 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-02 15:34:31,513 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2020-12-02 15:34:31,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-02 15:34:31,514 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 15:34:31,514 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 15:34:31,514 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-02 15:34:31,514 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 15:34:31,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 15:34:31,515 INFO L82 PathProgramCache]: Analyzing trace with hash 581418946, now seen corresponding path program 1 times [2020-12-02 15:34:31,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 15:34:31,516 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914940099] [2020-12-02 15:34:31,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 15:34:31,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-02 15:34:31,685 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-02 15:34:31,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-02 15:34:31,754 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-02 15:34:31,812 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-02 15:34:31,813 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-02 15:34:31,813 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-02 15:34:31,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 03:34:31 BoogieIcfgContainer [2020-12-02 15:34:31,862 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-02 15:34:31,863 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-02 15:34:31,863 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-02 15:34:31,863 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-02 15:34:31,864 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:34:30" (3/4) ... [2020-12-02 15:34:31,868 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-12-02 15:34:31,868 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-02 15:34:31,871 INFO L168 Benchmark]: Toolchain (without parser) took 2418.75 ms. Allocated memory was 46.1 MB in the beginning and 73.4 MB in the end (delta: 27.3 MB). Free memory was 22.8 MB in the beginning and 49.2 MB in the end (delta: -26.4 MB). Peak memory consumption was 3.0 MB. Max. memory is 16.1 GB. [2020-12-02 15:34:31,872 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 46.1 MB. Free memory was 28.0 MB in the beginning and 27.9 MB in the end (delta: 63.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 15:34:31,873 INFO L168 Benchmark]: CACSL2BoogieTranslator took 397.49 ms. Allocated memory is still 46.1 MB. Free memory was 22.6 MB in the beginning and 21.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. [2020-12-02 15:34:31,873 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.71 ms. Allocated memory is still 46.1 MB. Free memory was 21.3 MB in the beginning and 18.9 MB in the end (delta: 2.4 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 15:34:31,875 INFO L168 Benchmark]: Boogie Preprocessor took 117.68 ms. Allocated memory was 46.1 MB in the beginning and 60.8 MB in the end (delta: 14.7 MB). Free memory was 18.9 MB in the beginning and 42.5 MB in the end (delta: -23.6 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. [2020-12-02 15:34:31,875 INFO L168 Benchmark]: RCFGBuilder took 821.92 ms. Allocated memory is still 60.8 MB. Free memory was 42.5 MB in the beginning and 39.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-12-02 15:34:31,876 INFO L168 Benchmark]: TraceAbstraction took 1003.80 ms. Allocated memory was 60.8 MB in the beginning and 73.4 MB in the end (delta: 12.6 MB). Free memory was 39.3 MB in the beginning and 49.8 MB in the end (delta: -10.5 MB). Peak memory consumption was 23.4 MB. Max. memory is 16.1 GB. [2020-12-02 15:34:31,877 INFO L168 Benchmark]: Witness Printer took 5.39 ms. Allocated memory is still 73.4 MB. Free memory was 49.8 MB in the beginning and 49.2 MB in the end (delta: 515.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 15:34:31,883 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 46.1 MB. Free memory was 28.0 MB in the beginning and 27.9 MB in the end (delta: 63.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 397.49 ms. Allocated memory is still 46.1 MB. Free memory was 22.6 MB in the beginning and 21.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 63.71 ms. Allocated memory is still 46.1 MB. Free memory was 21.3 MB in the beginning and 18.9 MB in the end (delta: 2.4 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 117.68 ms. Allocated memory was 46.1 MB in the beginning and 60.8 MB in the end (delta: 14.7 MB). Free memory was 18.9 MB in the beginning and 42.5 MB in the end (delta: -23.6 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. * RCFGBuilder took 821.92 ms. Allocated memory is still 60.8 MB. Free memory was 42.5 MB in the beginning and 39.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 1003.80 ms. Allocated memory was 60.8 MB in the beginning and 73.4 MB in the end (delta: 12.6 MB). Free memory was 39.3 MB in the beginning and 49.8 MB in the end (delta: -10.5 MB). Peak memory consumption was 23.4 MB. Max. memory is 16.1 GB. * Witness Printer took 5.39 ms. Allocated memory is still 73.4 MB. Free memory was 49.8 MB in the beginning and 49.2 MB in the end (delta: 515.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 152]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 122, overapproximation of bitwiseAnd at line 121, overapproximation of someBinaryArithmeticDOUBLE_SMToperation at line 146, overapproximation of someBinaryDOUBLE_SMTComparisonOperation at line 151. Possible FailurePath: [L20] static const double one_modf = 1.0; VAL [one_modf=1] [L146] double x = -1.0 / 0.0; [L147] double iptr = __VERIFIER_nondet_double(); [L23] __int32_t i0, i1, j0; [L24] __uint32_t i; VAL [one_modf=1] [L26] ieee_double_shape_type ew_u; [L27] ew_u.value = (x) [L28] EXPR ew_u.parts.msw [L28] (i0) = ew_u.parts.msw [L29] EXPR ew_u.parts.lsw [L29] (i1) = ew_u.parts.lsw [L31] j0 = ((i0 >> 20) & 0x7ff) - 0x3ff VAL [one_modf=1] [L32] COND TRUE j0 < 20 VAL [one_modf=1] [L33] COND TRUE j0 < 0 VAL [one_modf=1] [L35] ieee_double_shape_type iw_u; [L36] iw_u.parts.msw = (i0 & 0x80000000) [L37] iw_u.parts.lsw = (0) [L38] EXPR iw_u.value [L38] (*iptr) = iw_u.value [L40] return x; VAL [one_modf=1] [L148] double res = modf_double(x, &iptr); [L151] EXPR \read(iptr) [L114] __int32_t hx, lx; VAL [one_modf=1] [L116] ieee_double_shape_type ew_u; [L117] ew_u.value = (x) [L118] EXPR ew_u.parts.msw [L118] (hx) = ew_u.parts.msw [L119] EXPR ew_u.parts.lsw [L119] (lx) = ew_u.parts.lsw [L121] hx &= 0x7fffffff [L122] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L123] hx = 0x7ff00000 - hx [L124] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); VAL [one_modf=1] [L151] isinf_double(iptr) && !(res == -0.0 && __signbit_double(res) == 1) [L151] EXPR res == -0.0 && __signbit_double(res) == 1 VAL [one_modf=1] [L151] isinf_double(iptr) && !(res == -0.0 && __signbit_double(res) == 1) VAL [one_modf=1] [L151] COND TRUE isinf_double(iptr) && !(res == -0.0 && __signbit_double(res) == 1) [L152] reach_error() VAL [one_modf=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 0.8s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 113 SDtfs, 0 SDslu, 49 SDs, 0 SdLazy, 5 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 31 ConstructedInterpolants, 0 QuantifiedInterpolants, 502 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: 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.2.0-2880296 [2020-12-02 15:34:34,633 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-02 15:34:34,637 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-02 15:34:34,672 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-02 15:34:34,673 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-02 15:34:34,674 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-02 15:34:34,676 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-02 15:34:34,679 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-02 15:34:34,681 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-02 15:34:34,683 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-02 15:34:34,684 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-02 15:34:34,686 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-02 15:34:34,686 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-02 15:34:34,688 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-02 15:34:34,689 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-02 15:34:34,691 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-02 15:34:34,692 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-02 15:34:34,693 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-02 15:34:34,695 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-02 15:34:34,698 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-02 15:34:34,700 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-02 15:34:34,702 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-02 15:34:34,704 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-02 15:34:34,705 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-02 15:34:34,708 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-02 15:34:34,709 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-02 15:34:34,710 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-02 15:34:34,711 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-02 15:34:34,712 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-02 15:34:34,713 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-02 15:34:34,714 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-02 15:34:34,715 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-02 15:34:34,716 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-02 15:34:34,717 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-02 15:34:34,718 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-02 15:34:34,719 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-02 15:34:34,720 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-02 15:34:34,720 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-02 15:34:34,721 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-02 15:34:34,722 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-02 15:34:34,723 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-02 15:34:34,724 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-12-02 15:34:34,756 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-02 15:34:34,758 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-02 15:34:34,759 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-02 15:34:34,760 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-02 15:34:34,760 INFO L138 SettingsManager]: * Use SBE=true [2020-12-02 15:34:34,763 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-02 15:34:34,764 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-02 15:34:34,764 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-02 15:34:34,764 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-02 15:34:34,764 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-02 15:34:34,765 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-02 15:34:34,765 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-02 15:34:34,765 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-12-02 15:34:34,765 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-12-02 15:34:34,765 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-02 15:34:34,766 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-02 15:34:34,766 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-02 15:34:34,768 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-02 15:34:34,768 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-02 15:34:34,769 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-02 15:34:34,769 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-02 15:34:34,769 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-02 15:34:34,770 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 15:34:34,770 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-02 15:34:34,771 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-02 15:34:34,771 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-02 15:34:34,771 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-12-02 15:34:34,771 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-12-02 15:34:34,773 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-02 15:34:34,773 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-02 15:34:34,773 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-02 15:34:34,773 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(reach_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 -> b1a3baf542071d98053e6ea7d2c93dcbd3d31b35 [2020-12-02 15:34:35,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-02 15:34:35,268 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-02 15:34:35,273 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-02 15:34:35,275 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-02 15:34:35,276 INFO L275 PluginConnector]: CDTParser initialized [2020-12-02 15:34:35,277 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1211b.c [2020-12-02 15:34:35,365 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c57131a5/adc7e5ff16304f3f94ef859996ccb7ce/FLAG7948c07d0 [2020-12-02 15:34:36,011 INFO L306 CDTParser]: Found 1 translation units. [2020-12-02 15:34:36,012 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1211b.c [2020-12-02 15:34:36,021 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c57131a5/adc7e5ff16304f3f94ef859996ccb7ce/FLAG7948c07d0 [2020-12-02 15:34:36,361 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c57131a5/adc7e5ff16304f3f94ef859996ccb7ce [2020-12-02 15:34:36,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-02 15:34:36,374 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-02 15:34:36,376 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-02 15:34:36,376 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-02 15:34:36,381 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-02 15:34:36,382 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:34:36" (1/1) ... [2020-12-02 15:34:36,387 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@309b310 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:36, skipping insertion in model container [2020-12-02 15:34:36,387 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:34:36" (1/1) ... [2020-12-02 15:34:36,396 INFO L146 MainTranslator]: Starting translation in SV-COMP mode [2020-12-02 15:34:36,443 INFO L179 MainTranslator]: Built tables and reachable declarations [2020-12-02 15:34:36,711 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1211b.c[3718,3731] [2020-12-02 15:34:36,715 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-12-02 15:34:36,737 INFO L212 MainTranslator]: Completed pre-run [2020-12-02 15:34:36,808 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1211b.c[3718,3731] [2020-12-02 15:34:36,812 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-12-02 15:34:36,846 INFO L217 MainTranslator]: Completed translation [2020-12-02 15:34:36,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:36 WrapperNode [2020-12-02 15:34:36,847 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-02 15:34:36,849 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-02 15:34:36,849 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-02 15:34:36,849 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-02 15:34:36,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:36" (1/1) ... [2020-12-02 15:34:36,876 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:36" (1/1) ... [2020-12-02 15:34:36,923 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-02 15:34:36,924 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-02 15:34:36,925 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-02 15:34:36,925 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-02 15:34:36,936 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:36" (1/1) ... [2020-12-02 15:34:36,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:36" (1/1) ... [2020-12-02 15:34:36,966 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:36" (1/1) ... [2020-12-02 15:34:36,968 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:36" (1/1) ... [2020-12-02 15:34:37,006 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:36" (1/1) ... [2020-12-02 15:34:37,024 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:36" (1/1) ... [2020-12-02 15:34:37,034 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:36" (1/1) ... [2020-12-02 15:34:37,046 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-02 15:34:37,047 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-02 15:34:37,047 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-02 15:34:37,048 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-02 15:34:37,048 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:36" (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 [2020-12-02 15:34:37,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.float_to_bitvec_DOUBLE [2020-12-02 15:34:37,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2020-12-02 15:34:37,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2020-12-02 15:34:37,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-12-02 15:34:37,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-02 15:34:37,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2020-12-02 15:34:37,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-12-02 15:34:37,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-02 15:34:37,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-02 15:34:37,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2020-12-02 15:34:37,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-02 15:34:40,267 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-02 15:34:40,267 INFO L298 CfgBuilder]: Removed 34 assume(true) statements. [2020-12-02 15:34:40,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:34:40 BoogieIcfgContainer [2020-12-02 15:34:40,270 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-02 15:34:40,272 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-02 15:34:40,272 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-02 15:34:40,276 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-02 15:34:40,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:34:36" (1/3) ... [2020-12-02 15:34:40,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c737195 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:34:40, skipping insertion in model container [2020-12-02 15:34:40,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:36" (2/3) ... [2020-12-02 15:34:40,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c737195 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:34:40, skipping insertion in model container [2020-12-02 15:34:40,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:34:40" (3/3) ... [2020-12-02 15:34:40,280 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1211b.c [2020-12-02 15:34:40,297 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-02 15:34:40,302 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-02 15:34:40,317 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-02 15:34:40,347 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-02 15:34:40,348 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-02 15:34:40,348 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-02 15:34:40,348 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-02 15:34:40,348 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-02 15:34:40,349 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-02 15:34:40,349 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-02 15:34:40,349 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-02 15:34:40,372 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2020-12-02 15:34:40,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-02 15:34:40,381 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 15:34:40,382 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 15:34:40,383 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 15:34:40,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 15:34:40,391 INFO L82 PathProgramCache]: Analyzing trace with hash -892017235, now seen corresponding path program 1 times [2020-12-02 15:34:40,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 15:34:40,406 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1016790360] [2020-12-02 15:34:40,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-12-02 15:34:41,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 15:34:41,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 1 conjunts are in the unsatisfiable core [2020-12-02 15:34:41,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 15:34:41,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 15:34:41,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 15:34:41,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 15:34:41,584 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1016790360] [2020-12-02 15:34:41,585 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 15:34:41,585 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-12-02 15:34:41,586 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282828675] [2020-12-02 15:34:41,591 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-02 15:34:41,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 15:34:41,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-02 15:34:41,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-02 15:34:41,610 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 2 states. [2020-12-02 15:34:41,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 15:34:41,636 INFO L93 Difference]: Finished difference Result 102 states and 164 transitions. [2020-12-02 15:34:41,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-02 15:34:41,637 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2020-12-02 15:34:41,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 15:34:41,649 INFO L225 Difference]: With dead ends: 102 [2020-12-02 15:34:41,649 INFO L226 Difference]: Without dead ends: 49 [2020-12-02 15:34:41,653 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-02 15:34:41,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-12-02 15:34:41,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-12-02 15:34:41,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-12-02 15:34:41,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2020-12-02 15:34:41,697 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 15 [2020-12-02 15:34:41,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 15:34:41,697 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2020-12-02 15:34:41,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-02 15:34:41,697 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2020-12-02 15:34:41,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-02 15:34:41,699 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 15:34:41,699 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 15:34:41,912 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-12-02 15:34:41,913 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 15:34:41,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 15:34:41,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1752581688, now seen corresponding path program 1 times [2020-12-02 15:34:41,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 15:34:41,917 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [276012307] [2020-12-02 15:34:41,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-12-02 15:34:42,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 15:34:42,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-02 15:34:42,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 15:34:45,084 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_#t~nondet40_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet39_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet38_6| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet39_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet39_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet39_6|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet40_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet40_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet40_6|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet38_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet38_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet38_6|)))) (and (= .cse0 (fp.neg .cse1)) (= (fp.div roundNearestTiesToEven .cse0 .cse2) (fp ((_ extract 63 63) c_ULTIMATE.start_modf_double_~x) ((_ extract 62 52) c_ULTIMATE.start_modf_double_~x) ((_ extract 51 0) c_ULTIMATE.start_modf_double_~x))) (= (_ +zero 11 53) .cse2) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse1)))) is different from false [2020-12-02 15:34:47,244 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_#t~nondet40_6| (_ BitVec 64)) (ULTIMATE.start_modf_double_~x (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet39_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet38_6| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet39_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet39_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet39_6|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet40_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet40_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet40_6|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet38_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet38_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet38_6|)))) (and (= .cse0 (fp.neg .cse1)) (= (fp.div roundNearestTiesToEven .cse0 .cse2) (fp ((_ extract 63 63) ULTIMATE.start_modf_double_~x) ((_ extract 62 52) ULTIMATE.start_modf_double_~x) ((_ extract 51 0) ULTIMATE.start_modf_double_~x))) (= (_ +zero 11 53) .cse2) (= c_ULTIMATE.start_modf_double_~i0~0 ((_ extract 63 32) ULTIMATE.start_modf_double_~x)) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse1)))) is different from false [2020-12-02 15:34:53,141 WARN L197 SmtUtils]: Spent 2.14 s on a formula simplification that was a NOOP. DAG size: 41 [2020-12-02 15:34:53,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 15:34:53,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 15:35:00,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 15:35:00,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [276012307] [2020-12-02 15:35:00,578 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 15:35:00,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2020-12-02 15:35:00,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970566101] [2020-12-02 15:35:00,580 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-02 15:35:00,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 15:35:00,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-02 15:35:00,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=31, Unknown=3, NotChecked=22, Total=72 [2020-12-02 15:35:00,582 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 9 states. [2020-12-02 15:35:22,645 WARN L197 SmtUtils]: Spent 13.54 s on a formula simplification. DAG size of input: 44 DAG size of output: 35 [2020-12-02 15:35:26,142 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~nondet40_6| (_ BitVec 64)) (ULTIMATE.start_modf_double_~x (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet39_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet38_6| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet39_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet39_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet39_6|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet40_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet40_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet40_6|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet38_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet38_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet38_6|)))) (and (= .cse0 (fp.neg .cse1)) (= (fp.div roundNearestTiesToEven .cse0 .cse2) (fp ((_ extract 63 63) ULTIMATE.start_modf_double_~x) ((_ extract 62 52) ULTIMATE.start_modf_double_~x) ((_ extract 51 0) ULTIMATE.start_modf_double_~x))) (= (_ +zero 11 53) .cse2) (= c_ULTIMATE.start_modf_double_~i0~0 ((_ extract 63 32) ULTIMATE.start_modf_double_~x)) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse1)))) (not (bvslt (bvadd (bvand (_ bv2047 32) (bvashr c_ULTIMATE.start_modf_double_~i0~0 (_ bv20 32))) (_ bv4294966273 32)) (_ bv20 32))) (not (bvslt (bvadd (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) c_ULTIMATE.start_modf_double_~x) (_ bv20 32))) (_ bv4294966273 32)) (_ bv20 32))) (= roundNearestTiesToEven c_~CRM)) is different from false [2020-12-02 15:35:28,273 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~nondet40_6| (_ BitVec 64)) (ULTIMATE.start_modf_double_~x (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet39_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet38_6| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet39_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet39_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet39_6|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet40_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet40_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet40_6|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet38_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet38_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet38_6|)))) (and (= .cse0 (fp.neg .cse1)) (= (fp.div roundNearestTiesToEven .cse0 .cse2) (fp ((_ extract 63 63) ULTIMATE.start_modf_double_~x) ((_ extract 62 52) ULTIMATE.start_modf_double_~x) ((_ extract 51 0) ULTIMATE.start_modf_double_~x))) (= (_ +zero 11 53) .cse2) (= c_ULTIMATE.start_modf_double_~i0~0 ((_ extract 63 32) ULTIMATE.start_modf_double_~x)) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse1)))) (not (bvslt (bvadd (bvand (_ bv2047 32) (bvashr c_ULTIMATE.start_modf_double_~i0~0 (_ bv20 32))) (_ bv4294966273 32)) (_ bv20 32)))) is different from false [2020-12-02 15:35:34,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 15:35:34,058 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2020-12-02 15:35:34,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 15:35:34,060 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2020-12-02 15:35:34,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 15:35:34,063 INFO L225 Difference]: With dead ends: 64 [2020-12-02 15:35:34,064 INFO L226 Difference]: Without dead ends: 27 [2020-12-02 15:35:34,070 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 43.9s TimeCoverageRelationStatistics Valid=24, Invalid=40, Unknown=8, NotChecked=60, Total=132 [2020-12-02 15:35:34,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-12-02 15:35:34,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-12-02 15:35:34,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-12-02 15:35:34,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2020-12-02 15:35:34,082 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 18 [2020-12-02 15:35:34,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 15:35:34,082 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-12-02 15:35:34,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-02 15:35:34,083 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-12-02 15:35:34,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-02 15:35:34,086 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 15:35:34,086 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 15:35:34,299 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-12-02 15:35:34,301 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 15:35:34,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 15:35:34,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1408426499, now seen corresponding path program 1 times [2020-12-02 15:35:34,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 15:35:34,303 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1800990683] [2020-12-02 15:35:34,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-12-02 15:35:35,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 15:35:35,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-02 15:35:35,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 15:35:35,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 15:35:35,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 15:35:35,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 15:35:35,570 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1800990683] [2020-12-02 15:35:35,570 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 15:35:35,570 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-12-02 15:35:35,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6394596] [2020-12-02 15:35:35,571 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-02 15:35:35,571 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 15:35:35,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-02 15:35:35,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 15:35:35,573 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 3 states. [2020-12-02 15:35:35,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 15:35:35,669 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2020-12-02 15:35:35,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-02 15:35:35,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-12-02 15:35:35,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 15:35:35,672 INFO L225 Difference]: With dead ends: 30 [2020-12-02 15:35:35,672 INFO L226 Difference]: Without dead ends: 27 [2020-12-02 15:35:35,673 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 15:35:35,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-12-02 15:35:35,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-12-02 15:35:35,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-12-02 15:35:35,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2020-12-02 15:35:35,679 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 20 [2020-12-02 15:35:35,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 15:35:35,679 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2020-12-02 15:35:35,680 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-02 15:35:35,680 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-12-02 15:35:35,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-02 15:35:35,684 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 15:35:35,684 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 15:35:35,895 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-12-02 15:35:35,896 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 15:35:35,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 15:35:35,897 INFO L82 PathProgramCache]: Analyzing trace with hash -605570489, now seen corresponding path program 1 times [2020-12-02 15:35:35,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 15:35:35,899 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1673775669] [2020-12-02 15:35:35,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-12-02 15:35:37,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 15:35:37,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-02 15:35:37,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 15:35:37,168 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2020-12-02 15:35:37,195 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-02 15:35:37,221 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 15:35:37,222 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-02 15:35:37,246 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 15:35:37,253 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-02 15:35:37,253 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:7 [2020-12-02 15:35:37,718 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 15:35:37,724 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 15:35:37,727 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 15:35:37,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 15:35:37,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 15:35:38,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 15:35:38,920 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1673775669] [2020-12-02 15:35:38,921 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 15:35:38,921 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2020-12-02 15:35:38,921 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24991464] [2020-12-02 15:35:38,922 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-02 15:35:38,922 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 15:35:38,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-02 15:35:38,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-12-02 15:35:38,924 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 9 states. [2020-12-02 15:35:41,664 WARN L197 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2020-12-02 15:35:42,326 WARN L197 SmtUtils]: Spent 583.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2020-12-02 15:35:43,026 WARN L197 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2020-12-02 15:35:43,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 15:35:43,091 INFO L93 Difference]: Finished difference Result 31 states and 30 transitions. [2020-12-02 15:35:43,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 15:35:43,091 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-12-02 15:35:43,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 15:35:43,093 INFO L225 Difference]: With dead ends: 31 [2020-12-02 15:35:43,093 INFO L226 Difference]: Without dead ends: 27 [2020-12-02 15:35:43,093 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-12-02 15:35:43,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-12-02 15:35:43,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-12-02 15:35:43,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-12-02 15:35:43,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 26 transitions. [2020-12-02 15:35:43,105 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 26 transitions. Word has length 22 [2020-12-02 15:35:43,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 15:35:43,106 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 26 transitions. [2020-12-02 15:35:43,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-02 15:35:43,106 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2020-12-02 15:35:43,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-02 15:35:43,107 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 15:35:43,107 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 15:35:43,320 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-12-02 15:35:43,321 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 15:35:43,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 15:35:43,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1265561966, now seen corresponding path program 1 times [2020-12-02 15:35:43,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 15:35:43,324 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1470115595] [2020-12-02 15:35:43,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-12-02 15:35:44,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 15:35:44,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 19 conjunts are in the unsatisfiable core [2020-12-02 15:35:44,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 15:35:50,461 WARN L197 SmtUtils]: Spent 2.14 s on a formula simplification that was a NOOP. DAG size: 32 [2020-12-02 15:35:52,637 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_#t~nondet40_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet39_8| (_ BitVec 64)) (ULTIMATE.start_modf_double_~x (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet38_8| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet40_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet40_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet40_8|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet38_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet38_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet38_8|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet39_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet39_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet39_8|)))) (and (= (fp ((_ extract 63 63) ULTIMATE.start_modf_double_~x) ((_ extract 62 52) ULTIMATE.start_modf_double_~x) ((_ extract 51 0) ULTIMATE.start_modf_double_~x)) (fp.div roundNearestTiesToEven .cse0 .cse1)) (= .cse1 (_ +zero 11 53)) (= .cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (= c_ULTIMATE.start_modf_double_~high~1 ((_ extract 63 32) ULTIMATE.start_modf_double_~x)) (= (fp.neg .cse2) .cse0)))) is different from false [2020-12-02 15:35:52,721 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2020-12-02 15:35:52,748 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-02 15:35:52,771 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 15:35:52,772 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-02 15:35:57,018 WARN L197 SmtUtils]: Spent 4.25 s on a formula simplification that was a NOOP. DAG size: 38 [2020-12-02 15:35:57,018 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 15:35:57,027 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-12-02 15:35:57,027 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:79, output treesize:69 [2020-12-02 15:35:59,152 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_#t~nondet40_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet39_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet38_8| (_ BitVec 64)) (v_ULTIMATE.start_modf_double_~x_21 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet40_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet40_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet40_8|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet38_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet38_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet38_8|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet39_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet39_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet39_8|)))) (and (= .cse0 (_ +zero 11 53)) (= .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (= (fp ((_ extract 63 63) v_ULTIMATE.start_modf_double_~x_21) ((_ extract 62 52) v_ULTIMATE.start_modf_double_~x_21) ((_ extract 51 0) v_ULTIMATE.start_modf_double_~x_21)) (fp.div roundNearestTiesToEven .cse2 .cse0)) (= (fp.neg .cse1) .cse2) (= (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_ULTIMATE.start_modf_double_~x_21)) (_ bv0 32)) c_ULTIMATE.start_modf_double_~x)))) is different from false [2020-12-02 15:36:01,328 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_#t~nondet40_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet39_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet38_8| (_ BitVec 64)) (v_ULTIMATE.start_modf_double_~x_21 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet40_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet40_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet40_8|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet38_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet38_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet38_8|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet39_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet39_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet39_8|)))) (and (= .cse0 (_ +zero 11 53)) (= .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (= (fp ((_ extract 63 63) v_ULTIMATE.start_modf_double_~x_21) ((_ extract 62 52) v_ULTIMATE.start_modf_double_~x_21) ((_ extract 51 0) v_ULTIMATE.start_modf_double_~x_21)) (fp.div roundNearestTiesToEven .cse2 .cse0)) (= (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_ULTIMATE.start_modf_double_~x_21)) (_ bv0 32)) |c_ULTIMATE.start_modf_double_#res|) (= (fp.neg .cse1) .cse2)))) is different from false [2020-12-02 15:36:03,493 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_#t~nondet40_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet39_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet38_8| (_ BitVec 64)) (v_ULTIMATE.start_modf_double_~x_21 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet40_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet40_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet40_8|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet38_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet38_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet38_8|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet39_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet39_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet39_8|)))) (and (= .cse0 (_ +zero 11 53)) (= c_ULTIMATE.start_main_~res~0 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_ULTIMATE.start_modf_double_~x_21)) (_ bv0 32))) (= .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (= (fp ((_ extract 63 63) v_ULTIMATE.start_modf_double_~x_21) ((_ extract 62 52) v_ULTIMATE.start_modf_double_~x_21) ((_ extract 51 0) v_ULTIMATE.start_modf_double_~x_21)) (fp.div roundNearestTiesToEven .cse2 .cse0)) (= (fp.neg .cse1) .cse2)))) is different from false [2020-12-02 15:36:05,719 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_#t~nondet40_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet39_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet38_8| (_ BitVec 64)) (v_ULTIMATE.start_modf_double_~x_21 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet40_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet40_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet40_8|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet38_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet38_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet38_8|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet39_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet39_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet39_8|)))) (and (= (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_ULTIMATE.start_modf_double_~x_21)) (_ bv0 32)) c_ULTIMATE.start___signbit_double_~x) (= .cse0 (_ +zero 11 53)) (= .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (= (fp ((_ extract 63 63) v_ULTIMATE.start_modf_double_~x_21) ((_ extract 62 52) v_ULTIMATE.start_modf_double_~x_21) ((_ extract 51 0) v_ULTIMATE.start_modf_double_~x_21)) (fp.div roundNearestTiesToEven .cse2 .cse0)) (= (fp.neg .cse1) .cse2)))) is different from false [2020-12-02 15:36:07,866 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_#t~nondet40_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet39_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet38_8| (_ BitVec 64)) (v_ULTIMATE.start_modf_double_~x_21 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet40_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet40_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet40_8|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet38_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet38_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet38_8|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet39_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet39_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet39_8|)))) (and (= .cse0 (_ +zero 11 53)) (= .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (= (fp ((_ extract 63 63) v_ULTIMATE.start_modf_double_~x_21) ((_ extract 62 52) v_ULTIMATE.start_modf_double_~x_21) ((_ extract 51 0) v_ULTIMATE.start_modf_double_~x_21)) (fp.div roundNearestTiesToEven .cse2 .cse0)) (= ((_ extract 63 32) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_ULTIMATE.start_modf_double_~x_21)) (_ bv0 32))) c_ULTIMATE.start___signbit_double_~msw~0) (= (fp.neg .cse1) .cse2)))) is different from false [2020-12-02 15:36:07,900 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 15:36:07,901 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 15:36:14,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 15:36:14,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 15:36:25,108 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2020-12-02 15:36:25,139 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-02 15:36:25,163 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 15:36:25,163 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-02 15:36:25,183 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 15:36:25,183 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-02 15:36:25,183 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2020-12-02 15:36:30,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 15:36:30,881 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1470115595] [2020-12-02 15:36:30,881 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 15:36:30,881 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 19 [2020-12-02 15:36:30,881 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437005222] [2020-12-02 15:36:30,882 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-12-02 15:36:30,882 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 15:36:30,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-12-02 15:36:30,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=134, Unknown=10, NotChecked=162, Total=342 [2020-12-02 15:36:30,883 INFO L87 Difference]: Start difference. First operand 27 states and 26 transitions. Second operand 19 states. [2020-12-02 15:36:33,147 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((|v_ULTIMATE.start_main_#t~nondet40_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet39_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet38_8| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet40_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet40_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet40_8|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet38_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet38_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet38_8|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet39_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet39_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet39_8|)))) (and (= (fp ((_ extract 63 63) c_ULTIMATE.start_modf_double_~x) ((_ extract 62 52) c_ULTIMATE.start_modf_double_~x) ((_ extract 51 0) c_ULTIMATE.start_modf_double_~x)) (fp.div roundNearestTiesToEven .cse0 .cse1)) (= .cse1 (_ +zero 11 53)) (= .cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (= (fp.neg .cse2) .cse0))))) is different from false [2020-12-02 15:36:46,501 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (bvand (_ bv2147483648 32) ((_ extract 63 32) (concat (bvand (_ bv2147483648 32) c_ULTIMATE.start_modf_double_~high~1) (_ bv0 32)))) (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_#t~nondet40_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet39_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet38_8| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet40_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet40_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet40_8|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet38_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet38_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet38_8|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet39_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet39_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet39_8|)))) (and (= (fp ((_ extract 63 63) c_ULTIMATE.start_modf_double_~x) ((_ extract 62 52) c_ULTIMATE.start_modf_double_~x) ((_ extract 51 0) c_ULTIMATE.start_modf_double_~x)) (fp.div roundNearestTiesToEven .cse0 .cse1)) (= .cse1 (_ +zero 11 53)) (= .cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (= (fp.neg .cse2) .cse0)))) (exists ((|v_ULTIMATE.start_main_#t~nondet40_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet39_8| (_ BitVec 64)) (ULTIMATE.start_modf_double_~x (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet38_8| (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet40_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet40_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet40_8|))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet38_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet38_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet38_8|))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet39_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet39_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet39_8|)))) (and (= (fp ((_ extract 63 63) ULTIMATE.start_modf_double_~x) ((_ extract 62 52) ULTIMATE.start_modf_double_~x) ((_ extract 51 0) ULTIMATE.start_modf_double_~x)) (fp.div roundNearestTiesToEven .cse3 .cse4)) (= .cse4 (_ +zero 11 53)) (= .cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (= c_ULTIMATE.start_modf_double_~high~1 ((_ extract 63 32) ULTIMATE.start_modf_double_~x)) (= (fp.neg .cse5) .cse3))))) is different from false [2020-12-02 15:37:16,432 WARN L197 SmtUtils]: Spent 7.89 s on a formula simplification. DAG size of input: 44 DAG size of output: 35 [2020-12-02 15:37:21,678 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (bvand (_ bv2147483648 32) ((_ extract 63 32) c_ULTIMATE.start_modf_double_~x)) (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_#t~nondet40_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet39_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet38_8| (_ BitVec 64)) (v_ULTIMATE.start_modf_double_~x_21 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet40_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet40_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet40_8|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet38_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet38_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet38_8|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet39_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet39_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet39_8|)))) (and (= .cse0 (_ +zero 11 53)) (= .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (= (fp ((_ extract 63 63) v_ULTIMATE.start_modf_double_~x_21) ((_ extract 62 52) v_ULTIMATE.start_modf_double_~x_21) ((_ extract 51 0) v_ULTIMATE.start_modf_double_~x_21)) (fp.div roundNearestTiesToEven .cse2 .cse0)) (= (fp.neg .cse1) .cse2) (= (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_ULTIMATE.start_modf_double_~x_21)) (_ bv0 32)) c_ULTIMATE.start_modf_double_~x))))) is different from false [2020-12-02 15:37:23,819 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~nondet40_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet39_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet38_8| (_ BitVec 64)) (v_ULTIMATE.start_modf_double_~x_21 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet40_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet40_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet40_8|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet38_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet38_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet38_8|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet39_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet39_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet39_8|)))) (and (= .cse0 (_ +zero 11 53)) (= .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (= (fp ((_ extract 63 63) v_ULTIMATE.start_modf_double_~x_21) ((_ extract 62 52) v_ULTIMATE.start_modf_double_~x_21) ((_ extract 51 0) v_ULTIMATE.start_modf_double_~x_21)) (fp.div roundNearestTiesToEven .cse2 .cse0)) (= (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_ULTIMATE.start_modf_double_~x_21)) (_ bv0 32)) |c_ULTIMATE.start_modf_double_#res|) (= (fp.neg .cse1) .cse2)))) (not (= (bvand (_ bv2147483648 32) ((_ extract 63 32) |c_ULTIMATE.start_modf_double_#res|)) (_ bv0 32)))) is different from false [2020-12-02 15:37:59,310 WARN L197 SmtUtils]: Spent 7.89 s on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2020-12-02 15:38:25,265 WARN L838 $PredicateComparison]: unable to prove that (and |c_ULTIMATE.start_main_#t~short49| (not (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) c_ULTIMATE.start_main_~res~0)))) (exists ((|v_ULTIMATE.start_main_#t~nondet40_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet39_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet38_8| (_ BitVec 64)) (v_ULTIMATE.start_modf_double_~x_21 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet40_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet40_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet40_8|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet38_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet38_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet38_8|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet39_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet39_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet39_8|)))) (and (= .cse0 (_ +zero 11 53)) (= c_ULTIMATE.start_main_~res~0 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_ULTIMATE.start_modf_double_~x_21)) (_ bv0 32))) (= .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (= (fp ((_ extract 63 63) v_ULTIMATE.start_modf_double_~x_21) ((_ extract 62 52) v_ULTIMATE.start_modf_double_~x_21) ((_ extract 51 0) v_ULTIMATE.start_modf_double_~x_21)) (fp.div roundNearestTiesToEven .cse2 .cse0)) (= (fp.neg .cse1) .cse2))))) is different from false [2020-12-02 15:39:02,712 WARN L197 SmtUtils]: Spent 9.42 s on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2020-12-02 15:39:51,293 WARN L197 SmtUtils]: Spent 15.46 s on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2020-12-02 15:39:59,865 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2020-12-02 15:40:00,550 WARN L197 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2020-12-02 15:40:01,176 WARN L197 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2020-12-02 15:40:01,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 15:40:01,177 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2020-12-02 15:40:01,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-02 15:40:01,178 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 26 [2020-12-02 15:40:01,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 15:40:01,178 INFO L225 Difference]: With dead ends: 27 [2020-12-02 15:40:01,179 INFO L226 Difference]: Without dead ends: 0 [2020-12-02 15:40:01,180 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 202.8s TimeCoverageRelationStatistics Valid=80, Invalid=298, Unknown=46, NotChecked=506, Total=930 [2020-12-02 15:40:01,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-02 15:40:01,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-02 15:40:01,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-02 15:40:01,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-02 15:40:01,181 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2020-12-02 15:40:01,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 15:40:01,181 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-02 15:40:01,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-12-02 15:40:01,181 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-02 15:40:01,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-02 15:40:01,382 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-12-02 15:40:01,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-02 15:40:03,492 WARN L197 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 32 [2020-12-02 15:40:34,280 WARN L195 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2020-12-02 15:40:34,282 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:209) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:222) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:131) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.push(UndoableWrapperScript.java:53) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:621) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:165) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:135) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter(HoareAnnotationComposer.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.(HoareAnnotationComposer.java:105) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeCFGHoareAnnotation(BasicCegarLoop.java:1052) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:206) ... 36 more [2020-12-02 15:40:34,288 INFO L168 Benchmark]: Toolchain (without parser) took 357916.31 ms. Allocated memory was 41.9 MB in the beginning and 60.8 MB in the end (delta: 18.9 MB). Free memory was 18.5 MB in the beginning and 16.1 MB in the end (delta: 2.4 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. [2020-12-02 15:40:34,289 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 41.9 MB. Free memory was 28.5 MB in the beginning and 28.4 MB in the end (delta: 26.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 15:40:34,290 INFO L168 Benchmark]: CACSL2BoogieTranslator took 471.58 ms. Allocated memory was 41.9 MB in the beginning and 50.3 MB in the end (delta: 8.4 MB). Free memory was 18.3 MB in the beginning and 24.0 MB in the end (delta: -5.6 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. [2020-12-02 15:40:34,291 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.37 ms. Allocated memory is still 50.3 MB. Free memory was 24.0 MB in the beginning and 21.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-02 15:40:34,292 INFO L168 Benchmark]: Boogie Preprocessor took 122.66 ms. Allocated memory is still 50.3 MB. Free memory was 21.5 MB in the beginning and 32.3 MB in the end (delta: -10.8 MB). Peak memory consumption was 5.6 MB. Max. memory is 16.1 GB. [2020-12-02 15:40:34,293 INFO L168 Benchmark]: RCFGBuilder took 3222.73 ms. Allocated memory is still 50.3 MB. Free memory was 32.1 MB in the beginning and 23.7 MB in the end (delta: 8.4 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-12-02 15:40:34,294 INFO L168 Benchmark]: TraceAbstraction took 354015.29 ms. Allocated memory was 50.3 MB in the beginning and 60.8 MB in the end (delta: 10.5 MB). Free memory was 23.2 MB in the beginning and 16.1 MB in the end (delta: 7.0 MB). Peak memory consumption was 16.2 MB. Max. memory is 16.1 GB. [2020-12-02 15:40:34,299 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 41.9 MB. Free memory was 28.5 MB in the beginning and 28.4 MB in the end (delta: 26.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 471.58 ms. Allocated memory was 41.9 MB in the beginning and 50.3 MB in the end (delta: 8.4 MB). Free memory was 18.3 MB in the beginning and 24.0 MB in the end (delta: -5.6 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 74.37 ms. Allocated memory is still 50.3 MB. Free memory was 24.0 MB in the beginning and 21.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 122.66 ms. Allocated memory is still 50.3 MB. Free memory was 21.5 MB in the beginning and 32.3 MB in the end (delta: -10.8 MB). Peak memory consumption was 5.6 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3222.73 ms. Allocated memory is still 50.3 MB. Free memory was 32.1 MB in the beginning and 23.7 MB in the end (delta: 8.4 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 354015.29 ms. Allocated memory was 50.3 MB in the beginning and 60.8 MB in the end (delta: 10.5 MB). Free memory was 23.2 MB in the beginning and 16.1 MB in the end (delta: 7.0 MB). Peak memory consumption was 16.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...