./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/float-newlib/float_req_bl_1251.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2880296f Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-newlib/float_req_bl_1251.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 32adbfac5f3e3ea232180afd045da0027ca6d993 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-newlib/float_req_bl_1251.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 32adbfac5f3e3ea232180afd045da0027ca6d993 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-2880296 [2020-12-02 16:20:26,774 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-02 16:20:26,777 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-02 16:20:26,814 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-02 16:20:26,815 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-02 16:20:26,816 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-02 16:20:26,818 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-02 16:20:26,823 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-02 16:20:26,827 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-02 16:20:26,829 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-02 16:20:26,830 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-02 16:20:26,833 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-02 16:20:26,833 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-02 16:20:26,836 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-02 16:20:26,838 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-02 16:20:26,841 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-02 16:20:26,844 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-02 16:20:26,847 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-02 16:20:26,853 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-02 16:20:26,857 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-02 16:20:26,865 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-02 16:20:26,868 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-02 16:20:26,869 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-02 16:20:26,870 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-02 16:20:26,880 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-02 16:20:26,881 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-02 16:20:26,881 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-02 16:20:26,884 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-02 16:20:26,885 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-02 16:20:26,886 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-02 16:20:26,886 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-02 16:20:26,887 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-02 16:20:26,889 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-02 16:20:26,890 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-02 16:20:26,891 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-02 16:20:26,892 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-02 16:20:26,892 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-02 16:20:26,893 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-02 16:20:26,896 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-02 16:20:26,897 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-02 16:20:26,897 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-02 16:20:26,899 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-12-02 16:20:26,953 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-02 16:20:26,953 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-02 16:20:26,956 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-02 16:20:26,956 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-02 16:20:26,957 INFO L138 SettingsManager]: * Use SBE=true [2020-12-02 16:20:26,957 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-02 16:20:26,957 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-02 16:20:26,957 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-02 16:20:26,957 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-02 16:20:26,958 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-02 16:20:26,959 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-02 16:20:26,959 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-02 16:20:26,959 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-02 16:20:26,959 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-02 16:20:26,959 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-02 16:20:26,960 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-02 16:20:26,960 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-02 16:20:26,960 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-02 16:20:26,960 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-02 16:20:26,960 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-02 16:20:26,960 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-02 16:20:26,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 16:20:26,961 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-02 16:20:26,961 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-02 16:20:26,961 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-02 16:20:26,961 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-02 16:20:26,962 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-02 16:20:26,962 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-02 16:20:26,962 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-02 16:20:26,962 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 -> 32adbfac5f3e3ea232180afd045da0027ca6d993 [2020-12-02 16:20:27,382 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-02 16:20:27,411 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-02 16:20:27,417 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-02 16:20:27,419 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-02 16:20:27,420 INFO L275 PluginConnector]: CDTParser initialized [2020-12-02 16:20:27,424 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/float_req_bl_1251.c [2020-12-02 16:20:27,517 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebd7652c7/6256badb31ca4511be2cea02c6bf6e3d/FLAGa1e288369 [2020-12-02 16:20:28,024 INFO L306 CDTParser]: Found 1 translation units. [2020-12-02 16:20:28,024 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_1251.c [2020-12-02 16:20:28,032 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebd7652c7/6256badb31ca4511be2cea02c6bf6e3d/FLAGa1e288369 [2020-12-02 16:20:28,400 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebd7652c7/6256badb31ca4511be2cea02c6bf6e3d [2020-12-02 16:20:28,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-02 16:20:28,409 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-02 16:20:28,414 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-02 16:20:28,414 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-02 16:20:28,419 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-02 16:20:28,420 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:20:28" (1/1) ... [2020-12-02 16:20:28,435 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fd7f406 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:20:28, skipping insertion in model container [2020-12-02 16:20:28,435 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:20:28" (1/1) ... [2020-12-02 16:20:28,450 INFO L146 MainTranslator]: Starting translation in SV-COMP mode [2020-12-02 16:20:28,483 INFO L179 MainTranslator]: Built tables and reachable declarations [2020-12-02 16:20:28,762 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_1251.c[1980,1993] [2020-12-02 16:20:28,776 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_1251.c[2139,2152] [2020-12-02 16:20:28,778 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-12-02 16:20:28,797 INFO L212 MainTranslator]: Completed pre-run [2020-12-02 16:20:28,828 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_1251.c[1980,1993] [2020-12-02 16:20:28,830 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_1251.c[2139,2152] [2020-12-02 16:20:28,831 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-12-02 16:20:28,849 INFO L217 MainTranslator]: Completed translation [2020-12-02 16:20:28,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:20:28 WrapperNode [2020-12-02 16:20:28,849 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-02 16:20:28,851 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-02 16:20:28,851 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-02 16:20:28,851 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-02 16:20:28,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:20:28" (1/1) ... [2020-12-02 16:20:28,869 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:20:28" (1/1) ... [2020-12-02 16:20:28,902 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-02 16:20:28,903 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-02 16:20:28,904 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-02 16:20:28,904 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-02 16:20:28,914 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:20:28" (1/1) ... [2020-12-02 16:20:28,914 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:20:28" (1/1) ... [2020-12-02 16:20:28,918 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:20:28" (1/1) ... [2020-12-02 16:20:28,918 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:20:28" (1/1) ... [2020-12-02 16:20:28,926 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:20:28" (1/1) ... [2020-12-02 16:20:28,932 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:20:28" (1/1) ... [2020-12-02 16:20:28,934 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:20:28" (1/1) ... [2020-12-02 16:20:28,938 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-02 16:20:28,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-02 16:20:28,939 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-02 16:20:28,939 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-02 16:20:28,940 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:20:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 16:20:29,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-02 16:20:29,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-02 16:20:29,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-12-02 16:20:29,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-02 16:20:29,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-02 16:20:29,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-02 16:20:29,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-02 16:20:29,524 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-02 16:20:29,525 INFO L298 CfgBuilder]: Removed 30 assume(true) statements. [2020-12-02 16:20:29,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:20:29 BoogieIcfgContainer [2020-12-02 16:20:29,527 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-02 16:20:29,529 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-02 16:20:29,530 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-02 16:20:29,533 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-02 16:20:29,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 04:20:28" (1/3) ... [2020-12-02 16:20:29,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7def416a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:20:29, skipping insertion in model container [2020-12-02 16:20:29,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:20:28" (2/3) ... [2020-12-02 16:20:29,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7def416a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:20:29, skipping insertion in model container [2020-12-02 16:20:29,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:20:29" (3/3) ... [2020-12-02 16:20:29,538 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1251.c [2020-12-02 16:20:29,555 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-02 16:20:29,560 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-02 16:20:29,574 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-12-02 16:20:29,602 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-02 16:20:29,605 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-02 16:20:29,605 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-02 16:20:29,605 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-02 16:20:29,605 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-02 16:20:29,606 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-02 16:20:29,606 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-02 16:20:29,606 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-02 16:20:29,621 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2020-12-02 16:20:29,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-02 16:20:29,627 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 16:20:29,627 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 16:20:29,628 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 16:20:29,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 16:20:29,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1204154757, now seen corresponding path program 1 times [2020-12-02 16:20:29,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 16:20:29,645 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887848133] [2020-12-02 16:20:29,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 16:20:29,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 16:20:29,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 16:20:29,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887848133] [2020-12-02 16:20:29,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 16:20:29,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 16:20:29,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857390976] [2020-12-02 16:20:29,858 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 16:20:29,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 16:20:29,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 16:20:29,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 16:20:29,876 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 4 states. [2020-12-02 16:20:29,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 16:20:29,959 INFO L93 Difference]: Finished difference Result 90 states and 134 transitions. [2020-12-02 16:20:29,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 16:20:29,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-12-02 16:20:29,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 16:20:29,972 INFO L225 Difference]: With dead ends: 90 [2020-12-02 16:20:29,973 INFO L226 Difference]: Without dead ends: 50 [2020-12-02 16:20:29,976 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-12-02 16:20:29,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-12-02 16:20:30,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2020-12-02 16:20:30,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-12-02 16:20:30,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2020-12-02 16:20:30,020 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 16 [2020-12-02 16:20:30,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 16:20:30,021 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2020-12-02 16:20:30,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 16:20:30,021 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2020-12-02 16:20:30,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-02 16:20:30,022 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 16:20:30,022 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 16:20:30,023 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-02 16:20:30,023 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 16:20:30,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 16:20:30,024 INFO L82 PathProgramCache]: Analyzing trace with hash 44236684, now seen corresponding path program 1 times [2020-12-02 16:20:30,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 16:20:30,024 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398010277] [2020-12-02 16:20:30,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 16:20:30,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 16:20:30,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 16:20:30,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398010277] [2020-12-02 16:20:30,172 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 16:20:30,173 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 16:20:30,173 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059826570] [2020-12-02 16:20:30,174 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 16:20:30,175 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 16:20:30,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 16:20:30,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 16:20:30,179 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 4 states. [2020-12-02 16:20:30,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 16:20:30,266 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2020-12-02 16:20:30,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-02 16:20:30,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-12-02 16:20:30,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 16:20:30,270 INFO L225 Difference]: With dead ends: 77 [2020-12-02 16:20:30,270 INFO L226 Difference]: Without dead ends: 64 [2020-12-02 16:20:30,271 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-12-02 16:20:30,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-12-02 16:20:30,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 47. [2020-12-02 16:20:30,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-12-02 16:20:30,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2020-12-02 16:20:30,284 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2020-12-02 16:20:30,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 16:20:30,284 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2020-12-02 16:20:30,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 16:20:30,284 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2020-12-02 16:20:30,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-02 16:20:30,286 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 16:20:30,286 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-12-02 16:20:30,286 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-02 16:20:30,286 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 16:20:30,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 16:20:30,287 INFO L82 PathProgramCache]: Analyzing trace with hash -674173253, now seen corresponding path program 1 times [2020-12-02 16:20:30,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 16:20:30,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693800278] [2020-12-02 16:20:30,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 16:20:30,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 16:20:30,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 16:20:30,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693800278] [2020-12-02 16:20:30,346 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 16:20:30,346 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 16:20:30,346 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692747011] [2020-12-02 16:20:30,347 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 16:20:30,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 16:20:30,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 16:20:30,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 16:20:30,348 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 4 states. [2020-12-02 16:20:30,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 16:20:30,397 INFO L93 Difference]: Finished difference Result 79 states and 99 transitions. [2020-12-02 16:20:30,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-02 16:20:30,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-12-02 16:20:30,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 16:20:30,399 INFO L225 Difference]: With dead ends: 79 [2020-12-02 16:20:30,399 INFO L226 Difference]: Without dead ends: 66 [2020-12-02 16:20:30,400 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-12-02 16:20:30,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-12-02 16:20:30,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 47. [2020-12-02 16:20:30,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-12-02 16:20:30,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2020-12-02 16:20:30,407 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 19 [2020-12-02 16:20:30,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 16:20:30,408 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2020-12-02 16:20:30,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 16:20:30,408 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2020-12-02 16:20:30,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-02 16:20:30,409 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 16:20:30,409 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 16:20:30,409 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-02 16:20:30,409 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 16:20:30,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 16:20:30,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1345927737, now seen corresponding path program 1 times [2020-12-02 16:20:30,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 16:20:30,411 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540557979] [2020-12-02 16:20:30,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 16:20:30,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 16:20:30,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 16:20:30,480 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540557979] [2020-12-02 16:20:30,481 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 16:20:30,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 16:20:30,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940960028] [2020-12-02 16:20:30,482 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 16:20:30,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 16:20:30,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 16:20:30,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 16:20:30,484 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 4 states. [2020-12-02 16:20:30,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 16:20:30,528 INFO L93 Difference]: Finished difference Result 81 states and 101 transitions. [2020-12-02 16:20:30,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-02 16:20:30,529 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-12-02 16:20:30,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 16:20:30,530 INFO L225 Difference]: With dead ends: 81 [2020-12-02 16:20:30,530 INFO L226 Difference]: Without dead ends: 68 [2020-12-02 16:20:30,531 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-12-02 16:20:30,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-12-02 16:20:30,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 47. [2020-12-02 16:20:30,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-12-02 16:20:30,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2020-12-02 16:20:30,538 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 20 [2020-12-02 16:20:30,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 16:20:30,538 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2020-12-02 16:20:30,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 16:20:30,539 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2020-12-02 16:20:30,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-02 16:20:30,540 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 16:20:30,540 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] [2020-12-02 16:20:30,540 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-02 16:20:30,541 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 16:20:30,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 16:20:30,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1380709804, now seen corresponding path program 1 times [2020-12-02 16:20:30,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 16:20:30,542 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957740538] [2020-12-02 16:20:30,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 16:20:30,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 16:20:30,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 16:20:30,587 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957740538] [2020-12-02 16:20:30,587 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 16:20:30,588 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-02 16:20:30,588 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9264605] [2020-12-02 16:20:30,589 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-02 16:20:30,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 16:20:30,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-02 16:20:30,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 16:20:30,590 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 3 states. [2020-12-02 16:20:30,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 16:20:30,602 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2020-12-02 16:20:30,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-02 16:20:30,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-12-02 16:20:30,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 16:20:30,604 INFO L225 Difference]: With dead ends: 50 [2020-12-02 16:20:30,604 INFO L226 Difference]: Without dead ends: 48 [2020-12-02 16:20:30,605 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 16:20:30,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-12-02 16:20:30,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-12-02 16:20:30,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-12-02 16:20:30,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2020-12-02 16:20:30,611 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 21 [2020-12-02 16:20:30,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 16:20:30,612 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2020-12-02 16:20:30,612 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-02 16:20:30,612 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2020-12-02 16:20:30,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-02 16:20:30,613 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 16:20:30,613 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 16:20:30,614 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-02 16:20:30,614 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 16:20:30,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 16:20:30,615 INFO L82 PathProgramCache]: Analyzing trace with hash 147544209, now seen corresponding path program 1 times [2020-12-02 16:20:30,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 16:20:30,616 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971254829] [2020-12-02 16:20:30,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 16:20:30,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-02 16:20:30,683 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-02 16:20:30,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-02 16:20:30,756 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-02 16:20:30,813 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-02 16:20:30,814 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-02 16:20:30,814 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-02 16:20:30,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 04:20:30 BoogieIcfgContainer [2020-12-02 16:20:30,866 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-02 16:20:30,867 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-02 16:20:30,867 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-02 16:20:30,867 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-02 16:20:30,868 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:20:29" (3/4) ... [2020-12-02 16:20:30,872 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-12-02 16:20:30,872 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-02 16:20:30,875 INFO L168 Benchmark]: Toolchain (without parser) took 2465.41 ms. Allocated memory was 44.0 MB in the beginning and 69.2 MB in the end (delta: 25.2 MB). Free memory was 20.9 MB in the beginning and 46.2 MB in the end (delta: -25.3 MB). Peak memory consumption was 1.4 MB. Max. memory is 16.1 GB. [2020-12-02 16:20:30,875 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 44.0 MB. Free memory is still 23.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 16:20:30,876 INFO L168 Benchmark]: CACSL2BoogieTranslator took 436.09 ms. Allocated memory was 44.0 MB in the beginning and 56.6 MB in the end (delta: 12.6 MB). Free memory was 20.7 MB in the beginning and 31.7 MB in the end (delta: -11.0 MB). Peak memory consumption was 3.3 MB. Max. memory is 16.1 GB. [2020-12-02 16:20:30,877 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.04 ms. Allocated memory is still 56.6 MB. Free memory was 31.7 MB in the beginning and 29.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-02 16:20:30,878 INFO L168 Benchmark]: Boogie Preprocessor took 34.87 ms. Allocated memory is still 56.6 MB. Free memory was 29.6 MB in the beginning and 28.1 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-02 16:20:30,879 INFO L168 Benchmark]: RCFGBuilder took 588.19 ms. Allocated memory is still 56.6 MB. Free memory was 28.1 MB in the beginning and 31.0 MB in the end (delta: -2.9 MB). Peak memory consumption was 6.8 MB. Max. memory is 16.1 GB. [2020-12-02 16:20:30,880 INFO L168 Benchmark]: TraceAbstraction took 1336.90 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 30.6 MB in the beginning and 46.9 MB in the end (delta: -16.3 MB). Peak memory consumption was 20.7 MB. Max. memory is 16.1 GB. [2020-12-02 16:20:30,881 INFO L168 Benchmark]: Witness Printer took 5.37 ms. Allocated memory is still 69.2 MB. Free memory was 46.9 MB in the beginning and 46.2 MB in the end (delta: 700.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 16:20:30,887 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.44 ms. Allocated memory is still 44.0 MB. Free memory is still 23.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 436.09 ms. Allocated memory was 44.0 MB in the beginning and 56.6 MB in the end (delta: 12.6 MB). Free memory was 20.7 MB in the beginning and 31.7 MB in the end (delta: -11.0 MB). Peak memory consumption was 3.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 52.04 ms. Allocated memory is still 56.6 MB. Free memory was 31.7 MB in the beginning and 29.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 34.87 ms. Allocated memory is still 56.6 MB. Free memory was 29.6 MB in the beginning and 28.1 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 588.19 ms. Allocated memory is still 56.6 MB. Free memory was 28.1 MB in the beginning and 31.0 MB in the end (delta: -2.9 MB). Peak memory consumption was 6.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 1336.90 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 30.6 MB in the beginning and 46.9 MB in the end (delta: -16.3 MB). Peak memory consumption was 20.7 MB. Max. memory is 16.1 GB. * Witness Printer took 5.37 ms. Allocated memory is still 69.2 MB. Free memory was 46.9 MB in the beginning and 46.2 MB in the end (delta: 700.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 76]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOAT_SMTComparisonOperation at line 75. Possible FailurePath: [L66] float x = __VERIFIER_nondet_float(); [L67] float y = __VERIFIER_nondet_float(); [L57] return x != x; [L69] EXPR isnan_float(x) && !isnan_float(y) [L57] return x != x; [L69] EXPR isnan_float(x) && !isnan_float(y) [L69-L70] (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L69-L70] COND TRUE (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L23] __uint32_t w; [L26] ieee_float_shape_type gf_u; [L27] gf_u.value = (x) [L28] EXPR gf_u.word [L28] (w) = gf_u.word [L31] COND FALSE !(w == 0x00000000 || w == 0x80000000) [L33-L34] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) [L36-L37] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) [L39] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L42] return 0; [L46] COND TRUE __fpclassify_float(x) == 0 [L47] return y; [L72] float res = fmax_float(x, y); [L57] return x != x; [L75] EXPR isnan_float(x) && !isnan_float(y) [L57] return x != x; [L75] EXPR isnan_float(x) && !isnan_float(y) [L75] COND TRUE isnan_float(x) && !isnan_float(y) && res != y [L76] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 47 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 1.2s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 343 SDtfs, 79 SDslu, 503 SDs, 0 SdLazy, 88 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=5, 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, 62 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 89 ConstructedInterpolants, 0 QuantifiedInterpolants, 1865 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-2880296 [2020-12-02 16:20:33,393 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-02 16:20:33,397 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-02 16:20:33,448 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-02 16:20:33,449 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-02 16:20:33,454 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-02 16:20:33,458 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-02 16:20:33,460 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-02 16:20:33,463 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-02 16:20:33,465 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-02 16:20:33,466 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-02 16:20:33,467 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-02 16:20:33,468 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-02 16:20:33,469 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-02 16:20:33,471 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-02 16:20:33,472 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-02 16:20:33,473 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-02 16:20:33,474 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-02 16:20:33,476 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-02 16:20:33,484 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-02 16:20:33,486 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-02 16:20:33,487 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-02 16:20:33,489 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-02 16:20:33,490 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-02 16:20:33,493 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-02 16:20:33,493 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-02 16:20:33,494 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-02 16:20:33,495 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-02 16:20:33,495 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-02 16:20:33,497 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-02 16:20:33,497 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-02 16:20:33,498 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-02 16:20:33,499 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-02 16:20:33,500 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-02 16:20:33,501 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-02 16:20:33,501 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-02 16:20:33,502 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-02 16:20:33,503 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-02 16:20:33,503 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-02 16:20:33,504 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-02 16:20:33,505 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-02 16:20:33,506 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-12-02 16:20:33,536 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-02 16:20:33,538 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-02 16:20:33,539 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-02 16:20:33,541 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-02 16:20:33,541 INFO L138 SettingsManager]: * Use SBE=true [2020-12-02 16:20:33,541 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-02 16:20:33,542 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-02 16:20:33,542 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-02 16:20:33,542 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-02 16:20:33,542 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-02 16:20:33,543 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-02 16:20:33,544 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-02 16:20:33,544 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-12-02 16:20:33,544 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-12-02 16:20:33,544 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-02 16:20:33,545 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-02 16:20:33,545 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-02 16:20:33,545 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-02 16:20:33,545 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-02 16:20:33,546 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-02 16:20:33,546 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-02 16:20:33,546 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-02 16:20:33,546 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 16:20:33,547 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-02 16:20:33,547 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-02 16:20:33,547 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-02 16:20:33,548 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-12-02 16:20:33,548 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-12-02 16:20:33,548 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-02 16:20:33,548 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-02 16:20:33,549 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-02 16:20:33,549 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 -> 32adbfac5f3e3ea232180afd045da0027ca6d993 [2020-12-02 16:20:34,004 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-02 16:20:34,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-02 16:20:34,037 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-02 16:20:34,038 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-02 16:20:34,039 INFO L275 PluginConnector]: CDTParser initialized [2020-12-02 16:20:34,040 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/float_req_bl_1251.c [2020-12-02 16:20:34,116 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46e1096a7/81e8e3e96ce740a9826f858ec7d1e395/FLAG2ee33a313 [2020-12-02 16:20:34,671 INFO L306 CDTParser]: Found 1 translation units. [2020-12-02 16:20:34,671 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_1251.c [2020-12-02 16:20:34,679 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46e1096a7/81e8e3e96ce740a9826f858ec7d1e395/FLAG2ee33a313 [2020-12-02 16:20:35,061 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46e1096a7/81e8e3e96ce740a9826f858ec7d1e395 [2020-12-02 16:20:35,066 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-02 16:20:35,069 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-02 16:20:35,071 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-02 16:20:35,072 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-02 16:20:35,076 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-02 16:20:35,077 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:20:35" (1/1) ... [2020-12-02 16:20:35,085 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@167aa10b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:20:35, skipping insertion in model container [2020-12-02 16:20:35,085 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:20:35" (1/1) ... [2020-12-02 16:20:35,094 INFO L146 MainTranslator]: Starting translation in SV-COMP mode [2020-12-02 16:20:35,119 INFO L179 MainTranslator]: Built tables and reachable declarations [2020-12-02 16:20:35,312 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_1251.c[1980,1993] [2020-12-02 16:20:35,320 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_1251.c[2139,2152] [2020-12-02 16:20:35,324 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-12-02 16:20:35,348 INFO L212 MainTranslator]: Completed pre-run [2020-12-02 16:20:35,373 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_1251.c[1980,1993] [2020-12-02 16:20:35,374 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_1251.c[2139,2152] [2020-12-02 16:20:35,375 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-12-02 16:20:35,396 INFO L217 MainTranslator]: Completed translation [2020-12-02 16:20:35,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:20:35 WrapperNode [2020-12-02 16:20:35,397 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-02 16:20:35,398 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-02 16:20:35,399 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-02 16:20:35,399 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-02 16:20:35,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:20:35" (1/1) ... [2020-12-02 16:20:35,421 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:20:35" (1/1) ... [2020-12-02 16:20:35,454 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-02 16:20:35,455 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-02 16:20:35,455 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-02 16:20:35,455 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-02 16:20:35,465 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:20:35" (1/1) ... [2020-12-02 16:20:35,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:20:35" (1/1) ... [2020-12-02 16:20:35,472 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:20:35" (1/1) ... [2020-12-02 16:20:35,472 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:20:35" (1/1) ... [2020-12-02 16:20:35,496 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:20:35" (1/1) ... [2020-12-02 16:20:35,508 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:20:35" (1/1) ... [2020-12-02 16:20:35,520 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:20:35" (1/1) ... [2020-12-02 16:20:35,525 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-02 16:20:35,526 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-02 16:20:35,526 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-02 16:20:35,526 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-02 16:20:35,527 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:20:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 16:20:35,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-12-02 16:20:35,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-02 16:20:35,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-12-02 16:20:35,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-02 16:20:35,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-02 16:20:35,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2020-12-02 16:20:35,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.float_to_bitvec_FLOAT [2020-12-02 16:20:35,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-02 16:20:36,060 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-02 16:20:36,061 INFO L298 CfgBuilder]: Removed 30 assume(true) statements. [2020-12-02 16:20:36,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:20:36 BoogieIcfgContainer [2020-12-02 16:20:36,063 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-02 16:20:36,065 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-02 16:20:36,065 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-02 16:20:36,069 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-02 16:20:36,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 04:20:35" (1/3) ... [2020-12-02 16:20:36,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c1a2417 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:20:36, skipping insertion in model container [2020-12-02 16:20:36,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:20:35" (2/3) ... [2020-12-02 16:20:36,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c1a2417 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:20:36, skipping insertion in model container [2020-12-02 16:20:36,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:20:36" (3/3) ... [2020-12-02 16:20:36,076 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1251.c [2020-12-02 16:20:36,120 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-02 16:20:36,129 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-02 16:20:36,154 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-12-02 16:20:36,195 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-02 16:20:36,196 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-02 16:20:36,196 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-02 16:20:36,196 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-02 16:20:36,196 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-02 16:20:36,196 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-02 16:20:36,196 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-02 16:20:36,196 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-02 16:20:36,211 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2020-12-02 16:20:36,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-02 16:20:36,218 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 16:20:36,218 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 16:20:36,219 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 16:20:36,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 16:20:36,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1204154757, now seen corresponding path program 1 times [2020-12-02 16:20:36,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 16:20:36,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1946210912] [2020-12-02 16:20:36,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-12-02 16:20:36,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 16:20:36,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 1 conjunts are in the unsatisfiable core [2020-12-02 16:20:36,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 16:20:36,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 16:20:36,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 16:20:36,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 16:20:36,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1946210912] [2020-12-02 16:20:36,408 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 16:20:36,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-12-02 16:20:36,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341006866] [2020-12-02 16:20:36,414 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-02 16:20:36,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 16:20:36,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-02 16:20:36,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-02 16:20:36,431 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2020-12-02 16:20:36,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 16:20:36,455 INFO L93 Difference]: Finished difference Result 82 states and 122 transitions. [2020-12-02 16:20:36,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-02 16:20:36,458 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2020-12-02 16:20:36,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 16:20:36,468 INFO L225 Difference]: With dead ends: 82 [2020-12-02 16:20:36,468 INFO L226 Difference]: Without dead ends: 43 [2020-12-02 16:20:36,471 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-02 16:20:36,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-12-02 16:20:36,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-12-02 16:20:36,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-12-02 16:20:36,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2020-12-02 16:20:36,510 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 16 [2020-12-02 16:20:36,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 16:20:36,510 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2020-12-02 16:20:36,510 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-02 16:20:36,511 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2020-12-02 16:20:36,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-02 16:20:36,512 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 16:20:36,512 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 16:20:36,728 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-12-02 16:20:36,729 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 16:20:36,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 16:20:36,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1262247077, now seen corresponding path program 1 times [2020-12-02 16:20:36,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 16:20:36,733 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1496665234] [2020-12-02 16:20:36,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-12-02 16:20:36,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 16:20:36,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-02 16:20:36,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 16:20:36,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 16:20:36,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 16:20:36,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 16:20:36,917 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1496665234] [2020-12-02 16:20:36,917 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 16:20:36,917 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-12-02 16:20:36,918 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688710145] [2020-12-02 16:20:36,919 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 16:20:36,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 16:20:36,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 16:20:36,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 16:20:36,922 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand 4 states. [2020-12-02 16:20:36,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 16:20:36,967 INFO L93 Difference]: Finished difference Result 82 states and 111 transitions. [2020-12-02 16:20:36,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 16:20:36,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-12-02 16:20:36,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 16:20:36,970 INFO L225 Difference]: With dead ends: 82 [2020-12-02 16:20:36,970 INFO L226 Difference]: Without dead ends: 50 [2020-12-02 16:20:36,971 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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-12-02 16:20:36,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-12-02 16:20:36,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2020-12-02 16:20:36,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-12-02 16:20:36,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2020-12-02 16:20:36,980 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 17 [2020-12-02 16:20:36,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 16:20:36,981 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2020-12-02 16:20:36,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 16:20:36,981 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2020-12-02 16:20:36,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-02 16:20:36,982 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 16:20:36,983 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 16:20:37,201 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-12-02 16:20:37,201 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 16:20:37,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 16:20:37,203 INFO L82 PathProgramCache]: Analyzing trace with hash 44236684, now seen corresponding path program 1 times [2020-12-02 16:20:37,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 16:20:37,204 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [589405216] [2020-12-02 16:20:37,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-12-02 16:20:37,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 16:20:37,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-02 16:20:37,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 16:20:37,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 16:20:37,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 16:20:37,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 16:20:37,348 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [589405216] [2020-12-02 16:20:37,348 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 16:20:37,348 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-12-02 16:20:37,349 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372321219] [2020-12-02 16:20:37,349 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 16:20:37,349 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 16:20:37,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 16:20:37,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-02 16:20:37,351 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 6 states. [2020-12-02 16:20:37,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 16:20:37,454 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2020-12-02 16:20:37,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 16:20:37,455 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-12-02 16:20:37,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 16:20:37,458 INFO L225 Difference]: With dead ends: 96 [2020-12-02 16:20:37,459 INFO L226 Difference]: Without dead ends: 83 [2020-12-02 16:20:37,460 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 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-12-02 16:20:37,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-12-02 16:20:37,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 47. [2020-12-02 16:20:37,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-12-02 16:20:37,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2020-12-02 16:20:37,483 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2020-12-02 16:20:37,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 16:20:37,484 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2020-12-02 16:20:37,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 16:20:37,484 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2020-12-02 16:20:37,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-02 16:20:37,486 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 16:20:37,486 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] [2020-12-02 16:20:37,699 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-12-02 16:20:37,700 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 16:20:37,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 16:20:37,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1380709804, now seen corresponding path program 1 times [2020-12-02 16:20:37,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 16:20:37,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [350288085] [2020-12-02 16:20:37,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-12-02 16:20:37,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 16:20:37,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-02 16:20:37,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 16:20:37,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 16:20:37,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 16:20:37,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 16:20:37,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [350288085] [2020-12-02 16:20:37,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 16:20:37,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-12-02 16:20:37,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180405468] [2020-12-02 16:20:37,846 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-02 16:20:37,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 16:20:37,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-02 16:20:37,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 16:20:37,848 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 3 states. [2020-12-02 16:20:37,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 16:20:37,865 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2020-12-02 16:20:37,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-02 16:20:37,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-12-02 16:20:37,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 16:20:37,867 INFO L225 Difference]: With dead ends: 50 [2020-12-02 16:20:37,867 INFO L226 Difference]: Without dead ends: 48 [2020-12-02 16:20:37,867 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 16:20:37,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-12-02 16:20:37,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-12-02 16:20:37,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-12-02 16:20:37,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2020-12-02 16:20:37,873 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 21 [2020-12-02 16:20:37,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 16:20:37,874 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2020-12-02 16:20:37,874 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-02 16:20:37,874 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2020-12-02 16:20:37,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-02 16:20:37,875 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 16:20:37,875 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 16:20:38,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-12-02 16:20:38,090 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 16:20:38,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 16:20:38,092 INFO L82 PathProgramCache]: Analyzing trace with hash 147544209, now seen corresponding path program 1 times [2020-12-02 16:20:38,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 16:20:38,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [946919319] [2020-12-02 16:20:38,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-12-02 16:20:38,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 16:20:38,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-02 16:20:38,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 16:20:38,240 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-02 16:20:38,241 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 16:20:38,272 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 16:20:38,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 16:20:38,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 16:20:38,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 16:20:38,593 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [946919319] [2020-12-02 16:20:38,593 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 16:20:38,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 15 [2020-12-02 16:20:38,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068329281] [2020-12-02 16:20:38,594 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-02 16:20:38,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 16:20:38,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-02 16:20:38,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2020-12-02 16:20:38,596 INFO L87 Difference]: Start difference. First operand 48 states and 63 transitions. Second operand 15 states. [2020-12-02 16:20:39,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 16:20:39,318 INFO L93 Difference]: Finished difference Result 136 states and 173 transitions. [2020-12-02 16:20:39,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-02 16:20:39,319 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2020-12-02 16:20:39,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 16:20:39,320 INFO L225 Difference]: With dead ends: 136 [2020-12-02 16:20:39,320 INFO L226 Difference]: Without dead ends: 134 [2020-12-02 16:20:39,321 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=465, Unknown=0, NotChecked=0, Total=650 [2020-12-02 16:20:39,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-12-02 16:20:39,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 61. [2020-12-02 16:20:39,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-12-02 16:20:39,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 82 transitions. [2020-12-02 16:20:39,331 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 82 transitions. Word has length 22 [2020-12-02 16:20:39,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 16:20:39,332 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 82 transitions. [2020-12-02 16:20:39,332 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-02 16:20:39,332 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 82 transitions. [2020-12-02 16:20:39,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-02 16:20:39,333 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 16:20:39,333 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 16:20:39,547 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-12-02 16:20:39,549 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 16:20:39,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 16:20:39,550 INFO L82 PathProgramCache]: Analyzing trace with hash 156888005, now seen corresponding path program 1 times [2020-12-02 16:20:39,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 16:20:39,551 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1033983941] [2020-12-02 16:20:39,551 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-12-02 16:20:39,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 16:20:39,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-02 16:20:39,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 16:20:39,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 16:20:39,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 16:20:39,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 16:20:39,704 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1033983941] [2020-12-02 16:20:39,704 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 16:20:39,704 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-12-02 16:20:39,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20299388] [2020-12-02 16:20:39,705 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 16:20:39,705 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 16:20:39,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 16:20:39,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-02 16:20:39,706 INFO L87 Difference]: Start difference. First operand 61 states and 82 transitions. Second operand 6 states. [2020-12-02 16:20:39,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 16:20:39,772 INFO L93 Difference]: Finished difference Result 113 states and 141 transitions. [2020-12-02 16:20:39,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 16:20:39,772 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-12-02 16:20:39,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 16:20:39,774 INFO L225 Difference]: With dead ends: 113 [2020-12-02 16:20:39,774 INFO L226 Difference]: Without dead ends: 99 [2020-12-02 16:20:39,775 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 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-12-02 16:20:39,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-12-02 16:20:39,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 63. [2020-12-02 16:20:39,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-12-02 16:20:39,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 84 transitions. [2020-12-02 16:20:39,794 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 84 transitions. Word has length 24 [2020-12-02 16:20:39,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 16:20:39,794 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 84 transitions. [2020-12-02 16:20:39,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 16:20:39,795 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 84 transitions. [2020-12-02 16:20:39,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-02 16:20:39,800 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 16:20:39,800 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 16:20:40,013 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-12-02 16:20:40,014 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 16:20:40,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 16:20:40,016 INFO L82 PathProgramCache]: Analyzing trace with hash 180010974, now seen corresponding path program 1 times [2020-12-02 16:20:40,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 16:20:40,017 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [556564989] [2020-12-02 16:20:40,017 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-12-02 16:20:40,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 16:20:40,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-02 16:20:40,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 16:20:40,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 16:20:40,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 16:20:40,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 16:20:40,157 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [556564989] [2020-12-02 16:20:40,158 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 16:20:40,158 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-12-02 16:20:40,159 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374261604] [2020-12-02 16:20:40,161 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-02 16:20:40,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 16:20:40,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-02 16:20:40,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 16:20:40,169 INFO L87 Difference]: Start difference. First operand 63 states and 84 transitions. Second operand 3 states. [2020-12-02 16:20:40,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 16:20:40,182 INFO L93 Difference]: Finished difference Result 66 states and 86 transitions. [2020-12-02 16:20:40,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-02 16:20:40,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-12-02 16:20:40,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 16:20:40,184 INFO L225 Difference]: With dead ends: 66 [2020-12-02 16:20:40,184 INFO L226 Difference]: Without dead ends: 63 [2020-12-02 16:20:40,185 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 16:20:40,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-12-02 16:20:40,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-12-02 16:20:40,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-12-02 16:20:40,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 83 transitions. [2020-12-02 16:20:40,211 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 83 transitions. Word has length 24 [2020-12-02 16:20:40,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 16:20:40,211 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 83 transitions. [2020-12-02 16:20:40,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-02 16:20:40,212 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 83 transitions. [2020-12-02 16:20:40,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-02 16:20:40,214 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 16:20:40,214 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 16:20:40,415 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-12-02 16:20:40,416 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 16:20:40,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 16:20:40,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1382111440, now seen corresponding path program 1 times [2020-12-02 16:20:40,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 16:20:40,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1114886311] [2020-12-02 16:20:40,418 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-12-02 16:20:40,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 16:20:40,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-02 16:20:40,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 16:20:40,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 16:20:40,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 16:20:40,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 16:20:40,553 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1114886311] [2020-12-02 16:20:40,553 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 16:20:40,554 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-12-02 16:20:40,554 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511888347] [2020-12-02 16:20:40,554 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 16:20:40,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 16:20:40,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 16:20:40,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 16:20:40,556 INFO L87 Difference]: Start difference. First operand 63 states and 83 transitions. Second operand 4 states. [2020-12-02 16:20:40,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 16:20:40,586 INFO L93 Difference]: Finished difference Result 101 states and 132 transitions. [2020-12-02 16:20:40,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-02 16:20:40,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-12-02 16:20:40,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 16:20:40,587 INFO L225 Difference]: With dead ends: 101 [2020-12-02 16:20:40,587 INFO L226 Difference]: Without dead ends: 63 [2020-12-02 16:20:40,588 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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-12-02 16:20:40,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-12-02 16:20:40,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-12-02 16:20:40,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-12-02 16:20:40,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2020-12-02 16:20:40,595 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 24 [2020-12-02 16:20:40,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 16:20:40,595 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. [2020-12-02 16:20:40,595 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 16:20:40,595 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2020-12-02 16:20:40,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-02 16:20:40,597 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 16:20:40,597 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 16:20:40,810 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-12-02 16:20:40,811 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 16:20:40,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 16:20:40,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1285248088, now seen corresponding path program 1 times [2020-12-02 16:20:40,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 16:20:40,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [309908366] [2020-12-02 16:20:40,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2020-12-02 16:20:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 16:20:40,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 13 conjunts are in the unsatisfiable core [2020-12-02 16:20:40,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 16:20:40,947 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-02 16:20:40,947 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 16:20:40,967 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 16:20:41,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 16:20:41,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 16:20:41,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 16:20:41,155 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [309908366] [2020-12-02 16:20:41,156 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 16:20:41,156 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 11 [2020-12-02 16:20:41,156 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748788588] [2020-12-02 16:20:41,156 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-02 16:20:41,157 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 16:20:41,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-02 16:20:41,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-12-02 16:20:41,158 INFO L87 Difference]: Start difference. First operand 63 states and 82 transitions. Second operand 11 states. [2020-12-02 16:20:41,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 16:20:41,734 INFO L93 Difference]: Finished difference Result 97 states and 122 transitions. [2020-12-02 16:20:41,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-02 16:20:41,735 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-12-02 16:20:41,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 16:20:41,736 INFO L225 Difference]: With dead ends: 97 [2020-12-02 16:20:41,737 INFO L226 Difference]: Without dead ends: 85 [2020-12-02 16:20:41,738 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2020-12-02 16:20:41,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-12-02 16:20:41,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 76. [2020-12-02 16:20:41,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-12-02 16:20:41,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 99 transitions. [2020-12-02 16:20:41,755 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 99 transitions. Word has length 25 [2020-12-02 16:20:41,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 16:20:41,756 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 99 transitions. [2020-12-02 16:20:41,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-02 16:20:41,756 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 99 transitions. [2020-12-02 16:20:41,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-02 16:20:41,762 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 16:20:41,762 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 16:20:41,974 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-12-02 16:20:41,975 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 16:20:41,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 16:20:41,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1281876129, now seen corresponding path program 1 times [2020-12-02 16:20:41,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 16:20:41,977 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2098579439] [2020-12-02 16:20:41,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2020-12-02 16:20:42,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 16:20:42,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 13 conjunts are in the unsatisfiable core [2020-12-02 16:20:42,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 16:20:42,097 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-02 16:20:42,098 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 16:20:42,124 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 16:20:42,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 16:20:42,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 16:20:42,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 16:20:42,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2098579439] [2020-12-02 16:20:42,311 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 16:20:42,311 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 12 [2020-12-02 16:20:42,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484589336] [2020-12-02 16:20:42,312 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-02 16:20:42,312 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 16:20:42,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-02 16:20:42,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-12-02 16:20:42,313 INFO L87 Difference]: Start difference. First operand 76 states and 99 transitions. Second operand 12 states. [2020-12-02 16:20:42,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 16:20:42,659 INFO L93 Difference]: Finished difference Result 78 states and 100 transitions. [2020-12-02 16:20:42,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-02 16:20:42,660 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2020-12-02 16:20:42,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 16:20:42,661 INFO L225 Difference]: With dead ends: 78 [2020-12-02 16:20:42,661 INFO L226 Difference]: Without dead ends: 76 [2020-12-02 16:20:42,661 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2020-12-02 16:20:42,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-12-02 16:20:42,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2020-12-02 16:20:42,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-12-02 16:20:42,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 97 transitions. [2020-12-02 16:20:42,669 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 97 transitions. Word has length 25 [2020-12-02 16:20:42,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 16:20:42,670 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 97 transitions. [2020-12-02 16:20:42,670 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-02 16:20:42,670 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 97 transitions. [2020-12-02 16:20:42,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-02 16:20:42,671 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 16:20:42,671 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 16:20:42,887 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2020-12-02 16:20:42,888 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 16:20:42,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 16:20:42,889 INFO L82 PathProgramCache]: Analyzing trace with hash -144403189, now seen corresponding path program 1 times [2020-12-02 16:20:42,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 16:20:42,890 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1735106067] [2020-12-02 16:20:42,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2020-12-02 16:20:42,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 16:20:42,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-02 16:20:43,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 16:20:43,033 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-02 16:20:43,033 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 16:20:43,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 16:20:43,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 16:20:43,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 16:20:43,249 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1735106067] [2020-12-02 16:20:43,249 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 16:20:43,249 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2020-12-02 16:20:43,250 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579426076] [2020-12-02 16:20:43,250 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-02 16:20:43,250 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 16:20:43,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-02 16:20:43,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-12-02 16:20:43,251 INFO L87 Difference]: Start difference. First operand 75 states and 97 transitions. Second operand 12 states. [2020-12-02 16:20:43,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 16:20:43,844 INFO L93 Difference]: Finished difference Result 216 states and 262 transitions. [2020-12-02 16:20:43,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-02 16:20:43,844 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2020-12-02 16:20:43,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 16:20:43,845 INFO L225 Difference]: With dead ends: 216 [2020-12-02 16:20:43,845 INFO L226 Difference]: Without dead ends: 170 [2020-12-02 16:20:43,846 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2020-12-02 16:20:43,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2020-12-02 16:20:43,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 86. [2020-12-02 16:20:43,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-12-02 16:20:43,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 104 transitions. [2020-12-02 16:20:43,861 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 104 transitions. Word has length 26 [2020-12-02 16:20:43,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 16:20:43,862 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 104 transitions. [2020-12-02 16:20:43,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-02 16:20:43,862 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 104 transitions. [2020-12-02 16:20:43,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-02 16:20:43,863 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 16:20:43,863 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 16:20:44,069 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2020-12-02 16:20:44,070 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 16:20:44,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 16:20:44,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1364791880, now seen corresponding path program 1 times [2020-12-02 16:20:44,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 16:20:44,072 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1538359872] [2020-12-02 16:20:44,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2020-12-02 16:20:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 16:20:44,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 19 conjunts are in the unsatisfiable core [2020-12-02 16:20:44,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 16:20:44,196 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-02 16:20:44,197 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 16:20:44,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 16:20:44,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 16:20:44,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 16:20:44,610 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1538359872] [2020-12-02 16:20:44,611 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 16:20:44,611 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 12 [2020-12-02 16:20:44,611 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681246790] [2020-12-02 16:20:44,613 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-02 16:20:44,613 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 16:20:44,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-02 16:20:44,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-12-02 16:20:44,614 INFO L87 Difference]: Start difference. First operand 86 states and 104 transitions. Second operand 12 states. [2020-12-02 16:20:45,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 16:20:45,986 INFO L93 Difference]: Finished difference Result 308 states and 347 transitions. [2020-12-02 16:20:45,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-12-02 16:20:45,986 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2020-12-02 16:20:45,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 16:20:45,988 INFO L225 Difference]: With dead ends: 308 [2020-12-02 16:20:45,988 INFO L226 Difference]: Without dead ends: 283 [2020-12-02 16:20:45,990 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=251, Invalid=805, Unknown=0, NotChecked=0, Total=1056 [2020-12-02 16:20:45,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2020-12-02 16:20:46,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 86. [2020-12-02 16:20:46,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-12-02 16:20:46,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 103 transitions. [2020-12-02 16:20:46,003 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 103 transitions. Word has length 28 [2020-12-02 16:20:46,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 16:20:46,004 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 103 transitions. [2020-12-02 16:20:46,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-02 16:20:46,004 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 103 transitions. [2020-12-02 16:20:46,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-02 16:20:46,005 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 16:20:46,005 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 16:20:46,224 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2020-12-02 16:20:46,225 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 16:20:46,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 16:20:46,226 INFO L82 PathProgramCache]: Analyzing trace with hash -2092804141, now seen corresponding path program 1 times [2020-12-02 16:20:46,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 16:20:46,227 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2041872886] [2020-12-02 16:20:46,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2020-12-02 16:20:46,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 16:20:46,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-02 16:20:46,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 16:20:46,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 16:20:46,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 16:20:46,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 16:20:46,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2041872886] [2020-12-02 16:20:46,357 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 16:20:46,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-12-02 16:20:46,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900540642] [2020-12-02 16:20:46,358 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 16:20:46,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 16:20:46,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 16:20:46,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 16:20:46,362 INFO L87 Difference]: Start difference. First operand 86 states and 103 transitions. Second operand 4 states. [2020-12-02 16:20:46,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 16:20:46,407 INFO L93 Difference]: Finished difference Result 122 states and 146 transitions. [2020-12-02 16:20:46,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-02 16:20:46,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-12-02 16:20:46,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 16:20:46,408 INFO L225 Difference]: With dead ends: 122 [2020-12-02 16:20:46,410 INFO L226 Difference]: Without dead ends: 71 [2020-12-02 16:20:46,415 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 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-12-02 16:20:46,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-12-02 16:20:46,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 58. [2020-12-02 16:20:46,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-12-02 16:20:46,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2020-12-02 16:20:46,422 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 29 [2020-12-02 16:20:46,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 16:20:46,422 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2020-12-02 16:20:46,423 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 16:20:46,423 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2020-12-02 16:20:46,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-02 16:20:46,424 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 16:20:46,424 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 16:20:46,637 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2020-12-02 16:20:46,638 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 16:20:46,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 16:20:46,639 INFO L82 PathProgramCache]: Analyzing trace with hash 2049272065, now seen corresponding path program 1 times [2020-12-02 16:20:46,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 16:20:46,640 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1418875110] [2020-12-02 16:20:46,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 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2020-12-02 16:20:46,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 16:20:46,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-02 16:20:46,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 16:20:46,769 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-02 16:20:46,769 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 16:20:46,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 16:20:46,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 16:20:46,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 16:20:46,931 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1418875110] [2020-12-02 16:20:46,932 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 16:20:46,932 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2020-12-02 16:20:46,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081253005] [2020-12-02 16:20:46,932 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-02 16:20:46,933 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 16:20:46,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-02 16:20:46,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-12-02 16:20:46,934 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand 10 states. [2020-12-02 16:20:47,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 16:20:47,164 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2020-12-02 16:20:47,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-02 16:20:47,164 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2020-12-02 16:20:47,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 16:20:47,165 INFO L225 Difference]: With dead ends: 70 [2020-12-02 16:20:47,165 INFO L226 Difference]: Without dead ends: 43 [2020-12-02 16:20:47,166 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2020-12-02 16:20:47,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-12-02 16:20:47,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2020-12-02 16:20:47,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-12-02 16:20:47,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2020-12-02 16:20:47,172 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 29 [2020-12-02 16:20:47,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 16:20:47,172 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2020-12-02 16:20:47,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-02 16:20:47,172 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2020-12-02 16:20:47,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-12-02 16:20:47,173 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 16:20:47,173 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 16:20:47,382 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2020-12-02 16:20:47,383 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 16:20:47,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 16:20:47,384 INFO L82 PathProgramCache]: Analyzing trace with hash 430789518, now seen corresponding path program 1 times [2020-12-02 16:20:47,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 16:20:47,385 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2141581545] [2020-12-02 16:20:47,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2020-12-02 16:20:47,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 16:20:47,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 13 conjunts are in the unsatisfiable core [2020-12-02 16:20:47,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 16:20:47,508 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-02 16:20:47,509 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 16:20:47,528 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 16:20:47,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-12-02 16:20:47,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 16:20:47,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 16:20:47,800 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2141581545] [2020-12-02 16:20:47,800 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 16:20:47,800 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2020-12-02 16:20:47,800 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602014337] [2020-12-02 16:20:47,801 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-02 16:20:47,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 16:20:47,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-02 16:20:47,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-12-02 16:20:47,801 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand 14 states. [2020-12-02 16:20:48,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 16:20:48,427 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2020-12-02 16:20:48,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-02 16:20:48,428 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2020-12-02 16:20:48,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 16:20:48,428 INFO L225 Difference]: With dead ends: 58 [2020-12-02 16:20:48,428 INFO L226 Difference]: Without dead ends: 43 [2020-12-02 16:20:48,429 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2020-12-02 16:20:48,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-12-02 16:20:48,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2020-12-02 16:20:48,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-12-02 16:20:48,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2020-12-02 16:20:48,439 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 32 [2020-12-02 16:20:48,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 16:20:48,440 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2020-12-02 16:20:48,440 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-02 16:20:48,441 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-12-02 16:20:48,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-02 16:20:48,442 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 16:20:48,442 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 16:20:48,652 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2020-12-02 16:20:48,653 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 16:20:48,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 16:20:48,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1713269395, now seen corresponding path program 1 times [2020-12-02 16:20:48,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 16:20:48,655 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [444147547] [2020-12-02 16:20:48,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2020-12-02 16:20:48,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 16:20:48,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-02 16:20:48,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 16:20:48,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 16:20:48,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 16:20:49,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 16:20:49,041 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [444147547] [2020-12-02 16:20:49,041 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 16:20:49,042 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2020-12-02 16:20:49,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041296359] [2020-12-02 16:20:49,042 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-02 16:20:49,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 16:20:49,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-02 16:20:49,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-12-02 16:20:49,043 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 12 states. [2020-12-02 16:20:49,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 16:20:49,408 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2020-12-02 16:20:49,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-02 16:20:49,408 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2020-12-02 16:20:49,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 16:20:49,409 INFO L225 Difference]: With dead ends: 83 [2020-12-02 16:20:49,409 INFO L226 Difference]: Without dead ends: 63 [2020-12-02 16:20:49,410 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2020-12-02 16:20:49,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-12-02 16:20:49,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 40. [2020-12-02 16:20:49,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-12-02 16:20:49,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2020-12-02 16:20:49,417 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 33 [2020-12-02 16:20:49,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 16:20:49,418 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2020-12-02 16:20:49,418 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-02 16:20:49,418 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2020-12-02 16:20:49,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-02 16:20:49,419 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 16:20:49,419 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 16:20:49,634 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2020-12-02 16:20:49,634 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 16:20:49,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 16:20:49,635 INFO L82 PathProgramCache]: Analyzing trace with hash 739407273, now seen corresponding path program 1 times [2020-12-02 16:20:49,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 16:20:49,636 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1605303560] [2020-12-02 16:20:49,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2020-12-02 16:20:49,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 16:20:49,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-02 16:20:49,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 16:20:49,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 16:20:49,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 16:20:49,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 16:20:49,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1605303560] [2020-12-02 16:20:49,803 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 16:20:49,803 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-12-02 16:20:49,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433189470] [2020-12-02 16:20:49,804 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 16:20:49,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 16:20:49,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 16:20:49,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 16:20:49,805 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 4 states. [2020-12-02 16:20:49,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 16:20:49,824 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2020-12-02 16:20:49,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-02 16:20:49,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-12-02 16:20:49,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 16:20:49,825 INFO L225 Difference]: With dead ends: 40 [2020-12-02 16:20:49,825 INFO L226 Difference]: Without dead ends: 0 [2020-12-02 16:20:49,826 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 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-12-02 16:20:49,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-02 16:20:49,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-02 16:20:49,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-02 16:20:49,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-02 16:20:49,827 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2020-12-02 16:20:49,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 16:20:49,827 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-02 16:20:49,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 16:20:49,827 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-02 16:20:49,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-02 16:20:50,031 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2020-12-02 16:20:50,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-02 16:20:50,287 WARN L197 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 78 [2020-12-02 16:20:50,818 WARN L197 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 55 [2020-12-02 16:20:51,225 WARN L197 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 62 [2020-12-02 16:20:51,330 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 36 [2020-12-02 16:20:51,633 WARN L197 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 55 [2020-12-02 16:20:51,790 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2020-12-02 16:20:52,040 WARN L197 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 62 [2020-12-02 16:20:52,340 WARN L197 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 56 [2020-12-02 16:20:52,697 WARN L197 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 61 [2020-12-02 16:20:52,879 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2020-12-02 16:20:53,020 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 82) no Hoare annotation was computed. [2020-12-02 16:20:53,020 INFO L262 CegarLoopResult]: For program point L69(line 69) no Hoare annotation was computed. [2020-12-02 16:20:53,020 INFO L262 CegarLoopResult]: For program point L36(lines 36 42) no Hoare annotation was computed. [2020-12-02 16:20:53,021 INFO L262 CegarLoopResult]: For program point L69-2(line 69) no Hoare annotation was computed. [2020-12-02 16:20:53,021 INFO L262 CegarLoopResult]: For program point L36-1(lines 36 42) no Hoare annotation was computed. [2020-12-02 16:20:53,021 INFO L262 CegarLoopResult]: For program point L69-3(lines 69 70) no Hoare annotation was computed. [2020-12-02 16:20:53,021 INFO L262 CegarLoopResult]: For program point L69-5(lines 69 85) no Hoare annotation was computed. [2020-12-02 16:20:53,021 INFO L262 CegarLoopResult]: For program point L69-7(lines 69 85) no Hoare annotation was computed. [2020-12-02 16:20:53,021 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-02 16:20:53,021 INFO L262 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-02 16:20:53,021 INFO L262 CegarLoopResult]: For program point L53(line 53) no Hoare annotation was computed. [2020-12-02 16:20:53,022 INFO L262 CegarLoopResult]: For program point L53-2(line 53) no Hoare annotation was computed. [2020-12-02 16:20:53,022 INFO L258 CegarLoopResult]: At program point L53-3(lines 45 54) the Hoare annotation is: (let ((.cse3 (let ((.cse5 (fp ((_ extract 31 31) ULTIMATE.start_main_~y~0) ((_ extract 30 23) ULTIMATE.start_main_~y~0) ((_ extract 22 0) ULTIMATE.start_main_~y~0)))) (fp.eq .cse5 .cse5)))) (or (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start_main_~x~0) ((_ extract 30 23) ULTIMATE.start_main_~x~0) ((_ extract 22 0) ULTIMATE.start_main_~x~0)))) (and (fp.eq (fp ((_ extract 31 31) ULTIMATE.start_fmax_float_~x) ((_ extract 30 23) ULTIMATE.start_fmax_float_~x) ((_ extract 22 0) ULTIMATE.start_fmax_float_~x)) .cse0) (not (let ((.cse1 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (fp.eq .cse1 .cse1))) (fp.eq (fp ((_ extract 31 31) |ULTIMATE.start_fmax_float_#res|) ((_ extract 30 23) |ULTIMATE.start_fmax_float_#res|) ((_ extract 22 0) |ULTIMATE.start_fmax_float_#res|)) .cse0) (not (let ((.cse2 (fp ((_ extract 31 31) ULTIMATE.start_fmax_float_~y) ((_ extract 30 23) ULTIMATE.start_fmax_float_~y) ((_ extract 22 0) ULTIMATE.start_fmax_float_~y)))) (fp.eq .cse2 .cse2))) (not .cse3) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not (let ((.cse4 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~x) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~x) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~x)))) (fp.eq .cse4 .cse4))))) (and (= |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~y~0) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse3 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y)))) [2020-12-02 16:20:53,022 INFO L262 CegarLoopResult]: For program point L70(line 70) no Hoare annotation was computed. [2020-12-02 16:20:53,022 INFO L262 CegarLoopResult]: For program point L70-2(line 70) no Hoare annotation was computed. [2020-12-02 16:20:53,023 INFO L265 CegarLoopResult]: At program point L87(lines 59 88) the Hoare annotation is: true [2020-12-02 16:20:53,023 INFO L262 CegarLoopResult]: For program point L46(lines 46 48) no Hoare annotation was computed. [2020-12-02 16:20:53,023 INFO L262 CegarLoopResult]: For program point L39(lines 39 42) no Hoare annotation was computed. [2020-12-02 16:20:53,023 INFO L262 CegarLoopResult]: For program point L39-1(lines 39 42) no Hoare annotation was computed. [2020-12-02 16:20:53,023 INFO L262 CegarLoopResult]: For program point L81(line 81) no Hoare annotation was computed. [2020-12-02 16:20:53,023 INFO L262 CegarLoopResult]: For program point L81-2(lines 81 84) no Hoare annotation was computed. [2020-12-02 16:20:53,024 INFO L262 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-02 16:20:53,024 INFO L258 CegarLoopResult]: At program point L57(line 57) the Hoare annotation is: (let ((.cse0 (let ((.cse1 (fp ((_ extract 31 31) ULTIMATE.start_main_~x~0) ((_ extract 30 23) ULTIMATE.start_main_~x~0) ((_ extract 22 0) ULTIMATE.start_main_~x~0)))) (fp.eq .cse1 .cse1)))) (or (and (not .cse0) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)) (and .cse0 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)))) [2020-12-02 16:20:53,024 INFO L258 CegarLoopResult]: At program point L57-1(line 57) the Hoare annotation is: (and (not (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start_main_~x~0) ((_ extract 30 23) ULTIMATE.start_main_~x~0) ((_ extract 22 0) ULTIMATE.start_main_~x~0)))) (fp.eq .cse0 .cse0))) |ULTIMATE.start_main_#t~short17| (let ((.cse1 (let ((.cse2 (fp ((_ extract 31 31) ULTIMATE.start_main_~y~0) ((_ extract 30 23) ULTIMATE.start_main_~y~0) ((_ extract 22 0) ULTIMATE.start_main_~y~0)))) (fp.eq .cse2 .cse2)))) (or (and (not .cse1) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)) (and (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse1)))) [2020-12-02 16:20:53,024 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 76) no Hoare annotation was computed. [2020-12-02 16:20:53,025 INFO L258 CegarLoopResult]: At program point L57-2(line 57) the Hoare annotation is: (let ((.cse2 (not |ULTIMATE.start_main_#t~short17|))) (let ((.cse1 (let ((.cse5 (fp ((_ extract 31 31) ULTIMATE.start_main_~x~0) ((_ extract 30 23) ULTIMATE.start_main_~x~0) ((_ extract 22 0) ULTIMATE.start_main_~x~0)))) (fp.eq .cse5 .cse5))) (.cse0 (let ((.cse3 (not |ULTIMATE.start_main_#t~short21|))) (or (and .cse3 .cse2) (and .cse3 (let ((.cse4 (fp ((_ extract 31 31) ULTIMATE.start_main_~y~0) ((_ extract 30 23) ULTIMATE.start_main_~y~0) ((_ extract 22 0) ULTIMATE.start_main_~y~0)))) (fp.eq .cse4 .cse4))))))) (or (and .cse0 .cse1 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse2) (and (not .cse1) .cse0 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|))))) [2020-12-02 16:20:53,025 INFO L258 CegarLoopResult]: At program point L57-3(line 57) the Hoare annotation is: (and (not |ULTIMATE.start_main_#t~short21|) (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start_main_~x~0) ((_ extract 30 23) ULTIMATE.start_main_~x~0) ((_ extract 22 0) ULTIMATE.start_main_~x~0)))) (fp.eq .cse0 .cse0)) (not |ULTIMATE.start_main_#t~short17|) (let ((.cse1 (let ((.cse2 (fp ((_ extract 31 31) ULTIMATE.start_main_~y~0) ((_ extract 30 23) ULTIMATE.start_main_~y~0) ((_ extract 22 0) ULTIMATE.start_main_~y~0)))) (fp.eq .cse2 .cse2)))) (or (and (not .cse1) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)) (and (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse1)))) [2020-12-02 16:20:53,025 INFO L258 CegarLoopResult]: At program point L57-4(line 57) the Hoare annotation is: (let ((.cse3 (let ((.cse5 (fp ((_ extract 31 31) ULTIMATE.start_main_~y~0) ((_ extract 30 23) ULTIMATE.start_main_~y~0) ((_ extract 22 0) ULTIMATE.start_main_~y~0)))) (fp.eq .cse5 .cse5)))) (or (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start_main_~x~0) ((_ extract 30 23) ULTIMATE.start_main_~x~0) ((_ extract 22 0) ULTIMATE.start_main_~x~0)))) (and (fp.eq (fp ((_ extract 31 31) ULTIMATE.start_fmax_float_~x) ((_ extract 30 23) ULTIMATE.start_fmax_float_~x) ((_ extract 22 0) ULTIMATE.start_fmax_float_~x)) .cse0) (not (let ((.cse1 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (fp.eq .cse1 .cse1))) (fp.eq (fp ((_ extract 31 31) ULTIMATE.start_main_~res~0) ((_ extract 30 23) ULTIMATE.start_main_~res~0) ((_ extract 22 0) ULTIMATE.start_main_~res~0)) .cse0) (fp.eq (fp ((_ extract 31 31) |ULTIMATE.start_fmax_float_#res|) ((_ extract 30 23) |ULTIMATE.start_fmax_float_#res|) ((_ extract 22 0) |ULTIMATE.start_fmax_float_#res|)) .cse0) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (not (let ((.cse2 (fp ((_ extract 31 31) ULTIMATE.start_fmax_float_~y) ((_ extract 30 23) ULTIMATE.start_fmax_float_~y) ((_ extract 22 0) ULTIMATE.start_fmax_float_~y)))) (fp.eq .cse2 .cse2))) (not .cse3) (not (let ((.cse4 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~x) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~x) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~x)))) (fp.eq .cse4 .cse4))))) (and (= |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~y~0) .cse3 (= ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y)))) [2020-12-02 16:20:53,025 INFO L258 CegarLoopResult]: At program point L57-5(line 57) the Hoare annotation is: (let ((.cse2 (let ((.cse5 (fp ((_ extract 31 31) ULTIMATE.start_main_~y~0) ((_ extract 30 23) ULTIMATE.start_main_~y~0) ((_ extract 22 0) ULTIMATE.start_main_~y~0)))) (fp.eq .cse5 .cse5)))) (or (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start_main_~x~0) ((_ extract 30 23) ULTIMATE.start_main_~x~0) ((_ extract 22 0) ULTIMATE.start_main_~x~0)))) (and (fp.eq (fp ((_ extract 31 31) ULTIMATE.start_fmax_float_~x) ((_ extract 30 23) ULTIMATE.start_fmax_float_~x) ((_ extract 22 0) ULTIMATE.start_fmax_float_~x)) .cse0) (not (let ((.cse1 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (fp.eq .cse1 .cse1))) (fp.eq (fp ((_ extract 31 31) ULTIMATE.start_main_~res~0) ((_ extract 30 23) ULTIMATE.start_main_~res~0) ((_ extract 22 0) ULTIMATE.start_main_~res~0)) .cse0) (fp.eq (fp ((_ extract 31 31) |ULTIMATE.start_fmax_float_#res|) ((_ extract 30 23) |ULTIMATE.start_fmax_float_#res|) ((_ extract 22 0) |ULTIMATE.start_fmax_float_#res|)) .cse0) (not .cse2) (not (let ((.cse3 (fp ((_ extract 31 31) ULTIMATE.start_fmax_float_~y) ((_ extract 30 23) ULTIMATE.start_fmax_float_~y) ((_ extract 22 0) ULTIMATE.start_fmax_float_~y)))) (fp.eq .cse3 .cse3))) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not (let ((.cse4 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~x) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~x) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~x)))) (fp.eq .cse4 .cse4))))) (and (= |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~y~0) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse2 (= ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y)))) [2020-12-02 16:20:53,025 INFO L258 CegarLoopResult]: At program point L57-6(line 57) the Hoare annotation is: (or (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start_main_~y~0) ((_ extract 30 23) ULTIMATE.start_main_~y~0) ((_ extract 22 0) ULTIMATE.start_main_~y~0)))) (fp.eq .cse0 .cse0)) (let ((.cse1 (fp ((_ extract 31 31) ULTIMATE.start_main_~x~0) ((_ extract 30 23) ULTIMATE.start_main_~x~0) ((_ extract 22 0) ULTIMATE.start_main_~x~0)))) (and (fp.eq (fp ((_ extract 31 31) ULTIMATE.start_fmax_float_~x) ((_ extract 30 23) ULTIMATE.start_fmax_float_~x) ((_ extract 22 0) ULTIMATE.start_fmax_float_~x)) .cse1) (not (let ((.cse2 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (fp.eq .cse2 .cse2))) (fp.eq (fp ((_ extract 31 31) ULTIMATE.start_main_~res~0) ((_ extract 30 23) ULTIMATE.start_main_~res~0) ((_ extract 22 0) ULTIMATE.start_main_~res~0)) .cse1) (fp.eq (fp ((_ extract 31 31) |ULTIMATE.start_fmax_float_#res|) ((_ extract 30 23) |ULTIMATE.start_fmax_float_#res|) ((_ extract 22 0) |ULTIMATE.start_fmax_float_#res|)) .cse1) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (not (let ((.cse3 (fp ((_ extract 31 31) ULTIMATE.start_fmax_float_~y) ((_ extract 30 23) ULTIMATE.start_fmax_float_~y) ((_ extract 22 0) ULTIMATE.start_fmax_float_~y)))) (fp.eq .cse3 .cse3))) (not (let ((.cse4 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~x) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~x) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~x)))) (fp.eq .cse4 .cse4)))))) [2020-12-02 16:20:53,026 INFO L258 CegarLoopResult]: At program point L57-7(line 57) the Hoare annotation is: (let ((.cse0 (let ((.cse6 (fp ((_ extract 31 31) ULTIMATE.start_main_~y~0) ((_ extract 30 23) ULTIMATE.start_main_~y~0) ((_ extract 22 0) ULTIMATE.start_main_~y~0)))) (fp.eq .cse6 .cse6)))) (let ((.cse1 (or (and (not .cse0) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)) (and (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse0)))) (or (and .cse0 .cse1) (let ((.cse2 (fp ((_ extract 31 31) ULTIMATE.start_main_~x~0) ((_ extract 30 23) ULTIMATE.start_main_~x~0) ((_ extract 22 0) ULTIMATE.start_main_~x~0)))) (and (fp.eq (fp ((_ extract 31 31) ULTIMATE.start_fmax_float_~x) ((_ extract 30 23) ULTIMATE.start_fmax_float_~x) ((_ extract 22 0) ULTIMATE.start_fmax_float_~x)) .cse2) (not (let ((.cse3 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (fp.eq .cse3 .cse3))) (fp.eq (fp ((_ extract 31 31) ULTIMATE.start_main_~res~0) ((_ extract 30 23) ULTIMATE.start_main_~res~0) ((_ extract 22 0) ULTIMATE.start_main_~res~0)) .cse2) (fp.eq (fp ((_ extract 31 31) |ULTIMATE.start_fmax_float_#res|) ((_ extract 30 23) |ULTIMATE.start_fmax_float_#res|) ((_ extract 22 0) |ULTIMATE.start_fmax_float_#res|)) .cse2) (not (let ((.cse4 (fp ((_ extract 31 31) ULTIMATE.start_fmax_float_~y) ((_ extract 30 23) ULTIMATE.start_fmax_float_~y) ((_ extract 22 0) ULTIMATE.start_fmax_float_~y)))) (fp.eq .cse4 .cse4))) (not (let ((.cse5 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~x) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~x) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~x)))) (fp.eq .cse5 .cse5))) .cse1))))) [2020-12-02 16:20:53,026 INFO L262 CegarLoopResult]: For program point L82(line 82) no Hoare annotation was computed. [2020-12-02 16:20:53,026 INFO L262 CegarLoopResult]: For program point L33(lines 33 42) no Hoare annotation was computed. [2020-12-02 16:20:53,026 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-02 16:20:53,026 INFO L262 CegarLoopResult]: For program point L33-1(lines 33 42) no Hoare annotation was computed. [2020-12-02 16:20:53,026 INFO L262 CegarLoopResult]: For program point L25-1(lines 25 29) no Hoare annotation was computed. [2020-12-02 16:20:53,026 INFO L258 CegarLoopResult]: At program point L25-2(lines 25 29) the Hoare annotation is: (let ((.cse1 (let ((.cse7 (fp ((_ extract 31 31) ULTIMATE.start_main_~y~0) ((_ extract 30 23) ULTIMATE.start_main_~y~0) ((_ extract 22 0) ULTIMATE.start_main_~y~0)))) (fp.eq .cse7 .cse7)))) (let ((.cse4 (not .cse1))) (let ((.cse2 (let ((.cse6 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~x) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~x) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~x)))) (fp.eq .cse6 .cse6))) (.cse3 (or (and .cse4 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)) (and (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse1)))) (or (and (not (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start_main_~x~0) ((_ extract 30 23) ULTIMATE.start_main_~x~0) ((_ extract 22 0) ULTIMATE.start_main_~x~0)))) (fp.eq .cse0 .cse0))) .cse1 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y) (not .cse2) .cse3) (and (= ULTIMATE.start___fpclassify_float_~x ULTIMATE.start_fmax_float_~x) .cse4 (not (let ((.cse5 (fp ((_ extract 31 31) ULTIMATE.start_fmax_float_~y) ((_ extract 30 23) ULTIMATE.start_fmax_float_~y) ((_ extract 22 0) ULTIMATE.start_fmax_float_~y)))) (fp.eq .cse5 .cse5))) (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmax_float_~x) .cse2 .cse3))))) [2020-12-02 16:20:53,026 INFO L262 CegarLoopResult]: For program point L25-3(lines 22 43) no Hoare annotation was computed. [2020-12-02 16:20:53,026 INFO L262 CegarLoopResult]: For program point L25-5(lines 25 29) no Hoare annotation was computed. [2020-12-02 16:20:53,027 INFO L258 CegarLoopResult]: At program point L25-6(lines 25 29) the Hoare annotation is: (and (fp.eq (fp ((_ extract 31 31) ULTIMATE.start_fmax_float_~x) ((_ extract 30 23) ULTIMATE.start_fmax_float_~x) ((_ extract 22 0) ULTIMATE.start_fmax_float_~x)) (fp ((_ extract 31 31) ULTIMATE.start_main_~x~0) ((_ extract 30 23) ULTIMATE.start_main_~x~0) ((_ extract 22 0) ULTIMATE.start_main_~x~0))) (not (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start_main_~y~0) ((_ extract 30 23) ULTIMATE.start_main_~y~0) ((_ extract 22 0) ULTIMATE.start_main_~y~0)))) (fp.eq .cse0 .cse0))) (not (let ((.cse1 (fp ((_ extract 31 31) ULTIMATE.start_fmax_float_~y) ((_ extract 30 23) ULTIMATE.start_fmax_float_~y) ((_ extract 22 0) ULTIMATE.start_fmax_float_~y)))) (fp.eq .cse1 .cse1))) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not (let ((.cse2 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~x) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~x) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~x)))) (fp.eq .cse2 .cse2)))) [2020-12-02 16:20:53,027 INFO L262 CegarLoopResult]: For program point L25-7(lines 22 43) no Hoare annotation was computed. [2020-12-02 16:20:53,027 INFO L262 CegarLoopResult]: For program point L50(lines 50 52) no Hoare annotation was computed. [2020-12-02 16:20:53,027 INFO L262 CegarLoopResult]: For program point L75(line 75) no Hoare annotation was computed. [2020-12-02 16:20:53,027 INFO L258 CegarLoopResult]: At program point L42(lines 22 43) the Hoare annotation is: (let ((.cse2 (let ((.cse9 (fp ((_ extract 31 31) ULTIMATE.start_main_~y~0) ((_ extract 30 23) ULTIMATE.start_main_~y~0) ((_ extract 22 0) ULTIMATE.start_main_~y~0)))) (fp.eq .cse9 .cse9)))) (let ((.cse7 (not .cse2))) (let ((.cse3 (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|)) (.cse4 (let ((.cse8 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~x) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~x) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~x)))) (fp.eq .cse8 .cse8))) (.cse5 (or (and .cse7 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)) (and (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse2)))) (or (and (not (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start_main_~x~0) ((_ extract 30 23) ULTIMATE.start_main_~x~0) ((_ extract 22 0) ULTIMATE.start_main_~x~0)))) (fp.eq .cse0 .cse0))) (not (let ((.cse1 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (fp.eq .cse1 .cse1))) .cse2 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y) .cse3 (not .cse4) .cse5) (and (= ULTIMATE.start___fpclassify_float_~x ULTIMATE.start_fmax_float_~x) (not .cse3) (not (let ((.cse6 (fp ((_ extract 31 31) ULTIMATE.start_fmax_float_~y) ((_ extract 30 23) ULTIMATE.start_fmax_float_~y) ((_ extract 22 0) ULTIMATE.start_fmax_float_~y)))) (fp.eq .cse6 .cse6))) .cse7 (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmax_float_~x) (= ULTIMATE.start___fpclassify_float_~w~0 ULTIMATE.start_fmax_float_~x) .cse4 .cse5))))) [2020-12-02 16:20:53,027 INFO L258 CegarLoopResult]: At program point L42-1(lines 22 43) the Hoare annotation is: (and (fp.eq (fp ((_ extract 31 31) ULTIMATE.start_fmax_float_~x) ((_ extract 30 23) ULTIMATE.start_fmax_float_~x) ((_ extract 22 0) ULTIMATE.start_fmax_float_~x)) (fp ((_ extract 31 31) ULTIMATE.start_main_~x~0) ((_ extract 30 23) ULTIMATE.start_main_~x~0) ((_ extract 22 0) ULTIMATE.start_main_~x~0))) (not (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (fp.eq .cse0 .cse0))) (not (let ((.cse1 (fp ((_ extract 31 31) ULTIMATE.start_fmax_float_~y) ((_ extract 30 23) ULTIMATE.start_fmax_float_~y) ((_ extract 22 0) ULTIMATE.start_fmax_float_~y)))) (fp.eq .cse1 .cse1))) (not (let ((.cse2 (fp ((_ extract 31 31) ULTIMATE.start_main_~y~0) ((_ extract 30 23) ULTIMATE.start_main_~y~0) ((_ extract 22 0) ULTIMATE.start_main_~y~0)))) (fp.eq .cse2 .cse2))) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not (let ((.cse3 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~x) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~x) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~x)))) (fp.eq .cse3 .cse3))) (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|)) [2020-12-02 16:20:53,027 INFO L262 CegarLoopResult]: For program point L75-2(lines 75 78) no Hoare annotation was computed. [2020-12-02 16:20:53,028 INFO L262 CegarLoopResult]: For program point L76(line 76) no Hoare annotation was computed. [2020-12-02 16:20:53,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 04:20:53 BoogieIcfgContainer [2020-12-02 16:20:53,075 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-02 16:20:53,075 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-02 16:20:53,075 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-02 16:20:53,076 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-02 16:20:53,076 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:20:36" (3/4) ... [2020-12-02 16:20:53,080 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-02 16:20:53,094 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2020-12-02 16:20:53,095 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-12-02 16:20:53,095 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-12-02 16:20:53,096 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-02 16:20:53,124 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && 1bv32 == \result) || (~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && 0bv32 == \result) [2020-12-02 16:20:53,124 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && aux-isnan_float(x) && !isnan_float(y)-aux) && ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])))) [2020-12-02 16:20:53,125 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && !aux-isnan_float(x) && !isnan_float(y)-aux) || (!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && 0bv32 == \result) && !aux-isnan_float(x) && !isnan_float(y)-aux) || ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && ((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && !aux-isnan_float(x) && !isnan_float(y)-aux) || (!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))))) && 1bv32 == \result) [2020-12-02 16:20:53,132 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && ~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && !aux-isnan_float(x) && !isnan_float(y)-aux) && ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])))) [2020-12-02 16:20:53,133 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && y == y) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))))) || (((((x == x && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && x == x) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))))) [2020-12-02 16:20:53,133 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && y == y) && 0bv32 == \result) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))))) || (((((((x == x && !(0bv32 == \result)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && x == x) && w == x) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))))) [2020-12-02 16:20:53,134 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(\result[31:31], \result[30:23], \result[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && 1bv32 == \result) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) || (((\result == y && 0bv32 == \result) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && y == y) [2020-12-02 16:20:53,134 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && 1bv32 == \result) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) [2020-12-02 16:20:53,134 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(res[31:31], res[30:23], res[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(\result[31:31], \result[30:23], \result[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && 0bv32 == \result) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) || (((\result == y && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && res == y) && y == y) [2020-12-02 16:20:53,135 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && 1bv32 == \result) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && 0bv32 == \result [2020-12-02 16:20:53,135 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(res[31:31], res[30:23], res[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(\result[31:31], \result[30:23], \result[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && 1bv32 == \result) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) || ((((\result == y && 0bv32 == \result) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && res == y) && y == y) [2020-12-02 16:20:53,136 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) || ((((((~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(res[31:31], res[30:23], res[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(\result[31:31], \result[30:23], \result[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && 0bv32 == \result) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) [2020-12-02 16:20:53,136 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))))) || ((((((~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(res[31:31], res[30:23], res[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(\result[31:31], \result[30:23], \result[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))))) [2020-12-02 16:20:53,182 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-12-02 16:20:53,183 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-02 16:20:53,184 INFO L168 Benchmark]: Toolchain (without parser) took 18114.74 ms. Allocated memory was 44.0 MB in the beginning and 119.5 MB in the end (delta: 75.5 MB). Free memory was 21.5 MB in the beginning and 97.7 MB in the end (delta: -76.2 MB). Peak memory consumption was 69.0 MB. Max. memory is 16.1 GB. [2020-12-02 16:20:53,187 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 44.0 MB. Free memory was 29.3 MB in the beginning and 29.3 MB in the end (delta: 69.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 16:20:53,188 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.04 ms. Allocated memory is still 44.0 MB. Free memory was 21.4 MB in the beginning and 21.1 MB in the end (delta: 292.9 kB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. [2020-12-02 16:20:53,188 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.79 ms. Allocated memory is still 44.0 MB. Free memory was 21.1 MB in the beginning and 19.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-02 16:20:53,189 INFO L168 Benchmark]: Boogie Preprocessor took 70.04 ms. Allocated memory is still 44.0 MB. Free memory was 19.0 MB in the beginning and 28.5 MB in the end (delta: -9.6 MB). Peak memory consumption was 3.3 MB. Max. memory is 16.1 GB. [2020-12-02 16:20:53,189 INFO L168 Benchmark]: RCFGBuilder took 537.02 ms. Allocated memory was 44.0 MB in the beginning and 54.5 MB in the end (delta: 10.5 MB). Free memory was 28.5 MB in the beginning and 24.7 MB in the end (delta: 3.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 16.1 GB. [2020-12-02 16:20:53,190 INFO L168 Benchmark]: TraceAbstraction took 17010.05 ms. Allocated memory was 54.5 MB in the beginning and 119.5 MB in the end (delta: 65.0 MB). Free memory was 24.2 MB in the beginning and 34.0 MB in the end (delta: -9.8 MB). Peak memory consumption was 59.0 MB. Max. memory is 16.1 GB. [2020-12-02 16:20:53,190 INFO L168 Benchmark]: Witness Printer took 107.48 ms. Allocated memory is still 119.5 MB. Free memory was 34.0 MB in the beginning and 97.7 MB in the end (delta: -63.6 MB). Peak memory consumption was 4.5 MB. Max. memory is 16.1 GB. [2020-12-02 16:20:53,194 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.18 ms. Allocated memory is still 44.0 MB. Free memory was 29.3 MB in the beginning and 29.3 MB in the end (delta: 69.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 326.04 ms. Allocated memory is still 44.0 MB. Free memory was 21.4 MB in the beginning and 21.1 MB in the end (delta: 292.9 kB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 55.79 ms. Allocated memory is still 44.0 MB. Free memory was 21.1 MB in the beginning and 19.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 70.04 ms. Allocated memory is still 44.0 MB. Free memory was 19.0 MB in the beginning and 28.5 MB in the end (delta: -9.6 MB). Peak memory consumption was 3.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 537.02 ms. Allocated memory was 44.0 MB in the beginning and 54.5 MB in the end (delta: 10.5 MB). Free memory was 28.5 MB in the beginning and 24.7 MB in the end (delta: 3.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 17010.05 ms. Allocated memory was 54.5 MB in the beginning and 119.5 MB in the end (delta: 65.0 MB). Free memory was 24.2 MB in the beginning and 34.0 MB in the end (delta: -9.8 MB). Peak memory consumption was 59.0 MB. Max. memory is 16.1 GB. * Witness Printer took 107.48 ms. Allocated memory is still 119.5 MB. Free memory was 34.0 MB in the beginning and 97.7 MB in the end (delta: -63.6 MB). Peak memory consumption was 4.5 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 82]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 76]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: ((((((~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(\result[31:31], \result[30:23], \result[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && 1bv32 == \result) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) || (((\result == y && 0bv32 == \result) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && y == y) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))))) || ((((((~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(res[31:31], res[30:23], res[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(\result[31:31], \result[30:23], \result[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))))) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) || ((((((~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(res[31:31], res[30:23], res[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(\result[31:31], \result[30:23], \result[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && 0bv32 == \result) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: (((~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && 1bv32 == \result) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((((~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && 1bv32 == \result) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && 0bv32 == \result - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((((((~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(res[31:31], res[30:23], res[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(\result[31:31], \result[30:23], \result[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && 1bv32 == \result) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) || ((((\result == y && 0bv32 == \result) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && res == y) && y == y) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: ((((((!~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && y == y) && 0bv32 == \result) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))))) || (((((((x == x && !(0bv32 == \result)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && x == x) && w == x) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))))) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((((((~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(res[31:31], res[30:23], res[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(\result[31:31], \result[30:23], \result[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && 0bv32 == \result) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) || (((\result == y && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && res == y) && y == y) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && ~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && !aux-isnan_float(x) && !isnan_float(y)-aux) && ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])))) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && !aux-isnan_float(x) && !isnan_float(y)-aux) || (!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && 0bv32 == \result) && !aux-isnan_float(x) && !isnan_float(y)-aux) || ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && ((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && !aux-isnan_float(x) && !isnan_float(y)-aux) || (!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))))) && 1bv32 == \result) - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: ((((!~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && y == y) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))))) || (((((x == x && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && x == x) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))))) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (!~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && aux-isnan_float(x) && !isnan_float(y)-aux) && ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])))) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (!~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && 1bv32 == \result) || (~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && 0bv32 == \result) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 47 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 13.8s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 966 SDtfs, 1850 SDslu, 3222 SDs, 0 SdLazy, 1523 SolverSat, 180 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 905 GetRequests, 718 SyntacticMatches, 4 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 481 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 38 NumberOfFragments, 1509 HoareAnnotationTreeSize, 14 FomulaSimplifications, 175387 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 14 FomulaSimplificationsInter, 11907 FormulaSimplificationTreeSizeReductionInter, 2.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 428 NumberOfCodeBlocks, 428 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 822 ConstructedInterpolants, 0 QuantifiedInterpolants, 117842 SizeOfPredicates, 94 NumberOfNonLiveVariables, 1449 ConjunctsInSsa, 126 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 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...