./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1232a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 54858612 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 ../sv-benchmarks/c/float-newlib/double_req_bl_1232a.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 2f0e84dafea36c954c87753335c0002922188c68 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 ../sv-benchmarks/c/float-newlib/double_req_bl_1232a.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 2f0e84dafea36c954c87753335c0002922188c68 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-5485861 [2020-10-25 21:53:51,582 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-25 21:53:51,585 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-25 21:53:51,641 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-25 21:53:51,641 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-25 21:53:51,649 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-25 21:53:51,652 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-25 21:53:51,660 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-25 21:53:51,664 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-25 21:53:51,673 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-25 21:53:51,674 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-25 21:53:51,677 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-25 21:53:51,681 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-25 21:53:51,685 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-25 21:53:51,686 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-25 21:53:51,688 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-25 21:53:51,690 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-25 21:53:51,692 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-25 21:53:51,697 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-25 21:53:51,700 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-25 21:53:51,706 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-25 21:53:51,708 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-25 21:53:51,710 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-25 21:53:51,713 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-25 21:53:51,719 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-25 21:53:51,719 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-25 21:53:51,720 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-25 21:53:51,722 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-25 21:53:51,723 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-25 21:53:51,724 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-25 21:53:51,726 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-25 21:53:51,727 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-25 21:53:51,729 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-25 21:53:51,731 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-25 21:53:51,734 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-25 21:53:51,735 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-25 21:53:51,736 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-25 21:53:51,736 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-25 21:53:51,737 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-25 21:53:51,739 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-25 21:53:51,740 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-25 21:53:51,741 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-25 21:53:51,793 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-25 21:53:51,794 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-25 21:53:51,799 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-25 21:53:51,799 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-25 21:53:51,800 INFO L138 SettingsManager]: * Use SBE=true [2020-10-25 21:53:51,800 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-25 21:53:51,800 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-25 21:53:51,800 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-25 21:53:51,801 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-25 21:53:51,801 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-25 21:53:51,802 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-25 21:53:51,803 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-25 21:53:51,803 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-25 21:53:51,803 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-25 21:53:51,803 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-25 21:53:51,804 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-25 21:53:51,804 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-25 21:53:51,804 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-25 21:53:51,804 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-25 21:53:51,805 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-25 21:53:51,805 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-25 21:53:51,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 21:53:51,806 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-25 21:53:51,806 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-25 21:53:51,806 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-25 21:53:51,806 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-25 21:53:51,807 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-25 21:53:51,807 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-25 21:53:51,807 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-25 21:53:51,807 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 -> 2f0e84dafea36c954c87753335c0002922188c68 [2020-10-25 21:53:52,278 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-25 21:53:52,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-25 21:53:52,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-25 21:53:52,328 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-25 21:53:52,333 INFO L275 PluginConnector]: CDTParser initialized [2020-10-25 21:53:52,335 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1232a.c [2020-10-25 21:53:52,413 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f701ef7c/afccdecb03424e35a2ead7540f7d3679/FLAG6574dd7a6 [2020-10-25 21:53:53,068 INFO L306 CDTParser]: Found 1 translation units. [2020-10-25 21:53:53,072 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1232a.c [2020-10-25 21:53:53,082 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f701ef7c/afccdecb03424e35a2ead7540f7d3679/FLAG6574dd7a6 [2020-10-25 21:53:53,374 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f701ef7c/afccdecb03424e35a2ead7540f7d3679 [2020-10-25 21:53:53,379 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-25 21:53:53,386 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-25 21:53:53,389 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-25 21:53:53,389 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-25 21:53:53,394 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-25 21:53:53,395 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 09:53:53" (1/1) ... [2020-10-25 21:53:53,399 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32b96b96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:53:53, skipping insertion in model container [2020-10-25 21:53:53,399 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 09:53:53" (1/1) ... [2020-10-25 21:53:53,409 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-25 21:53:53,427 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-25 21:53:53,664 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 21:53:53,675 INFO L203 MainTranslator]: Completed pre-run [2020-10-25 21:53:53,708 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 21:53:53,733 INFO L208 MainTranslator]: Completed translation [2020-10-25 21:53:53,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:53:53 WrapperNode [2020-10-25 21:53:53,735 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-25 21:53:53,737 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-25 21:53:53,737 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-25 21:53:53,738 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-25 21:53:53,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:53:53" (1/1) ... [2020-10-25 21:53:53,775 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:53:53" (1/1) ... [2020-10-25 21:53:53,821 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-25 21:53:53,824 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-25 21:53:53,826 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-25 21:53:53,826 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-25 21:53:53,839 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:53:53" (1/1) ... [2020-10-25 21:53:53,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:53:53" (1/1) ... [2020-10-25 21:53:53,859 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:53:53" (1/1) ... [2020-10-25 21:53:53,860 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:53:53" (1/1) ... [2020-10-25 21:53:53,875 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:53:53" (1/1) ... [2020-10-25 21:53:53,882 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:53:53" (1/1) ... [2020-10-25 21:53:53,885 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:53:53" (1/1) ... [2020-10-25 21:53:53,889 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-25 21:53:53,891 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-25 21:53:53,891 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-25 21:53:53,891 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-25 21:53:53,892 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:53:53" (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-10-25 21:53:53,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-25 21:53:53,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-25 21:53:53,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-10-25 21:53:53,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-25 21:53:53,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-25 21:53:53,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-25 21:53:53,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-25 21:53:54,731 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-25 21:53:54,732 INFO L298 CfgBuilder]: Removed 20 assume(true) statements. [2020-10-25 21:53:54,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 09:53:54 BoogieIcfgContainer [2020-10-25 21:53:54,735 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-25 21:53:54,737 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-25 21:53:54,738 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-25 21:53:54,742 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-25 21:53:54,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 09:53:53" (1/3) ... [2020-10-25 21:53:54,743 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29e9e1df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 09:53:54, skipping insertion in model container [2020-10-25 21:53:54,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:53:53" (2/3) ... [2020-10-25 21:53:54,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29e9e1df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 09:53:54, skipping insertion in model container [2020-10-25 21:53:54,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 09:53:54" (3/3) ... [2020-10-25 21:53:54,746 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1232a.c [2020-10-25 21:53:54,763 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-25 21:53:54,769 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-25 21:53:54,784 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-25 21:53:54,834 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-25 21:53:54,834 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-25 21:53:54,835 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-25 21:53:54,835 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-25 21:53:54,835 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-25 21:53:54,835 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-25 21:53:54,835 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-25 21:53:54,836 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-25 21:53:54,856 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-10-25 21:53:54,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-25 21:53:54,865 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:53:54,866 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:53:54,866 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:53:54,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:53:54,873 INFO L82 PathProgramCache]: Analyzing trace with hash -958075201, now seen corresponding path program 1 times [2020-10-25 21:53:54,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:53:54,894 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175044448] [2020-10-25 21:53:54,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:53:55,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:53:55,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:53:55,056 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175044448] [2020-10-25 21:53:55,057 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 21:53:55,058 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-25 21:53:55,059 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377296944] [2020-10-25 21:53:55,064 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-25 21:53:55,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 21:53:55,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-25 21:53:55,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-25 21:53:55,084 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2020-10-25 21:53:55,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:53:55,108 INFO L93 Difference]: Finished difference Result 63 states and 99 transitions. [2020-10-25 21:53:55,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-25 21:53:55,110 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-10-25 21:53:55,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:53:55,122 INFO L225 Difference]: With dead ends: 63 [2020-10-25 21:53:55,123 INFO L226 Difference]: Without dead ends: 29 [2020-10-25 21:53:55,126 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-10-25 21:53:55,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-10-25 21:53:55,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-10-25 21:53:55,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-10-25 21:53:55,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2020-10-25 21:53:55,173 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 10 [2020-10-25 21:53:55,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:53:55,173 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2020-10-25 21:53:55,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-25 21:53:55,174 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2020-10-25 21:53:55,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-25 21:53:55,175 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:53:55,175 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:53:55,176 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-25 21:53:55,176 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:53:55,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:53:55,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1001584898, now seen corresponding path program 1 times [2020-10-25 21:53:55,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:53:55,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103954427] [2020-10-25 21:53:55,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:53:55,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:53:55,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:53:55,289 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103954427] [2020-10-25 21:53:55,289 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 21:53:55,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 21:53:55,290 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548583071] [2020-10-25 21:53:55,292 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 21:53:55,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 21:53:55,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 21:53:55,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 21:53:55,294 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 4 states. [2020-10-25 21:53:55,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:53:55,423 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2020-10-25 21:53:55,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 21:53:55,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-25 21:53:55,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:53:55,426 INFO L225 Difference]: With dead ends: 53 [2020-10-25 21:53:55,426 INFO L226 Difference]: Without dead ends: 44 [2020-10-25 21:53:55,427 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 21:53:55,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-10-25 21:53:55,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2020-10-25 21:53:55,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-25 21:53:55,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2020-10-25 21:53:55,435 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 11 [2020-10-25 21:53:55,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:53:55,436 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2020-10-25 21:53:55,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 21:53:55,436 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2020-10-25 21:53:55,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-25 21:53:55,437 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:53:55,437 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:53:55,438 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-25 21:53:55,438 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:53:55,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:53:55,439 INFO L82 PathProgramCache]: Analyzing trace with hash 502201410, now seen corresponding path program 1 times [2020-10-25 21:53:55,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:53:55,440 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715322185] [2020-10-25 21:53:55,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:53:55,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:53:55,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:53:55,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715322185] [2020-10-25 21:53:55,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 21:53:55,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 21:53:55,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187141783] [2020-10-25 21:53:55,506 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 21:53:55,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 21:53:55,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 21:53:55,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 21:53:55,508 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 4 states. [2020-10-25 21:53:55,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:53:55,614 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2020-10-25 21:53:55,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 21:53:55,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-25 21:53:55,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:53:55,618 INFO L225 Difference]: With dead ends: 55 [2020-10-25 21:53:55,618 INFO L226 Difference]: Without dead ends: 46 [2020-10-25 21:53:55,619 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 21:53:55,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-10-25 21:53:55,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2020-10-25 21:53:55,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-25 21:53:55,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2020-10-25 21:53:55,626 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 12 [2020-10-25 21:53:55,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:53:55,627 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2020-10-25 21:53:55,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 21:53:55,627 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2020-10-25 21:53:55,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-25 21:53:55,628 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:53:55,629 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:53:55,629 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-25 21:53:55,629 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:53:55,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:53:55,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1951233721, now seen corresponding path program 1 times [2020-10-25 21:53:55,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:53:55,631 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633670544] [2020-10-25 21:53:55,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:53:55,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:53:55,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:53:55,752 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633670544] [2020-10-25 21:53:55,753 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 21:53:55,753 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 21:53:55,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33454245] [2020-10-25 21:53:55,753 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 21:53:55,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 21:53:55,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 21:53:55,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 21:53:55,762 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 4 states. [2020-10-25 21:53:55,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:53:55,904 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2020-10-25 21:53:55,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 21:53:55,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-25 21:53:55,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:53:55,907 INFO L225 Difference]: With dead ends: 57 [2020-10-25 21:53:55,907 INFO L226 Difference]: Without dead ends: 48 [2020-10-25 21:53:55,908 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 21:53:55,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-10-25 21:53:55,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 31. [2020-10-25 21:53:55,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-25 21:53:55,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2020-10-25 21:53:55,915 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 13 [2020-10-25 21:53:55,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:53:55,915 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2020-10-25 21:53:55,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 21:53:55,916 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2020-10-25 21:53:55,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-25 21:53:55,917 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:53:55,917 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:53:55,917 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-25 21:53:55,918 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:53:55,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:53:55,919 INFO L82 PathProgramCache]: Analyzing trace with hash -555760345, now seen corresponding path program 1 times [2020-10-25 21:53:55,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:53:55,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423126200] [2020-10-25 21:53:55,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:53:55,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:53:55,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:53:55,978 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423126200] [2020-10-25 21:53:55,978 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 21:53:55,978 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 21:53:55,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262167631] [2020-10-25 21:53:55,979 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 21:53:55,979 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 21:53:55,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 21:53:55,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 21:53:55,981 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 4 states. [2020-10-25 21:53:56,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:53:56,076 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2020-10-25 21:53:56,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 21:53:56,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-25 21:53:56,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:53:56,078 INFO L225 Difference]: With dead ends: 55 [2020-10-25 21:53:56,078 INFO L226 Difference]: Without dead ends: 46 [2020-10-25 21:53:56,079 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 21:53:56,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-10-25 21:53:56,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2020-10-25 21:53:56,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-25 21:53:56,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2020-10-25 21:53:56,084 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 14 [2020-10-25 21:53:56,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:53:56,085 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2020-10-25 21:53:56,085 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 21:53:56,085 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2020-10-25 21:53:56,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-25 21:53:56,086 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:53:56,086 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:53:56,087 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-25 21:53:56,087 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:53:56,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:53:56,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1219247017, now seen corresponding path program 1 times [2020-10-25 21:53:56,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:53:56,088 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398991846] [2020-10-25 21:53:56,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:53:56,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 21:53:56,117 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 21:53:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 21:53:56,147 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 21:53:56,200 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-25 21:53:56,201 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-25 21:53:56,201 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-25 21:53:56,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 09:53:56 BoogieIcfgContainer [2020-10-25 21:53:56,238 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-25 21:53:56,238 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-25 21:53:56,239 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-25 21:53:56,239 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-25 21:53:56,240 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 09:53:54" (3/4) ... [2020-10-25 21:53:56,244 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-25 21:53:56,244 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-25 21:53:56,247 INFO L168 Benchmark]: Toolchain (without parser) took 2864.65 ms. Allocated memory was 48.2 MB in the beginning and 75.5 MB in the end (delta: 27.3 MB). Free memory was 25.2 MB in the beginning and 37.3 MB in the end (delta: -12.1 MB). Peak memory consumption was 16.6 MB. Max. memory is 16.1 GB. [2020-10-25 21:53:56,248 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 48.2 MB. Free memory was 32.2 MB in the beginning and 32.2 MB in the end (delta: 38.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 21:53:56,249 INFO L168 Benchmark]: CACSL2BoogieTranslator took 347.20 ms. Allocated memory was 48.2 MB in the beginning and 62.9 MB in the end (delta: 14.7 MB). Free memory was 24.6 MB in the beginning and 40.1 MB in the end (delta: -15.5 MB). Peak memory consumption was 5.4 MB. Max. memory is 16.1 GB. [2020-10-25 21:53:56,250 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.16 ms. Allocated memory is still 62.9 MB. Free memory was 40.1 MB in the beginning and 38.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-25 21:53:56,251 INFO L168 Benchmark]: Boogie Preprocessor took 65.67 ms. Allocated memory is still 62.9 MB. Free memory was 38.2 MB in the beginning and 36.8 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-25 21:53:56,252 INFO L168 Benchmark]: RCFGBuilder took 844.90 ms. Allocated memory is still 62.9 MB. Free memory was 36.6 MB in the beginning and 33.4 MB in the end (delta: 3.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 16.1 GB. [2020-10-25 21:53:56,253 INFO L168 Benchmark]: TraceAbstraction took 1500.68 ms. Allocated memory was 62.9 MB in the beginning and 75.5 MB in the end (delta: 12.6 MB). Free memory was 32.9 MB in the beginning and 37.6 MB in the end (delta: -4.7 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.1 GB. [2020-10-25 21:53:56,254 INFO L168 Benchmark]: Witness Printer took 5.86 ms. Allocated memory is still 75.5 MB. Free memory was 37.6 MB in the beginning and 37.3 MB in the end (delta: 241.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 21:53:56,259 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.31 ms. Allocated memory is still 48.2 MB. Free memory was 32.2 MB in the beginning and 32.2 MB in the end (delta: 38.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 347.20 ms. Allocated memory was 48.2 MB in the beginning and 62.9 MB in the end (delta: 14.7 MB). Free memory was 24.6 MB in the beginning and 40.1 MB in the end (delta: -15.5 MB). Peak memory consumption was 5.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 86.16 ms. Allocated memory is still 62.9 MB. Free memory was 40.1 MB in the beginning and 38.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 65.67 ms. Allocated memory is still 62.9 MB. Free memory was 38.2 MB in the beginning and 36.8 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 844.90 ms. Allocated memory is still 62.9 MB. Free memory was 36.6 MB in the beginning and 33.4 MB in the end (delta: 3.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 1500.68 ms. Allocated memory was 62.9 MB in the beginning and 75.5 MB in the end (delta: 12.6 MB). Free memory was 32.9 MB in the beginning and 37.6 MB in the end (delta: -4.7 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.1 GB. * Witness Printer took 5.86 ms. Allocated memory is still 75.5 MB. Free memory was 37.6 MB in the beginning and 37.3 MB in the end (delta: 241.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 3]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someUnaryDOUBLEoperation at line 77. Possible FailurePath: [L76] double x = 0.0; [L77] double y = -0.0; [L21] __uint32_t msw, lsw; [L24] ieee_double_shape_type ew_u; [L25] ew_u.value = (x) [L26] EXPR ew_u.parts.msw [L26] (msw) = ew_u.parts.msw [L27] EXPR ew_u.parts.lsw [L27] (lsw) = ew_u.parts.lsw [L30-L31] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) [L33-L34] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) [L36-L37] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) [L40-L41] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L44] return 0; [L48] COND TRUE __fpclassify_double(x) == 0 [L49] return y; [L78] double res = fmin_double(x, y); [L81] EXPR res == -0.0 && __signbit_double(res) == 1 [L81] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L3] __assert_fail("0", "double_req_bl_1232a.c", 3, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 1.3s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 251 SDtfs, 64 SDslu, 298 SDs, 0 SdLazy, 84 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred 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, 5 MinimizatonAttempts, 60 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 74 NumberOfCodeBlocks, 74 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 55 ConstructedInterpolants, 0 QuantifiedInterpolants, 799 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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-5485861 [2020-10-25 21:53:58,995 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-25 21:53:58,998 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-25 21:53:59,034 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-25 21:53:59,035 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-25 21:53:59,036 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-25 21:53:59,038 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-25 21:53:59,041 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-25 21:53:59,043 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-25 21:53:59,044 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-25 21:53:59,045 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-25 21:53:59,047 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-25 21:53:59,047 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-25 21:53:59,049 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-25 21:53:59,050 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-25 21:53:59,052 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-25 21:53:59,053 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-25 21:53:59,054 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-25 21:53:59,057 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-25 21:53:59,059 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-25 21:53:59,061 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-25 21:53:59,063 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-25 21:53:59,065 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-25 21:53:59,066 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-25 21:53:59,070 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-25 21:53:59,070 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-25 21:53:59,071 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-25 21:53:59,072 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-25 21:53:59,073 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-25 21:53:59,074 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-25 21:53:59,074 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-25 21:53:59,075 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-25 21:53:59,076 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-25 21:53:59,078 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-25 21:53:59,079 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-25 21:53:59,080 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-25 21:53:59,081 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-25 21:53:59,081 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-25 21:53:59,081 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-25 21:53:59,083 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-25 21:53:59,084 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-25 21:53:59,086 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-10-25 21:53:59,135 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-25 21:53:59,146 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-25 21:53:59,147 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-25 21:53:59,148 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-25 21:53:59,148 INFO L138 SettingsManager]: * Use SBE=true [2020-10-25 21:53:59,148 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-25 21:53:59,149 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-25 21:53:59,149 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-25 21:53:59,149 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-25 21:53:59,149 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-25 21:53:59,149 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-25 21:53:59,150 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-25 21:53:59,150 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-10-25 21:53:59,150 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-10-25 21:53:59,150 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-25 21:53:59,151 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-25 21:53:59,151 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-25 21:53:59,151 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-25 21:53:59,151 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-25 21:53:59,152 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-25 21:53:59,152 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-25 21:53:59,152 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-25 21:53:59,152 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 21:53:59,152 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-25 21:53:59,153 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-25 21:53:59,153 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-25 21:53:59,153 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-10-25 21:53:59,153 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-10-25 21:53:59,154 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-25 21:53:59,154 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-25 21:53:59,154 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-25 21:53:59,154 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 -> 2f0e84dafea36c954c87753335c0002922188c68 [2020-10-25 21:53:59,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-25 21:53:59,623 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-25 21:53:59,626 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-25 21:53:59,628 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-25 21:53:59,629 INFO L275 PluginConnector]: CDTParser initialized [2020-10-25 21:53:59,630 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1232a.c [2020-10-25 21:53:59,725 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/780d87e94/4da9ac4ec4ce442590e796ab97269347/FLAG75c213700 [2020-10-25 21:54:00,415 INFO L306 CDTParser]: Found 1 translation units. [2020-10-25 21:54:00,416 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1232a.c [2020-10-25 21:54:00,426 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/780d87e94/4da9ac4ec4ce442590e796ab97269347/FLAG75c213700 [2020-10-25 21:54:00,734 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/780d87e94/4da9ac4ec4ce442590e796ab97269347 [2020-10-25 21:54:00,737 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-25 21:54:00,745 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-25 21:54:00,746 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-25 21:54:00,747 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-25 21:54:00,751 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-25 21:54:00,752 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 09:54:00" (1/1) ... [2020-10-25 21:54:00,756 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@635d9a9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:54:00, skipping insertion in model container [2020-10-25 21:54:00,757 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 09:54:00" (1/1) ... [2020-10-25 21:54:00,766 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-25 21:54:00,788 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-25 21:54:01,013 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 21:54:01,030 INFO L203 MainTranslator]: Completed pre-run [2020-10-25 21:54:01,062 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 21:54:01,088 INFO L208 MainTranslator]: Completed translation [2020-10-25 21:54:01,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:54:01 WrapperNode [2020-10-25 21:54:01,089 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-25 21:54:01,090 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-25 21:54:01,091 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-25 21:54:01,091 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-25 21:54:01,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:54:01" (1/1) ... [2020-10-25 21:54:01,114 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:54:01" (1/1) ... [2020-10-25 21:54:01,147 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-25 21:54:01,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-25 21:54:01,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-25 21:54:01,148 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-25 21:54:01,160 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:54:01" (1/1) ... [2020-10-25 21:54:01,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:54:01" (1/1) ... [2020-10-25 21:54:01,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:54:01" (1/1) ... [2020-10-25 21:54:01,166 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:54:01" (1/1) ... [2020-10-25 21:54:01,177 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:54:01" (1/1) ... [2020-10-25 21:54:01,190 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:54:01" (1/1) ... [2020-10-25 21:54:01,196 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:54:01" (1/1) ... [2020-10-25 21:54:01,207 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-25 21:54:01,209 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-25 21:54:01,212 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-25 21:54:01,212 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-25 21:54:01,214 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:54:01" (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-10-25 21:54:01,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2020-10-25 21:54:01,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-10-25 21:54:01,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-25 21:54:01,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-10-25 21:54:01,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-25 21:54:01,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-25 21:54:01,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-25 21:54:02,120 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-25 21:54:02,120 INFO L298 CfgBuilder]: Removed 20 assume(true) statements. [2020-10-25 21:54:02,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 09:54:02 BoogieIcfgContainer [2020-10-25 21:54:02,122 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-25 21:54:02,124 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-25 21:54:02,124 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-25 21:54:02,128 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-25 21:54:02,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 09:54:00" (1/3) ... [2020-10-25 21:54:02,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@258cb29b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 09:54:02, skipping insertion in model container [2020-10-25 21:54:02,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:54:01" (2/3) ... [2020-10-25 21:54:02,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@258cb29b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 09:54:02, skipping insertion in model container [2020-10-25 21:54:02,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 09:54:02" (3/3) ... [2020-10-25 21:54:02,131 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1232a.c [2020-10-25 21:54:02,144 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-25 21:54:02,149 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-25 21:54:02,171 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-25 21:54:02,200 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-25 21:54:02,200 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-25 21:54:02,201 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-25 21:54:02,201 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-25 21:54:02,201 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-25 21:54:02,201 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-25 21:54:02,201 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-25 21:54:02,202 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-25 21:54:02,217 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-10-25 21:54:02,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-25 21:54:02,223 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:54:02,224 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:54:02,225 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:54:02,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:54:02,231 INFO L82 PathProgramCache]: Analyzing trace with hash -958075201, now seen corresponding path program 1 times [2020-10-25 21:54:02,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 21:54:02,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1868591983] [2020-10-25 21:54:02,244 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-10-25 21:54:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:54:02,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 1 conjunts are in the unsatisfiable core [2020-10-25 21:54:02,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 21:54:02,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:54:02,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 21:54:02,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:54:02,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1868591983] [2020-10-25 21:54:02,377 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 21:54:02,378 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-10-25 21:54:02,379 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430653590] [2020-10-25 21:54:02,384 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-25 21:54:02,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 21:54:02,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-25 21:54:02,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-25 21:54:02,403 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2020-10-25 21:54:02,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:54:02,425 INFO L93 Difference]: Finished difference Result 63 states and 99 transitions. [2020-10-25 21:54:02,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-25 21:54:02,427 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-10-25 21:54:02,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:54:02,442 INFO L225 Difference]: With dead ends: 63 [2020-10-25 21:54:02,442 INFO L226 Difference]: Without dead ends: 29 [2020-10-25 21:54:02,445 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 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-10-25 21:54:02,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-10-25 21:54:02,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-10-25 21:54:02,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-10-25 21:54:02,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2020-10-25 21:54:02,486 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 10 [2020-10-25 21:54:02,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:54:02,487 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2020-10-25 21:54:02,487 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-25 21:54:02,488 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2020-10-25 21:54:02,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-25 21:54:02,488 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:54:02,489 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:54:02,703 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-25 21:54:02,703 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:54:02,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:54:02,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1001584898, now seen corresponding path program 1 times [2020-10-25 21:54:02,707 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 21:54:02,707 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [165080971] [2020-10-25 21:54:02,707 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-10-25 21:54:02,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:54:02,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-25 21:54:02,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 21:54:03,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:54:03,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 21:54:03,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:54:03,026 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [165080971] [2020-10-25 21:54:03,026 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 21:54:03,026 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-10-25 21:54:03,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556029660] [2020-10-25 21:54:03,028 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-25 21:54:03,029 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 21:54:03,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-25 21:54:03,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-25 21:54:03,030 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 6 states. [2020-10-25 21:54:03,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:54:03,157 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2020-10-25 21:54:03,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-25 21:54:03,158 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-10-25 21:54:03,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:54:03,159 INFO L225 Difference]: With dead ends: 68 [2020-10-25 21:54:03,159 INFO L226 Difference]: Without dead ends: 59 [2020-10-25 21:54:03,161 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-25 21:54:03,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-10-25 21:54:03,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 31. [2020-10-25 21:54:03,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-25 21:54:03,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2020-10-25 21:54:03,169 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 11 [2020-10-25 21:54:03,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:54:03,170 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2020-10-25 21:54:03,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-25 21:54:03,170 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2020-10-25 21:54:03,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-25 21:54:03,171 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:54:03,171 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:54:03,386 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-25 21:54:03,387 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:54:03,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:54:03,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1219247017, now seen corresponding path program 1 times [2020-10-25 21:54:03,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 21:54:03,390 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1544982500] [2020-10-25 21:54:03,390 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-10-25 21:54:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:54:03,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-25 21:54:03,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 21:54:03,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:54:03,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 21:54:03,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:54:03,611 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1544982500] [2020-10-25 21:54:03,611 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 21:54:03,611 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-10-25 21:54:03,612 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599138575] [2020-10-25 21:54:03,612 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-25 21:54:03,612 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 21:54:03,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-25 21:54:03,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-25 21:54:03,613 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 6 states. [2020-10-25 21:54:03,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:54:03,818 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2020-10-25 21:54:03,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 21:54:03,823 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-25 21:54:03,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:54:03,824 INFO L225 Difference]: With dead ends: 52 [2020-10-25 21:54:03,824 INFO L226 Difference]: Without dead ends: 28 [2020-10-25 21:54:03,825 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-25 21:54:03,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-10-25 21:54:03,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-10-25 21:54:03,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-10-25 21:54:03,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2020-10-25 21:54:03,837 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 14 [2020-10-25 21:54:03,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:54:03,837 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2020-10-25 21:54:03,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-25 21:54:03,837 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2020-10-25 21:54:03,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-25 21:54:03,838 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:54:03,838 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:54:04,039 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-10-25 21:54:04,040 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:54:04,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:54:04,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1012446717, now seen corresponding path program 1 times [2020-10-25 21:54:04,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 21:54:04,042 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1470669199] [2020-10-25 21:54:04,042 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-10-25 21:54:04,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:54:04,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-25 21:54:04,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 21:54:04,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:54:04,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 21:54:04,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:54:04,215 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1470669199] [2020-10-25 21:54:04,215 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 21:54:04,216 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-10-25 21:54:04,216 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417045473] [2020-10-25 21:54:04,216 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-25 21:54:04,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 21:54:04,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-25 21:54:04,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-25 21:54:04,218 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 6 states. [2020-10-25 21:54:04,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:54:04,412 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2020-10-25 21:54:04,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-25 21:54:04,413 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-25 21:54:04,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:54:04,414 INFO L225 Difference]: With dead ends: 65 [2020-10-25 21:54:04,414 INFO L226 Difference]: Without dead ends: 56 [2020-10-25 21:54:04,414 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-25 21:54:04,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-10-25 21:54:04,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 30. [2020-10-25 21:54:04,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-10-25 21:54:04,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2020-10-25 21:54:04,421 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 16 [2020-10-25 21:54:04,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:54:04,421 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-10-25 21:54:04,421 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-25 21:54:04,421 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-10-25 21:54:04,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-25 21:54:04,424 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:54:04,424 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:54:04,638 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-10-25 21:54:04,639 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:54:04,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:54:04,640 INFO L82 PathProgramCache]: Analyzing trace with hash -414082333, now seen corresponding path program 1 times [2020-10-25 21:54:04,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 21:54:04,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1713910662] [2020-10-25 21:54:04,641 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-10-25 21:54:04,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:54:04,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-25 21:54:04,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 21:54:04,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:54:04,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 21:54:04,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:54:04,855 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1713910662] [2020-10-25 21:54:04,855 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 21:54:04,855 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2020-10-25 21:54:04,856 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117782822] [2020-10-25 21:54:04,857 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 21:54:04,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 21:54:04,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 21:54:04,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-25 21:54:04,859 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 4 states. [2020-10-25 21:54:04,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:54:04,893 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2020-10-25 21:54:04,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 21:54:04,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-10-25 21:54:04,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:54:04,897 INFO L225 Difference]: With dead ends: 40 [2020-10-25 21:54:04,897 INFO L226 Difference]: Without dead ends: 30 [2020-10-25 21:54:04,898 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-25 21:54:04,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-10-25 21:54:04,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-10-25 21:54:04,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-10-25 21:54:04,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2020-10-25 21:54:04,911 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 18 [2020-10-25 21:54:04,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:54:04,912 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2020-10-25 21:54:04,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 21:54:04,912 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2020-10-25 21:54:04,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-25 21:54:04,915 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:54:04,915 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:54:05,129 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-10-25 21:54:05,130 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:54:05,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:54:05,131 INFO L82 PathProgramCache]: Analyzing trace with hash -356824031, now seen corresponding path program 1 times [2020-10-25 21:54:05,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 21:54:05,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1450768072] [2020-10-25 21:54:05,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-10-25 21:54:05,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:54:05,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-25 21:54:05,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 21:54:05,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:54:05,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 21:54:05,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:54:05,395 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1450768072] [2020-10-25 21:54:05,396 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 21:54:05,396 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2020-10-25 21:54:05,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946417390] [2020-10-25 21:54:05,396 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-25 21:54:05,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 21:54:05,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-25 21:54:05,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-25 21:54:05,397 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 9 states. [2020-10-25 21:54:05,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:54:05,545 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2020-10-25 21:54:05,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-25 21:54:05,546 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2020-10-25 21:54:05,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:54:05,547 INFO L225 Difference]: With dead ends: 42 [2020-10-25 21:54:05,547 INFO L226 Difference]: Without dead ends: 39 [2020-10-25 21:54:05,548 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-10-25 21:54:05,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-10-25 21:54:05,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2020-10-25 21:54:05,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-25 21:54:05,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2020-10-25 21:54:05,554 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 18 [2020-10-25 21:54:05,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:54:05,554 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2020-10-25 21:54:05,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-25 21:54:05,555 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2020-10-25 21:54:05,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-25 21:54:05,556 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:54:05,556 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:54:05,768 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-10-25 21:54:05,769 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:54:05,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:54:05,770 INFO L82 PathProgramCache]: Analyzing trace with hash -208358251, now seen corresponding path program 1 times [2020-10-25 21:54:05,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 21:54:05,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2008182941] [2020-10-25 21:54:05,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-10-25 21:54:05,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:54:05,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-25 21:54:05,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 21:54:05,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:54:05,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 21:54:05,995 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-25 21:54:06,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:54:06,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2008182941] [2020-10-25 21:54:06,171 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 21:54:06,171 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2020-10-25 21:54:06,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769736591] [2020-10-25 21:54:06,172 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-25 21:54:06,172 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 21:54:06,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-25 21:54:06,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-25 21:54:06,175 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 8 states. [2020-10-25 21:54:06,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:54:06,353 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2020-10-25 21:54:06,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 21:54:06,356 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-10-25 21:54:06,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:54:06,357 INFO L225 Difference]: With dead ends: 45 [2020-10-25 21:54:06,357 INFO L226 Difference]: Without dead ends: 27 [2020-10-25 21:54:06,358 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-10-25 21:54:06,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-10-25 21:54:06,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-10-25 21:54:06,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-25 21:54:06,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2020-10-25 21:54:06,369 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 19 [2020-10-25 21:54:06,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:54:06,369 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-10-25 21:54:06,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-25 21:54:06,369 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-10-25 21:54:06,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-25 21:54:06,370 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:54:06,370 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-10-25 21:54:06,585 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-10-25 21:54:06,586 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:54:06,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:54:06,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1524231306, now seen corresponding path program 1 times [2020-10-25 21:54:06,588 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 21:54:06,588 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [315280345] [2020-10-25 21:54:06,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2020-10-25 21:54:06,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:54:06,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 15 conjunts are in the unsatisfiable core [2020-10-25 21:54:06,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 21:54:06,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 21:54:06,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:54:06,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 21:54:07,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:54:07,319 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [315280345] [2020-10-25 21:54:07,319 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 21:54:07,319 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 16 [2020-10-25 21:54:07,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607186359] [2020-10-25 21:54:07,319 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-25 21:54:07,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 21:54:07,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-25 21:54:07,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2020-10-25 21:54:07,321 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 16 states. [2020-10-25 21:54:07,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:54:07,673 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2020-10-25 21:54:07,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-25 21:54:07,675 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2020-10-25 21:54:07,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:54:07,677 INFO L225 Difference]: With dead ends: 27 [2020-10-25 21:54:07,677 INFO L226 Difference]: Without dead ends: 0 [2020-10-25 21:54:07,678 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2020-10-25 21:54:07,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-25 21:54:07,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-25 21:54:07,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-25 21:54:07,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-25 21:54:07,681 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2020-10-25 21:54:07,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:54:07,681 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-25 21:54:07,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-25 21:54:07,682 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-25 21:54:07,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-25 21:54:07,882 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-10-25 21:54:07,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-25 21:54:08,315 INFO L270 CegarLoopResult]: At program point L44(lines 20 45) the Hoare annotation is: (and (= ULTIMATE.start_fmin_double_~y (fp.neg (_ +zero 11 53))) (= ULTIMATE.start_fmin_double_~x (_ +zero 11 53)) (= (_ +zero 11 53) ULTIMATE.start___fpclassify_double_~x) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64))) (and (= (_ +zero 11 53) (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3))) (= ((_ extract 63 32) v_skolemized_v_prenex_1_3) ULTIMATE.start___fpclassify_double_~msw~0))) (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_double_#res|))) [2020-10-25 21:54:08,316 INFO L270 CegarLoopResult]: At program point L44-1(lines 20 45) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= ULTIMATE.start_fmin_double_~y .cse0) (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) (fp.neg (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0))) (= ULTIMATE.start_fmin_double_~x (_ +zero 11 53)) (= ULTIMATE.start___fpclassify_double_~x .cse0) (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_double_#res|)))) [2020-10-25 21:54:08,316 INFO L274 CegarLoopResult]: For program point L36(lines 36 44) no Hoare annotation was computed. [2020-10-25 21:54:08,316 INFO L274 CegarLoopResult]: For program point L36-1(lines 36 44) no Hoare annotation was computed. [2020-10-25 21:54:08,316 INFO L274 CegarLoopResult]: For program point L3(line 3) no Hoare annotation was computed. [2020-10-25 21:54:08,316 INFO L274 CegarLoopResult]: For program point L3-1(line 3) no Hoare annotation was computed. [2020-10-25 21:54:08,316 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-10-25 21:54:08,316 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-10-25 21:54:08,316 INFO L277 CegarLoopResult]: At program point L86(lines 68 87) the Hoare annotation is: true [2020-10-25 21:54:08,317 INFO L274 CegarLoopResult]: For program point L53(line 53) no Hoare annotation was computed. [2020-10-25 21:54:08,317 INFO L274 CegarLoopResult]: For program point L53-2(line 53) no Hoare annotation was computed. [2020-10-25 21:54:08,317 INFO L270 CegarLoopResult]: At program point L53-3(lines 47 54) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= |ULTIMATE.start_fmin_double_#res| .cse0) (= ULTIMATE.start_fmin_double_~y .cse0) (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) (fp.neg (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0))) (= ULTIMATE.start_fmin_double_~x (_ +zero 11 53)) (= ULTIMATE.start___fpclassify_double_~x .cse0))) [2020-10-25 21:54:08,317 INFO L274 CegarLoopResult]: For program point L23-1(lines 23 28) no Hoare annotation was computed. [2020-10-25 21:54:08,317 INFO L270 CegarLoopResult]: At program point L23-2(lines 23 28) the Hoare annotation is: (and (= ULTIMATE.start_fmin_double_~y (fp.neg (_ +zero 11 53))) (= ULTIMATE.start_fmin_double_~x (_ +zero 11 53)) (= (_ +zero 11 53) ULTIMATE.start___fpclassify_double_~x)) [2020-10-25 21:54:08,317 INFO L274 CegarLoopResult]: For program point L23-3(lines 20 45) no Hoare annotation was computed. [2020-10-25 21:54:08,318 INFO L274 CegarLoopResult]: For program point L23-5(lines 23 28) no Hoare annotation was computed. [2020-10-25 21:54:08,318 INFO L270 CegarLoopResult]: At program point L23-6(lines 23 28) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= ULTIMATE.start_fmin_double_~y .cse0) (= ULTIMATE.start_fmin_double_~x (_ +zero 11 53)) (= ULTIMATE.start___fpclassify_double_~x .cse0))) [2020-10-25 21:54:08,319 INFO L274 CegarLoopResult]: For program point L81(line 81) no Hoare annotation was computed. [2020-10-25 21:54:08,319 INFO L274 CegarLoopResult]: For program point L48(lines 48 49) no Hoare annotation was computed. [2020-10-25 21:54:08,320 INFO L274 CegarLoopResult]: For program point L23-7(lines 20 45) no Hoare annotation was computed. [2020-10-25 21:54:08,320 INFO L274 CegarLoopResult]: For program point L81-2(lines 81 84) no Hoare annotation was computed. [2020-10-25 21:54:08,320 INFO L274 CegarLoopResult]: For program point L40(lines 40 44) no Hoare annotation was computed. [2020-10-25 21:54:08,320 INFO L274 CegarLoopResult]: For program point L40-1(lines 40 44) no Hoare annotation was computed. [2020-10-25 21:54:08,321 INFO L270 CegarLoopResult]: At program point L65(lines 56 66) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (exists ((v_skolemized_v_prenex_5_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_5_3) ((_ extract 62 52) v_skolemized_v_prenex_5_3) ((_ extract 51 0) v_skolemized_v_prenex_5_3)) (fp.neg (_ +zero 11 53))) (= ULTIMATE.start___signbit_double_~msw~1 ((_ extract 63 32) v_skolemized_v_prenex_5_3)))) |ULTIMATE.start_main_#t~short18| (= .cse0 ULTIMATE.start_main_~res~0) (= |ULTIMATE.start_fmin_double_#res| .cse0) (= ULTIMATE.start_fmin_double_~y .cse0) (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) (fp.neg (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0))) (= ULTIMATE.start_fmin_double_~x (_ +zero 11 53)) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= ULTIMATE.start___signbit_double_~x .cse0) (= (bvadd |ULTIMATE.start___signbit_double_#res| (_ bv4294967295 32)) (_ bv0 32)))) [2020-10-25 21:54:08,321 INFO L274 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-10-25 21:54:08,321 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-10-25 21:54:08,321 INFO L274 CegarLoopResult]: For program point L33(lines 33 44) no Hoare annotation was computed. [2020-10-25 21:54:08,322 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-10-25 21:54:08,322 INFO L274 CegarLoopResult]: For program point L33-1(lines 33 44) no Hoare annotation was computed. [2020-10-25 21:54:08,322 INFO L274 CegarLoopResult]: For program point L50(lines 50 51) no Hoare annotation was computed. [2020-10-25 21:54:08,322 INFO L274 CegarLoopResult]: For program point L59-1(lines 59 63) no Hoare annotation was computed. [2020-10-25 21:54:08,322 INFO L270 CegarLoopResult]: At program point L59-2(lines 59 63) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and |ULTIMATE.start_main_#t~short18| (= .cse0 ULTIMATE.start_main_~res~0) (= |ULTIMATE.start_fmin_double_#res| .cse0) (= ULTIMATE.start_fmin_double_~y .cse0) (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) (fp.neg (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0))) (= ULTIMATE.start_fmin_double_~x (_ +zero 11 53)) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= ULTIMATE.start___signbit_double_~x .cse0))) [2020-10-25 21:54:08,323 INFO L274 CegarLoopResult]: For program point L59-3(lines 59 63) no Hoare annotation was computed. [2020-10-25 21:54:08,339 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,341 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,341 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,341 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,342 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,343 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,343 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,343 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,345 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2020-10-25 21:54:08,345 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2020-10-25 21:54:08,345 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2020-10-25 21:54:08,346 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2020-10-25 21:54:08,346 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,346 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,346 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,348 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2020-10-25 21:54:08,348 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2020-10-25 21:54:08,348 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2020-10-25 21:54:08,348 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2020-10-25 21:54:08,349 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,349 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,349 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,349 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,351 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] [2020-10-25 21:54:08,352 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] [2020-10-25 21:54:08,352 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] [2020-10-25 21:54:08,352 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] [2020-10-25 21:54:08,353 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] [2020-10-25 21:54:08,353 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] [2020-10-25 21:54:08,353 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] [2020-10-25 21:54:08,353 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] [2020-10-25 21:54:08,354 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,354 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,354 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,357 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,357 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,357 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,358 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,358 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,358 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,358 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 09:54:08 BoogieIcfgContainer [2020-10-25 21:54:08,361 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-25 21:54:08,362 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-25 21:54:08,362 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-25 21:54:08,362 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-25 21:54:08,363 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 09:54:02" (3/4) ... [2020-10-25 21:54:08,367 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-10-25 21:54:08,381 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2020-10-25 21:54:08,382 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2020-10-25 21:54:08,382 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-10-25 21:54:08,383 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-25 21:54:08,415 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && x == ~Pluszero~LONGDOUBLE()) && ~Pluszero~LONGDOUBLE() == x) && (\exists v_skolemized_v_prenex_1_3 : bv64 :: ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_v_prenex_1_3[63:63], v_skolemized_v_prenex_1_3[62:52], v_skolemized_v_prenex_1_3[51:0]) && v_skolemized_v_prenex_1_3[63:32] == msw)) && !(0bv32 == \result) [2020-10-25 21:54:08,415 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && (\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_7[63:32] == msw)) && x == ~Pluszero~LONGDOUBLE()) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) [2020-10-25 21:54:08,416 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((aux-res == -0.0 && __signbit_double(res) == 1-aux && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == res) && \result == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && (\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_7[63:32] == msw)) && x == ~Pluszero~LONGDOUBLE()) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) [2020-10-25 21:54:08,416 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\exists v_skolemized_v_prenex_5_3 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_v_prenex_5_3[63:63], v_skolemized_v_prenex_5_3[62:52], v_skolemized_v_prenex_5_3[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && msw == v_skolemized_v_prenex_5_3[63:32]) && aux-res == -0.0 && __signbit_double(res) == 1-aux) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == res) && \result == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && (\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_7[63:32] == msw)) && x == ~Pluszero~LONGDOUBLE()) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~bvadd64(\result, 4294967295bv32) == 0bv32 [2020-10-25 21:54:08,417 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && (\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_7[63:32] == msw)) && x == ~Pluszero~LONGDOUBLE()) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && !(0bv32 == \result) [2020-10-25 21:54:08,452 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-25 21:54:08,453 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-25 21:54:08,455 INFO L168 Benchmark]: Toolchain (without parser) took 7714.66 ms. Allocated memory was 46.1 MB in the beginning and 69.2 MB in the end (delta: 23.1 MB). Free memory was 27.8 MB in the beginning and 40.9 MB in the end (delta: -13.1 MB). Peak memory consumption was 8.2 MB. Max. memory is 16.1 GB. [2020-10-25 21:54:08,456 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 46.1 MB. Free memory was 33.0 MB in the beginning and 32.9 MB in the end (delta: 36.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 21:54:08,456 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.20 ms. Allocated memory is still 46.1 MB. Free memory was 27.2 MB in the beginning and 27.3 MB in the end (delta: -91.8 kB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-10-25 21:54:08,457 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.74 ms. Allocated memory is still 46.1 MB. Free memory was 27.3 MB in the beginning and 25.5 MB in the end (delta: 1.8 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 21:54:08,458 INFO L168 Benchmark]: Boogie Preprocessor took 60.01 ms. Allocated memory is still 46.1 MB. Free memory was 25.5 MB in the beginning and 23.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-25 21:54:08,458 INFO L168 Benchmark]: RCFGBuilder took 913.47 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 23.7 MB in the beginning and 23.6 MB in the end (delta: 99.1 kB). Peak memory consumption was 14.2 MB. Max. memory is 16.1 GB. [2020-10-25 21:54:08,459 INFO L168 Benchmark]: TraceAbstraction took 6237.20 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 23.1 MB in the beginning and 45.1 MB in the end (delta: -22.0 MB). Peak memory consumption was 14.4 MB. Max. memory is 16.1 GB. [2020-10-25 21:54:08,460 INFO L168 Benchmark]: Witness Printer took 91.07 ms. Allocated memory is still 69.2 MB. Free memory was 45.1 MB in the beginning and 40.9 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-10-25 21:54:08,463 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.30 ms. Allocated memory is still 46.1 MB. Free memory was 33.0 MB in the beginning and 32.9 MB in the end (delta: 36.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 343.20 ms. Allocated memory is still 46.1 MB. Free memory was 27.2 MB in the beginning and 27.3 MB in the end (delta: -91.8 kB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 56.74 ms. Allocated memory is still 46.1 MB. Free memory was 27.3 MB in the beginning and 25.5 MB in the end (delta: 1.8 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 60.01 ms. Allocated memory is still 46.1 MB. Free memory was 25.5 MB in the beginning and 23.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 913.47 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 23.7 MB in the beginning and 23.6 MB in the end (delta: 99.1 kB). Peak memory consumption was 14.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 6237.20 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 23.1 MB in the beginning and 45.1 MB in the end (delta: -22.0 MB). Peak memory consumption was 14.4 MB. Max. memory is 16.1 GB. * Witness Printer took 91.07 ms. Allocated memory is still 69.2 MB. Free memory was 45.1 MB in the beginning and 40.9 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && x == ~Pluszero~LONGDOUBLE()) && ~Pluszero~LONGDOUBLE() == x - InvariantResult [Line: 20]: Loop Invariant [2020-10-25 21:54:08,480 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,481 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,481 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,481 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,482 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,482 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,482 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,482 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] Derived loop invariant: (((y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && (\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_7[63:32] == msw)) && x == ~Pluszero~LONGDOUBLE()) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && !(0bv32 == \result) - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 56]: Loop Invariant [2020-10-25 21:54:08,483 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2020-10-25 21:54:08,484 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2020-10-25 21:54:08,484 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2020-10-25 21:54:08,484 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2020-10-25 21:54:08,484 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,484 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,485 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,485 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,486 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2020-10-25 21:54:08,486 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2020-10-25 21:54:08,486 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2020-10-25 21:54:08,486 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2020-10-25 21:54:08,487 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,487 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,487 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,487 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] Derived loop invariant: (((((((((\exists v_skolemized_v_prenex_5_3 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_v_prenex_5_3[63:63], v_skolemized_v_prenex_5_3[62:52], v_skolemized_v_prenex_5_3[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && msw == v_skolemized_v_prenex_5_3[63:32]) && aux-res == -0.0 && __signbit_double(res) == 1-aux) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == res) && \result == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && (\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_7[63:32] == msw)) && x == ~Pluszero~LONGDOUBLE()) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~bvadd64(\result, 4294967295bv32) == 0bv32 - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && x == ~Pluszero~LONGDOUBLE()) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 20]: Loop Invariant [2020-10-25 21:54:08,489 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] [2020-10-25 21:54:08,489 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] [2020-10-25 21:54:08,489 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] [2020-10-25 21:54:08,489 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] [2020-10-25 21:54:08,490 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] [2020-10-25 21:54:08,490 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] [2020-10-25 21:54:08,490 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] [2020-10-25 21:54:08,490 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] Derived loop invariant: (((y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && x == ~Pluszero~LONGDOUBLE()) && ~Pluszero~LONGDOUBLE() == x) && (\exists v_skolemized_v_prenex_1_3 : bv64 :: ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_v_prenex_1_3[63:63], v_skolemized_v_prenex_1_3[62:52], v_skolemized_v_prenex_1_3[51:0]) && v_skolemized_v_prenex_1_3[63:32] == msw)) && !(0bv32 == \result) - InvariantResult [Line: 47]: Loop Invariant [2020-10-25 21:54:08,491 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,491 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,491 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,492 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,492 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,492 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,493 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,493 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] Derived loop invariant: (((\result == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && (\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_7[63:32] == msw)) && x == ~Pluszero~LONGDOUBLE()) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 59]: Loop Invariant [2020-10-25 21:54:08,493 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,494 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,494 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,494 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,494 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,495 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,495 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:08,495 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] Derived loop invariant: ((((((aux-res == -0.0 && __signbit_double(res) == 1-aux && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == res) && \result == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && (\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_7[63:32] == msw)) && x == ~Pluszero~LONGDOUBLE()) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5.6s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 252 SDtfs, 287 SDslu, 527 SDs, 0 SdLazy, 183 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 257 GetRequests, 196 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred 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, 8 MinimizatonAttempts, 61 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 16 NumberOfFragments, 221 HoareAnnotationTreeSize, 8 FomulaSimplifications, 51 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 8 FomulaSimplificationsInter, 33 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 240 ConstructedInterpolants, 32 QuantifiedInterpolants, 21250 SizeOfPredicates, 38 NumberOfNonLiveVariables, 555 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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 proved your program to be correct! Received shutdown request...