./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1231.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_1231.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 8039b1e35b9e459b273890fa707790cd9b2d1812 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_1231.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 8039b1e35b9e459b273890fa707790cd9b2d1812 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-5485861 [2020-10-25 22:01:05,715 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-25 22:01:05,717 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-25 22:01:05,764 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-25 22:01:05,765 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-25 22:01:05,771 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-25 22:01:05,774 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-25 22:01:05,781 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-25 22:01:05,785 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-25 22:01:05,791 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-25 22:01:05,793 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-25 22:01:05,797 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-25 22:01:05,798 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-25 22:01:05,802 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-25 22:01:05,804 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-25 22:01:05,806 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-25 22:01:05,807 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-25 22:01:05,811 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-25 22:01:05,814 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-25 22:01:05,823 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-25 22:01:05,825 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-25 22:01:05,827 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-25 22:01:05,830 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-25 22:01:05,831 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-25 22:01:05,839 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-25 22:01:05,840 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-25 22:01:05,840 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-25 22:01:05,843 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-25 22:01:05,843 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-25 22:01:05,845 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-25 22:01:05,845 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-25 22:01:05,846 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-25 22:01:05,848 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-25 22:01:05,849 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-25 22:01:05,853 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-25 22:01:05,853 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-25 22:01:05,854 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-25 22:01:05,855 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-25 22:01:05,855 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-25 22:01:05,857 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-25 22:01:05,867 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-25 22:01:05,869 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-25 22:01:05,924 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-25 22:01:05,925 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-25 22:01:05,928 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-25 22:01:05,928 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-25 22:01:05,928 INFO L138 SettingsManager]: * Use SBE=true [2020-10-25 22:01:05,929 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-25 22:01:05,929 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-25 22:01:05,929 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-25 22:01:05,930 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-25 22:01:05,930 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-25 22:01:05,931 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-25 22:01:05,932 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-25 22:01:05,932 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-25 22:01:05,932 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-25 22:01:05,932 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-25 22:01:05,933 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-25 22:01:05,933 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-25 22:01:05,933 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-25 22:01:05,933 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-25 22:01:05,934 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-25 22:01:05,934 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-25 22:01:05,935 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 22:01:05,935 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-25 22:01:05,935 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-25 22:01:05,935 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-25 22:01:05,936 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-25 22:01:05,936 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-25 22:01:05,936 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-25 22:01:05,936 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-25 22:01:05,937 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 -> 8039b1e35b9e459b273890fa707790cd9b2d1812 [2020-10-25 22:01:06,340 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-25 22:01:06,388 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-25 22:01:06,394 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-25 22:01:06,396 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-25 22:01:06,397 INFO L275 PluginConnector]: CDTParser initialized [2020-10-25 22:01:06,398 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2020-10-25 22:01:06,477 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea1283bc8/72fb0f3b76c14ee3aa0df3f5ff09527b/FLAG89752b2c5 [2020-10-25 22:01:07,018 INFO L306 CDTParser]: Found 1 translation units. [2020-10-25 22:01:07,019 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2020-10-25 22:01:07,027 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea1283bc8/72fb0f3b76c14ee3aa0df3f5ff09527b/FLAG89752b2c5 [2020-10-25 22:01:07,423 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea1283bc8/72fb0f3b76c14ee3aa0df3f5ff09527b [2020-10-25 22:01:07,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-25 22:01:07,434 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-25 22:01:07,439 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-25 22:01:07,440 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-25 22:01:07,444 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-25 22:01:07,446 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 10:01:07" (1/1) ... [2020-10-25 22:01:07,452 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12896dd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:07, skipping insertion in model container [2020-10-25 22:01:07,453 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 10:01:07" (1/1) ... [2020-10-25 22:01:07,461 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-25 22:01:07,490 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-25 22:01:07,668 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 22:01:07,678 INFO L203 MainTranslator]: Completed pre-run [2020-10-25 22:01:07,708 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 22:01:07,727 INFO L208 MainTranslator]: Completed translation [2020-10-25 22:01:07,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:07 WrapperNode [2020-10-25 22:01:07,728 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-25 22:01:07,729 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-25 22:01:07,729 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-25 22:01:07,730 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-25 22:01:07,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:07" (1/1) ... [2020-10-25 22:01:07,749 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:07" (1/1) ... [2020-10-25 22:01:07,779 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-25 22:01:07,780 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-25 22:01:07,780 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-25 22:01:07,780 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-25 22:01:07,803 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:07" (1/1) ... [2020-10-25 22:01:07,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:07" (1/1) ... [2020-10-25 22:01:07,818 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:07" (1/1) ... [2020-10-25 22:01:07,818 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:07" (1/1) ... [2020-10-25 22:01:07,840 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:07" (1/1) ... [2020-10-25 22:01:07,853 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:07" (1/1) ... [2020-10-25 22:01:07,858 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:07" (1/1) ... [2020-10-25 22:01:07,868 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-25 22:01:07,869 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-25 22:01:07,869 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-25 22:01:07,869 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-25 22:01:07,870 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 22:01:07,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-25 22:01:07,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-25 22:01:07,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-10-25 22:01:07,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-25 22:01:07,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-25 22:01:07,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-25 22:01:07,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-25 22:01:08,502 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-25 22:01:08,502 INFO L298 CfgBuilder]: Removed 34 assume(true) statements. [2020-10-25 22:01:08,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 10:01:08 BoogieIcfgContainer [2020-10-25 22:01:08,505 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-25 22:01:08,511 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-25 22:01:08,512 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-25 22:01:08,518 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-25 22:01:08,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 10:01:07" (1/3) ... [2020-10-25 22:01:08,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@147c94c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 10:01:08, skipping insertion in model container [2020-10-25 22:01:08,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:07" (2/3) ... [2020-10-25 22:01:08,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@147c94c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 10:01:08, skipping insertion in model container [2020-10-25 22:01:08,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 10:01:08" (3/3) ... [2020-10-25 22:01:08,522 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1231.c [2020-10-25 22:01:08,532 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-25 22:01:08,537 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-25 22:01:08,549 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-10-25 22:01:08,576 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-25 22:01:08,576 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-25 22:01:08,577 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-25 22:01:08,577 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-25 22:01:08,577 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-25 22:01:08,577 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-25 22:01:08,577 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-25 22:01:08,577 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-25 22:01:08,594 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2020-10-25 22:01:08,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-25 22:01:08,600 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:01:08,601 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:01:08,602 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:01:08,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:01:08,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1204154757, now seen corresponding path program 1 times [2020-10-25 22:01:08,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:01:08,618 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730532875] [2020-10-25 22:01:08,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:01:08,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:01:08,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:08,806 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730532875] [2020-10-25 22:01:08,807 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:01:08,807 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 22:01:08,808 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766756727] [2020-10-25 22:01:08,813 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 22:01:08,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:01:08,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 22:01:08,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 22:01:08,830 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 4 states. [2020-10-25 22:01:08,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:01:08,918 INFO L93 Difference]: Finished difference Result 92 states and 136 transitions. [2020-10-25 22:01:08,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 22:01:08,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-25 22:01:08,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:01:08,931 INFO L225 Difference]: With dead ends: 92 [2020-10-25 22:01:08,932 INFO L226 Difference]: Without dead ends: 50 [2020-10-25 22:01:08,935 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 22:01:08,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-10-25 22:01:08,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2020-10-25 22:01:08,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-10-25 22:01:08,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2020-10-25 22:01:08,977 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 16 [2020-10-25 22:01:08,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:01:08,978 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2020-10-25 22:01:08,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 22:01:08,978 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2020-10-25 22:01:08,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-25 22:01:08,979 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:01:08,980 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:01:08,980 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-25 22:01:08,980 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:01:08,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:01:08,982 INFO L82 PathProgramCache]: Analyzing trace with hash 44236684, now seen corresponding path program 1 times [2020-10-25 22:01:08,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:01:08,982 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643443306] [2020-10-25 22:01:08,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:01:09,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:01:09,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:09,119 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643443306] [2020-10-25 22:01:09,120 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:01:09,120 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 22:01:09,120 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886362951] [2020-10-25 22:01:09,121 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 22:01:09,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:01:09,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 22:01:09,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 22:01:09,127 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 4 states. [2020-10-25 22:01:09,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:01:09,190 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2020-10-25 22:01:09,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 22:01:09,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-10-25 22:01:09,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:01:09,193 INFO L225 Difference]: With dead ends: 77 [2020-10-25 22:01:09,193 INFO L226 Difference]: Without dead ends: 64 [2020-10-25 22:01:09,194 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 22:01:09,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-10-25 22:01:09,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 47. [2020-10-25 22:01:09,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-25 22:01:09,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2020-10-25 22:01:09,205 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2020-10-25 22:01:09,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:01:09,205 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2020-10-25 22:01:09,205 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 22:01:09,206 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2020-10-25 22:01:09,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-25 22:01:09,207 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:01:09,207 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:01:09,207 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-25 22:01:09,207 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:01:09,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:01:09,208 INFO L82 PathProgramCache]: Analyzing trace with hash -674173253, now seen corresponding path program 1 times [2020-10-25 22:01:09,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:01:09,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097533975] [2020-10-25 22:01:09,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:01:09,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:01:09,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:09,297 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097533975] [2020-10-25 22:01:09,297 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:01:09,297 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 22:01:09,297 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40969967] [2020-10-25 22:01:09,298 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 22:01:09,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:01:09,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 22:01:09,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 22:01:09,300 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 4 states. [2020-10-25 22:01:09,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:01:09,372 INFO L93 Difference]: Finished difference Result 79 states and 99 transitions. [2020-10-25 22:01:09,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 22:01:09,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-10-25 22:01:09,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:01:09,375 INFO L225 Difference]: With dead ends: 79 [2020-10-25 22:01:09,376 INFO L226 Difference]: Without dead ends: 66 [2020-10-25 22:01:09,377 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 22:01:09,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-10-25 22:01:09,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 47. [2020-10-25 22:01:09,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-25 22:01:09,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2020-10-25 22:01:09,388 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 19 [2020-10-25 22:01:09,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:01:09,389 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2020-10-25 22:01:09,389 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 22:01:09,390 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2020-10-25 22:01:09,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-25 22:01:09,391 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:01:09,391 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-10-25 22:01:09,391 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-25 22:01:09,392 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:01:09,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:01:09,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1345927737, now seen corresponding path program 1 times [2020-10-25 22:01:09,393 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:01:09,394 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275655459] [2020-10-25 22:01:09,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:01:09,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:01:09,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:09,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275655459] [2020-10-25 22:01:09,486 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:01:09,486 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 22:01:09,486 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529555379] [2020-10-25 22:01:09,487 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 22:01:09,487 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:01:09,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 22:01:09,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 22:01:09,489 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 4 states. [2020-10-25 22:01:09,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:01:09,544 INFO L93 Difference]: Finished difference Result 81 states and 101 transitions. [2020-10-25 22:01:09,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 22:01:09,545 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-10-25 22:01:09,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:01:09,546 INFO L225 Difference]: With dead ends: 81 [2020-10-25 22:01:09,547 INFO L226 Difference]: Without dead ends: 68 [2020-10-25 22:01:09,548 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 22:01:09,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-10-25 22:01:09,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 47. [2020-10-25 22:01:09,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-25 22:01:09,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2020-10-25 22:01:09,557 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 20 [2020-10-25 22:01:09,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:01:09,558 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2020-10-25 22:01:09,558 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 22:01:09,558 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2020-10-25 22:01:09,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-25 22:01:09,559 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:01:09,559 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-10-25 22:01:09,560 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-25 22:01:09,560 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:01:09,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:01:09,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1380709804, now seen corresponding path program 1 times [2020-10-25 22:01:09,561 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:01:09,562 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626885702] [2020-10-25 22:01:09,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:01:09,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:01:09,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:09,629 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626885702] [2020-10-25 22:01:09,629 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:01:09,629 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 22:01:09,629 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133654693] [2020-10-25 22:01:09,630 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 22:01:09,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:01:09,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 22:01:09,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 22:01:09,631 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 3 states. [2020-10-25 22:01:09,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:01:09,654 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2020-10-25 22:01:09,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 22:01:09,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-10-25 22:01:09,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:01:09,656 INFO L225 Difference]: With dead ends: 50 [2020-10-25 22:01:09,656 INFO L226 Difference]: Without dead ends: 48 [2020-10-25 22:01:09,657 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-10-25 22:01:09,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-10-25 22:01:09,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-10-25 22:01:09,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-10-25 22:01:09,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2020-10-25 22:01:09,665 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 21 [2020-10-25 22:01:09,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:01:09,665 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2020-10-25 22:01:09,665 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 22:01:09,665 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2020-10-25 22:01:09,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-25 22:01:09,666 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:01:09,667 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:01:09,667 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-25 22:01:09,667 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:01:09,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:01:09,668 INFO L82 PathProgramCache]: Analyzing trace with hash 147544209, now seen corresponding path program 1 times [2020-10-25 22:01:09,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:01:09,668 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53950732] [2020-10-25 22:01:09,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:01:09,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 22:01:09,714 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 22:01:09,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 22:01:09,757 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 22:01:09,810 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-25 22:01:09,811 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-25 22:01:09,811 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-25 22:01:09,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 10:01:09 BoogieIcfgContainer [2020-10-25 22:01:09,871 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-25 22:01:09,872 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-25 22:01:09,872 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-25 22:01:09,872 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-25 22:01:09,873 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 10:01:08" (3/4) ... [2020-10-25 22:01:09,877 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-25 22:01:09,877 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-25 22:01:09,880 INFO L168 Benchmark]: Toolchain (without parser) took 2450.40 ms. Allocated memory was 41.9 MB in the beginning and 60.8 MB in the end (delta: 18.9 MB). Free memory was 20.0 MB in the beginning and 29.8 MB in the end (delta: -9.8 MB). Peak memory consumption was 11.6 MB. Max. memory is 16.1 GB. [2020-10-25 22:01:09,881 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 41.9 MB. Free memory was 22.5 MB in the beginning and 22.5 MB in the end (delta: 32.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 22:01:09,882 INFO L168 Benchmark]: CACSL2BoogieTranslator took 289.16 ms. Allocated memory is still 41.9 MB. Free memory was 19.4 MB in the beginning and 20.2 MB in the end (delta: -826.7 kB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. [2020-10-25 22:01:09,883 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.95 ms. Allocated memory is still 41.9 MB. Free memory was 20.1 MB in the beginning and 18.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-10-25 22:01:09,884 INFO L168 Benchmark]: Boogie Preprocessor took 88.11 ms. Allocated memory was 41.9 MB in the beginning and 50.3 MB in the end (delta: 8.4 MB). Free memory was 18.1 MB in the beginning and 34.2 MB in the end (delta: -16.1 MB). Peak memory consumption was 3.3 MB. Max. memory is 16.1 GB. [2020-10-25 22:01:09,885 INFO L168 Benchmark]: RCFGBuilder took 635.84 ms. Allocated memory is still 50.3 MB. Free memory was 34.0 MB in the beginning and 22.1 MB in the end (delta: 11.9 MB). Peak memory consumption was 13.6 MB. Max. memory is 16.1 GB. [2020-10-25 22:01:09,886 INFO L168 Benchmark]: TraceAbstraction took 1360.06 ms. Allocated memory was 50.3 MB in the beginning and 60.8 MB in the end (delta: 10.5 MB). Free memory was 33.8 MB in the beginning and 30.3 MB in the end (delta: 3.5 MB). Peak memory consumption was 13.9 MB. Max. memory is 16.1 GB. [2020-10-25 22:01:09,887 INFO L168 Benchmark]: Witness Printer took 5.52 ms. Allocated memory is still 60.8 MB. Free memory was 30.3 MB in the beginning and 29.8 MB in the end (delta: 484.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 22:01:09,893 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 41.9 MB. Free memory was 22.5 MB in the beginning and 22.5 MB in the end (delta: 32.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 289.16 ms. Allocated memory is still 41.9 MB. Free memory was 19.4 MB in the beginning and 20.2 MB in the end (delta: -826.7 kB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 49.95 ms. Allocated memory is still 41.9 MB. Free memory was 20.1 MB in the beginning and 18.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 88.11 ms. Allocated memory was 41.9 MB in the beginning and 50.3 MB in the end (delta: 8.4 MB). Free memory was 18.1 MB in the beginning and 34.2 MB in the end (delta: -16.1 MB). Peak memory consumption was 3.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 635.84 ms. Allocated memory is still 50.3 MB. Free memory was 34.0 MB in the beginning and 22.1 MB in the end (delta: 11.9 MB). Peak memory consumption was 13.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 1360.06 ms. Allocated memory was 50.3 MB in the beginning and 60.8 MB in the end (delta: 10.5 MB). Free memory was 33.8 MB in the beginning and 30.3 MB in the end (delta: 3.5 MB). Peak memory consumption was 13.9 MB. Max. memory is 16.1 GB. * Witness Printer took 5.52 ms. Allocated memory is still 60.8 MB. Free memory was 30.3 MB in the beginning and 29.8 MB in the end (delta: 484.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 3]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 76. Possible FailurePath: [L68] float x = __VERIFIER_nondet_float(); [L69] float y = __VERIFIER_nondet_float(); [L59] return x != x; [L70] EXPR isnan_float(x) && !isnan_float(y) [L59] return x != x; [L70] EXPR isnan_float(x) && !isnan_float(y) [L70-L71] (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L70-L71] COND TRUE (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L15] __uint32_t w; [L18] ieee_float_shape_type gf_u; [L19] gf_u.value = (x) [L20] EXPR gf_u.word [L20] (w) = gf_u.word [L23] COND FALSE !(w == 0x00000000 || w == 0x80000000) [L25-L26] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) [L28-L29] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) [L31] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L34] return 0; [L38] COND TRUE __fpclassify_float(x) == 0 [L39] return y; [L73] float res = fmin_float(x, y); [L59] return x != x; [L76] EXPR isnan_float(x) && !isnan_float(y) [L59] return x != x; [L76] EXPR isnan_float(x) && !isnan_float(y) [L76] COND TRUE isnan_float(x) && !isnan_float(y) && res != y [L3] __assert_fail("0", "float_req_bl_1231.c", 3, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 49 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.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 62 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s 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-5485861 [2020-10-25 22:01:12,528 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-25 22:01:12,533 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-25 22:01:12,592 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-25 22:01:12,593 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-25 22:01:12,599 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-25 22:01:12,602 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-25 22:01:12,608 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-25 22:01:12,610 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-25 22:01:12,612 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-25 22:01:12,613 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-25 22:01:12,615 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-25 22:01:12,615 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-25 22:01:12,617 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-25 22:01:12,618 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-25 22:01:12,620 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-25 22:01:12,621 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-25 22:01:12,622 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-25 22:01:12,639 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-25 22:01:12,645 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-25 22:01:12,648 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-25 22:01:12,651 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-25 22:01:12,653 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-25 22:01:12,658 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-25 22:01:12,666 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-25 22:01:12,667 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-25 22:01:12,669 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-25 22:01:12,670 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-25 22:01:12,672 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-25 22:01:12,673 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-25 22:01:12,674 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-25 22:01:12,675 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-25 22:01:12,676 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-25 22:01:12,678 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-25 22:01:12,680 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-25 22:01:12,681 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-25 22:01:12,681 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-25 22:01:12,682 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-25 22:01:12,682 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-25 22:01:12,685 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-25 22:01:12,686 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-25 22:01:12,687 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-10-25 22:01:12,713 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-25 22:01:12,714 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-25 22:01:12,715 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-25 22:01:12,715 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-25 22:01:12,716 INFO L138 SettingsManager]: * Use SBE=true [2020-10-25 22:01:12,716 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-25 22:01:12,716 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-25 22:01:12,716 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-25 22:01:12,716 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-25 22:01:12,717 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-25 22:01:12,717 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-25 22:01:12,717 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-25 22:01:12,717 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-10-25 22:01:12,717 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-10-25 22:01:12,717 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-25 22:01:12,718 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-25 22:01:12,718 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-25 22:01:12,718 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-25 22:01:12,718 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-25 22:01:12,718 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-25 22:01:12,719 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-25 22:01:12,719 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-25 22:01:12,719 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 22:01:12,719 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-25 22:01:12,719 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-25 22:01:12,720 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-25 22:01:12,720 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-10-25 22:01:12,720 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-10-25 22:01:12,720 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-25 22:01:12,720 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-25 22:01:12,720 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-25 22:01:12,721 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 -> 8039b1e35b9e459b273890fa707790cd9b2d1812 [2020-10-25 22:01:13,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-25 22:01:13,202 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-25 22:01:13,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-25 22:01:13,209 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-25 22:01:13,210 INFO L275 PluginConnector]: CDTParser initialized [2020-10-25 22:01:13,211 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2020-10-25 22:01:13,299 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b89fd940/d8922540c0714744b55634b84584ee42/FLAG570b75ee7 [2020-10-25 22:01:13,877 INFO L306 CDTParser]: Found 1 translation units. [2020-10-25 22:01:13,878 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2020-10-25 22:01:13,893 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b89fd940/d8922540c0714744b55634b84584ee42/FLAG570b75ee7 [2020-10-25 22:01:14,241 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b89fd940/d8922540c0714744b55634b84584ee42 [2020-10-25 22:01:14,244 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-25 22:01:14,252 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-25 22:01:14,254 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-25 22:01:14,254 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-25 22:01:14,260 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-25 22:01:14,261 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 10:01:14" (1/1) ... [2020-10-25 22:01:14,266 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7811dbf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:14, skipping insertion in model container [2020-10-25 22:01:14,266 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 10:01:14" (1/1) ... [2020-10-25 22:01:14,274 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-25 22:01:14,297 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-25 22:01:14,546 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 22:01:14,563 INFO L203 MainTranslator]: Completed pre-run [2020-10-25 22:01:14,594 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 22:01:14,615 INFO L208 MainTranslator]: Completed translation [2020-10-25 22:01:14,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:14 WrapperNode [2020-10-25 22:01:14,616 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-25 22:01:14,618 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-25 22:01:14,618 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-25 22:01:14,618 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-25 22:01:14,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:14" (1/1) ... [2020-10-25 22:01:14,639 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:14" (1/1) ... [2020-10-25 22:01:14,670 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-25 22:01:14,671 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-25 22:01:14,671 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-25 22:01:14,671 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-25 22:01:14,680 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:14" (1/1) ... [2020-10-25 22:01:14,681 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:14" (1/1) ... [2020-10-25 22:01:14,686 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:14" (1/1) ... [2020-10-25 22:01:14,686 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:14" (1/1) ... [2020-10-25 22:01:14,698 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:14" (1/1) ... [2020-10-25 22:01:14,703 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:14" (1/1) ... [2020-10-25 22:01:14,706 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:14" (1/1) ... [2020-10-25 22:01:14,711 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-25 22:01:14,712 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-25 22:01:14,712 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-25 22:01:14,712 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-25 22:01:14,713 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 22:01:14,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-10-25 22:01:14,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-25 22:01:14,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-10-25 22:01:14,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-25 22:01:14,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-25 22:01:14,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2020-10-25 22:01:14,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-25 22:01:15,564 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-25 22:01:15,565 INFO L298 CfgBuilder]: Removed 34 assume(true) statements. [2020-10-25 22:01:15,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 10:01:15 BoogieIcfgContainer [2020-10-25 22:01:15,567 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-25 22:01:15,573 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-25 22:01:15,573 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-25 22:01:15,576 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-25 22:01:15,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 10:01:14" (1/3) ... [2020-10-25 22:01:15,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64854256 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 10:01:15, skipping insertion in model container [2020-10-25 22:01:15,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:14" (2/3) ... [2020-10-25 22:01:15,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64854256 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 10:01:15, skipping insertion in model container [2020-10-25 22:01:15,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 10:01:15" (3/3) ... [2020-10-25 22:01:15,581 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1231.c [2020-10-25 22:01:15,598 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-25 22:01:15,603 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-25 22:01:15,618 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-10-25 22:01:15,662 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-25 22:01:15,663 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-25 22:01:15,663 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-25 22:01:15,663 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-25 22:01:15,663 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-25 22:01:15,663 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-25 22:01:15,663 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-25 22:01:15,663 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-25 22:01:15,683 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2020-10-25 22:01:15,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-25 22:01:15,692 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:01:15,693 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:01:15,693 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:01:15,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:01:15,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1204154757, now seen corresponding path program 1 times [2020-10-25 22:01:15,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 22:01:15,715 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1634981397] [2020-10-25 22:01:15,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-10-25 22:01:15,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:01:15,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 1 conjunts are in the unsatisfiable core [2020-10-25 22:01:15,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:01:15,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:15,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 22:01:15,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:15,850 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1634981397] [2020-10-25 22:01:15,851 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:01:15,851 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-10-25 22:01:15,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334736656] [2020-10-25 22:01:15,857 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-25 22:01:15,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 22:01:15,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-25 22:01:15,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-25 22:01:15,875 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2020-10-25 22:01:15,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:01:15,898 INFO L93 Difference]: Finished difference Result 84 states and 124 transitions. [2020-10-25 22:01:15,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-25 22:01:15,899 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2020-10-25 22:01:15,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:01:15,910 INFO L225 Difference]: With dead ends: 84 [2020-10-25 22:01:15,910 INFO L226 Difference]: Without dead ends: 43 [2020-10-25 22:01:15,913 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-10-25 22:01:15,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-10-25 22:01:15,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-10-25 22:01:15,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-10-25 22:01:15,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2020-10-25 22:01:15,953 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 16 [2020-10-25 22:01:15,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:01:15,954 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2020-10-25 22:01:15,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-25 22:01:15,954 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2020-10-25 22:01:15,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-25 22:01:15,955 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:01:15,955 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:01:16,177 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-25 22:01:16,179 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:01:16,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:01:16,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1262247077, now seen corresponding path program 1 times [2020-10-25 22:01:16,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 22:01:16,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [62939181] [2020-10-25 22:01:16,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-10-25 22:01:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:01:16,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-25 22:01:16,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:01:16,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:16,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 22:01:16,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:16,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [62939181] [2020-10-25 22:01:16,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:01:16,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-10-25 22:01:16,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456192861] [2020-10-25 22:01:16,332 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 22:01:16,333 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 22:01:16,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 22:01:16,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 22:01:16,334 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand 4 states. [2020-10-25 22:01:16,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:01:16,401 INFO L93 Difference]: Finished difference Result 82 states and 111 transitions. [2020-10-25 22:01:16,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 22:01:16,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-10-25 22:01:16,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:01:16,404 INFO L225 Difference]: With dead ends: 82 [2020-10-25 22:01:16,404 INFO L226 Difference]: Without dead ends: 50 [2020-10-25 22:01:16,405 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-10-25 22:01:16,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-10-25 22:01:16,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2020-10-25 22:01:16,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-10-25 22:01:16,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2020-10-25 22:01:16,414 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 17 [2020-10-25 22:01:16,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:01:16,414 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2020-10-25 22:01:16,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 22:01:16,415 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2020-10-25 22:01:16,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-25 22:01:16,416 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:01:16,416 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:01:16,636 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-25 22:01:16,637 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:01:16,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:01:16,638 INFO L82 PathProgramCache]: Analyzing trace with hash 44236684, now seen corresponding path program 1 times [2020-10-25 22:01:16,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 22:01:16,639 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1055812] [2020-10-25 22:01:16,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-10-25 22:01:16,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:01:16,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-25 22:01:16,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:01:16,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:16,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 22:01:16,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:16,776 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1055812] [2020-10-25 22:01:16,776 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:01:16,776 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-10-25 22:01:16,776 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698375490] [2020-10-25 22:01:16,777 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-25 22:01:16,777 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 22:01:16,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-25 22:01:16,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-25 22:01:16,778 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 6 states. [2020-10-25 22:01:16,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:01:16,889 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2020-10-25 22:01:16,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-25 22:01:16,889 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-25 22:01:16,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:01:16,891 INFO L225 Difference]: With dead ends: 96 [2020-10-25 22:01:16,891 INFO L226 Difference]: Without dead ends: 83 [2020-10-25 22:01:16,892 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-10-25 22:01:16,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-10-25 22:01:16,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 47. [2020-10-25 22:01:16,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-25 22:01:16,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2020-10-25 22:01:16,900 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2020-10-25 22:01:16,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:01:16,901 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2020-10-25 22:01:16,901 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-25 22:01:16,901 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2020-10-25 22:01:16,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-25 22:01:16,902 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:01:16,902 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-10-25 22:01:17,118 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-10-25 22:01:17,119 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:01:17,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:01:17,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1380709804, now seen corresponding path program 1 times [2020-10-25 22:01:17,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 22:01:17,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [133042500] [2020-10-25 22:01:17,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-10-25 22:01:17,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:01:17,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-25 22:01:17,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:01:17,247 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-25 22:01:17,247 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:01:17,288 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:01:17,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:17,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 22:01:17,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:17,400 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [133042500] [2020-10-25 22:01:17,400 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:01:17,400 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2020-10-25 22:01:17,400 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792237023] [2020-10-25 22:01:17,401 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-25 22:01:17,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 22:01:17,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-25 22:01:17,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-10-25 22:01:17,402 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 10 states. [2020-10-25 22:01:17,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:01:17,986 INFO L93 Difference]: Finished difference Result 149 states and 197 transitions. [2020-10-25 22:01:17,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-25 22:01:17,987 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2020-10-25 22:01:17,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:01:17,989 INFO L225 Difference]: With dead ends: 149 [2020-10-25 22:01:17,992 INFO L226 Difference]: Without dead ends: 140 [2020-10-25 22:01:17,993 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2020-10-25 22:01:17,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-10-25 22:01:18,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 75. [2020-10-25 22:01:18,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-10-25 22:01:18,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2020-10-25 22:01:18,008 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 21 [2020-10-25 22:01:18,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:01:18,008 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2020-10-25 22:01:18,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-25 22:01:18,009 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2020-10-25 22:01:18,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-25 22:01:18,010 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:01:18,010 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:01:18,226 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-10-25 22:01:18,227 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:01:18,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:01:18,228 INFO L82 PathProgramCache]: Analyzing trace with hash 147544209, now seen corresponding path program 1 times [2020-10-25 22:01:18,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 22:01:18,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [388856036] [2020-10-25 22:01:18,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-10-25 22:01:18,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:01:18,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-25 22:01:18,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:01:18,355 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-25 22:01:18,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:01:18,381 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:01:18,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:18,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 22:01:18,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:18,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [388856036] [2020-10-25 22:01:18,729 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:01:18,729 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 15 [2020-10-25 22:01:18,730 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653815697] [2020-10-25 22:01:18,730 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-25 22:01:18,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 22:01:18,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-25 22:01:18,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2020-10-25 22:01:18,732 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 15 states. [2020-10-25 22:01:20,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:01:20,973 INFO L93 Difference]: Finished difference Result 180 states and 237 transitions. [2020-10-25 22:01:20,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-25 22:01:20,974 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2020-10-25 22:01:20,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:01:20,977 INFO L225 Difference]: With dead ends: 180 [2020-10-25 22:01:20,977 INFO L226 Difference]: Without dead ends: 178 [2020-10-25 22:01:20,978 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=185, Invalid=465, Unknown=0, NotChecked=0, Total=650 [2020-10-25 22:01:20,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2020-10-25 22:01:20,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 89. [2020-10-25 22:01:20,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-10-25 22:01:20,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2020-10-25 22:01:20,994 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 22 [2020-10-25 22:01:20,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:01:20,994 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2020-10-25 22:01:20,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-25 22:01:20,995 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2020-10-25 22:01:20,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-25 22:01:20,996 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:01:20,996 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] [2020-10-25 22:01:21,213 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-10-25 22:01:21,214 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:01:21,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:01:21,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1845695531, now seen corresponding path program 1 times [2020-10-25 22:01:21,216 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 22:01:21,216 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [867543547] [2020-10-25 22:01:21,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-10-25 22:01:21,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:01:21,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-25 22:01:21,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:01:21,313 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-25 22:01:21,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:01:21,346 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:01:21,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:21,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 22:01:21,390 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-10-25 22:01:21,390 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-25 22:01:21,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:21,434 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [867543547] [2020-10-25 22:01:21,434 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:01:21,434 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2020-10-25 22:01:21,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046115252] [2020-10-25 22:01:21,436 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-25 22:01:21,436 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 22:01:21,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-25 22:01:21,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-25 22:01:21,437 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand 9 states. [2020-10-25 22:01:24,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:01:24,179 INFO L93 Difference]: Finished difference Result 166 states and 219 transitions. [2020-10-25 22:01:24,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-25 22:01:24,179 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-10-25 22:01:24,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:01:24,181 INFO L225 Difference]: With dead ends: 166 [2020-10-25 22:01:24,181 INFO L226 Difference]: Without dead ends: 131 [2020-10-25 22:01:24,182 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2020-10-25 22:01:24,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-10-25 22:01:24,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 89. [2020-10-25 22:01:24,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-10-25 22:01:24,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 120 transitions. [2020-10-25 22:01:24,219 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 120 transitions. Word has length 23 [2020-10-25 22:01:24,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:01:24,219 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 120 transitions. [2020-10-25 22:01:24,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-25 22:01:24,220 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 120 transitions. [2020-10-25 22:01:24,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-25 22:01:24,221 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:01:24,221 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-10-25 22:01:24,421 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-10-25 22:01:24,422 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:01:24,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:01:24,422 INFO L82 PathProgramCache]: Analyzing trace with hash 156888005, now seen corresponding path program 1 times [2020-10-25 22:01:24,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 22:01:24,423 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1943046458] [2020-10-25 22:01:24,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-10-25 22:01:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:01:24,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-25 22:01:24,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:01:24,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:24,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 22:01:24,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:24,569 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1943046458] [2020-10-25 22:01:24,569 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:01:24,569 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-10-25 22:01:24,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952420944] [2020-10-25 22:01:24,570 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-25 22:01:24,570 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 22:01:24,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-25 22:01:24,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-25 22:01:24,571 INFO L87 Difference]: Start difference. First operand 89 states and 120 transitions. Second operand 6 states. [2020-10-25 22:01:24,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:01:24,702 INFO L93 Difference]: Finished difference Result 157 states and 199 transitions. [2020-10-25 22:01:24,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-25 22:01:24,703 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-10-25 22:01:24,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:01:24,706 INFO L225 Difference]: With dead ends: 157 [2020-10-25 22:01:24,707 INFO L226 Difference]: Without dead ends: 141 [2020-10-25 22:01:24,709 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-10-25 22:01:24,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-10-25 22:01:24,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 93. [2020-10-25 22:01:24,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-10-25 22:01:24,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2020-10-25 22:01:24,744 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 24 [2020-10-25 22:01:24,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:01:24,746 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2020-10-25 22:01:24,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-25 22:01:24,746 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2020-10-25 22:01:24,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-25 22:01:24,750 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:01:24,750 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-10-25 22:01:24,963 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-10-25 22:01:24,964 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:01:24,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:01:24,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1621213116, now seen corresponding path program 1 times [2020-10-25 22:01:24,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 22:01:24,966 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [768162816] [2020-10-25 22:01:24,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2020-10-25 22:01:25,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:01:25,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-25 22:01:25,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:01:25,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:25,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 22:01:25,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:25,070 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [768162816] [2020-10-25 22:01:25,070 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:01:25,070 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-25 22:01:25,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245839857] [2020-10-25 22:01:25,071 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 22:01:25,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 22:01:25,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 22:01:25,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 22:01:25,078 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand 3 states. [2020-10-25 22:01:25,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:01:25,117 INFO L93 Difference]: Finished difference Result 96 states and 127 transitions. [2020-10-25 22:01:25,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 22:01:25,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-10-25 22:01:25,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:01:25,119 INFO L225 Difference]: With dead ends: 96 [2020-10-25 22:01:25,119 INFO L226 Difference]: Without dead ends: 94 [2020-10-25 22:01:25,122 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-10-25 22:01:25,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-10-25 22:01:25,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2020-10-25 22:01:25,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-10-25 22:01:25,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2020-10-25 22:01:25,143 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 24 [2020-10-25 22:01:25,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:01:25,145 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2020-10-25 22:01:25,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 22:01:25,146 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2020-10-25 22:01:25,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-25 22:01:25,148 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:01:25,152 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-10-25 22:01:25,366 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-10-25 22:01:25,366 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:01:25,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:01:25,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1743883267, now seen corresponding path program 1 times [2020-10-25 22:01:25,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 22:01:25,368 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [828535098] [2020-10-25 22:01:25,368 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-10-25 22:01:25,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:01:25,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-25 22:01:25,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:01:25,499 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-25 22:01:25,500 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:01:25,536 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:01:25,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:25,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 22:01:25,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:25,629 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [828535098] [2020-10-25 22:01:25,629 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:01:25,629 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2020-10-25 22:01:25,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959486421] [2020-10-25 22:01:25,630 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-25 22:01:25,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 22:01:25,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-25 22:01:25,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-10-25 22:01:25,632 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand 10 states. [2020-10-25 22:01:26,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:01:26,035 INFO L93 Difference]: Finished difference Result 131 states and 173 transitions. [2020-10-25 22:01:26,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-25 22:01:26,036 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-10-25 22:01:26,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:01:26,037 INFO L225 Difference]: With dead ends: 131 [2020-10-25 22:01:26,037 INFO L226 Difference]: Without dead ends: 118 [2020-10-25 22:01:26,038 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2020-10-25 22:01:26,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-10-25 22:01:26,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 89. [2020-10-25 22:01:26,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-10-25 22:01:26,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 118 transitions. [2020-10-25 22:01:26,048 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 118 transitions. Word has length 25 [2020-10-25 22:01:26,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:01:26,048 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 118 transitions. [2020-10-25 22:01:26,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-25 22:01:26,048 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 118 transitions. [2020-10-25 22:01:26,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-25 22:01:26,049 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:01:26,049 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-10-25 22:01:26,259 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-10-25 22:01:26,261 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:01:26,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:01:26,262 INFO L82 PathProgramCache]: Analyzing trace with hash 839729769, now seen corresponding path program 1 times [2020-10-25 22:01:26,263 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 22:01:26,263 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [826434448] [2020-10-25 22:01:26,263 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-10-25 22:01:26,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:01:26,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-25 22:01:26,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:01:26,370 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-25 22:01:26,370 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:01:26,406 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:01:26,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:26,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 22:01:26,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:26,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [826434448] [2020-10-25 22:01:26,522 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:01:26,522 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 11 [2020-10-25 22:01:26,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341369620] [2020-10-25 22:01:26,523 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-25 22:01:26,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 22:01:26,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-25 22:01:26,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-10-25 22:01:26,524 INFO L87 Difference]: Start difference. First operand 89 states and 118 transitions. Second operand 11 states. [2020-10-25 22:01:27,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:01:27,019 INFO L93 Difference]: Finished difference Result 114 states and 147 transitions. [2020-10-25 22:01:27,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-25 22:01:27,020 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-25 22:01:27,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:01:27,021 INFO L225 Difference]: With dead ends: 114 [2020-10-25 22:01:27,021 INFO L226 Difference]: Without dead ends: 78 [2020-10-25 22:01:27,022 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2020-10-25 22:01:27,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-10-25 22:01:27,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2020-10-25 22:01:27,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-10-25 22:01:27,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2020-10-25 22:01:27,030 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 25 [2020-10-25 22:01:27,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:01:27,030 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 98 transitions. [2020-10-25 22:01:27,031 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-25 22:01:27,031 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2020-10-25 22:01:27,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-25 22:01:27,032 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:01:27,032 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-10-25 22:01:27,236 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2020-10-25 22:01:27,236 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:01:27,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:01:27,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1281876129, now seen corresponding path program 1 times [2020-10-25 22:01:27,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 22:01:27,238 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406363680] [2020-10-25 22:01:27,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 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-10-25 22:01:27,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:01:27,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-25 22:01:27,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:01:27,373 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-25 22:01:27,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:01:27,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:01:27,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:27,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 22:01:27,451 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-10-25 22:01:27,453 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-25 22:01:27,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:27,495 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1406363680] [2020-10-25 22:01:27,495 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:01:27,495 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2020-10-25 22:01:27,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536998795] [2020-10-25 22:01:27,496 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-25 22:01:27,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 22:01:27,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-25 22:01:27,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-25 22:01:27,498 INFO L87 Difference]: Start difference. First operand 76 states and 98 transitions. Second operand 9 states. [2020-10-25 22:01:27,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:01:27,855 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2020-10-25 22:01:27,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-25 22:01:27,856 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-25 22:01:27,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:01:27,857 INFO L225 Difference]: With dead ends: 84 [2020-10-25 22:01:27,857 INFO L226 Difference]: Without dead ends: 74 [2020-10-25 22:01:27,860 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2020-10-25 22:01:27,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-10-25 22:01:27,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-10-25 22:01:27,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-10-25 22:01:27,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2020-10-25 22:01:27,867 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 25 [2020-10-25 22:01:27,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:01:27,868 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2020-10-25 22:01:27,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-25 22:01:27,868 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2020-10-25 22:01:27,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-25 22:01:27,872 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:01:27,872 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-10-25 22:01:28,085 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2020-10-25 22:01:28,086 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:01:28,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:01:28,087 INFO L82 PathProgramCache]: Analyzing trace with hash -144403189, now seen corresponding path program 1 times [2020-10-25 22:01:28,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 22:01:28,088 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1019689135] [2020-10-25 22:01:28,089 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-10-25 22:01:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:01:28,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-25 22:01:28,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:01:28,219 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-25 22:01:28,219 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:01:28,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:28,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 22:01:28,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:28,646 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1019689135] [2020-10-25 22:01:28,646 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:01:28,646 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2020-10-25 22:01:28,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132819417] [2020-10-25 22:01:28,646 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-25 22:01:28,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 22:01:28,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-25 22:01:28,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-10-25 22:01:28,647 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand 10 states. [2020-10-25 22:01:29,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:01:29,014 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2020-10-25 22:01:29,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-25 22:01:29,015 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-10-25 22:01:29,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:01:29,015 INFO L225 Difference]: With dead ends: 82 [2020-10-25 22:01:29,016 INFO L226 Difference]: Without dead ends: 74 [2020-10-25 22:01:29,016 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2020-10-25 22:01:29,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-10-25 22:01:29,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-10-25 22:01:29,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-10-25 22:01:29,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2020-10-25 22:01:29,022 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 26 [2020-10-25 22:01:29,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:01:29,023 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2020-10-25 22:01:29,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-25 22:01:29,023 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2020-10-25 22:01:29,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-25 22:01:29,023 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:01:29,024 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-10-25 22:01:29,224 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2020-10-25 22:01:29,225 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:01:29,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:01:29,226 INFO L82 PathProgramCache]: Analyzing trace with hash -953749815, now seen corresponding path program 1 times [2020-10-25 22:01:29,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 22:01:29,227 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1252959485] [2020-10-25 22:01:29,228 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-10-25 22:01:29,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:01:29,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-25 22:01:29,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:01:29,470 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2020-10-25 22:01:29,572 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-10-25 22:01:29,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:01:29,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:29,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 22:01:29,854 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 1] term [2020-10-25 22:01:29,854 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-25 22:01:29,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:29,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1252959485] [2020-10-25 22:01:29,973 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:01:29,973 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 16 [2020-10-25 22:01:29,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505695968] [2020-10-25 22:01:29,973 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-25 22:01:29,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 22:01:29,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-25 22:01:29,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2020-10-25 22:01:29,975 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand 16 states. [2020-10-25 22:01:30,872 WARN L193 SmtUtils]: Spent 510.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2020-10-25 22:01:31,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:01:31,866 INFO L93 Difference]: Finished difference Result 154 states and 169 transitions. [2020-10-25 22:01:31,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-25 22:01:31,866 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2020-10-25 22:01:31,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:01:31,868 INFO L225 Difference]: With dead ends: 154 [2020-10-25 22:01:31,868 INFO L226 Difference]: Without dead ends: 134 [2020-10-25 22:01:31,869 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=186, Invalid=464, Unknown=0, NotChecked=0, Total=650 [2020-10-25 22:01:31,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-10-25 22:01:31,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 72. [2020-10-25 22:01:31,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-10-25 22:01:31,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2020-10-25 22:01:31,885 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 26 [2020-10-25 22:01:31,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:01:31,885 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2020-10-25 22:01:31,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-25 22:01:31,885 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2020-10-25 22:01:31,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-25 22:01:31,886 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:01:31,886 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] [2020-10-25 22:01:32,101 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2020-10-25 22:01:32,102 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:01:32,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:01:32,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1548503636, now seen corresponding path program 1 times [2020-10-25 22:01:32,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 22:01:32,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [110872923] [2020-10-25 22:01:32,104 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-10-25 22:01:32,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:01:32,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 22 conjunts are in the unsatisfiable core [2020-10-25 22:01:32,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:01:32,208 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-25 22:01:32,209 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:01:32,229 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:01:32,580 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 29 [2020-10-25 22:01:32,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:32,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 22:01:32,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:32,845 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [110872923] [2020-10-25 22:01:32,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:01:32,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 15 [2020-10-25 22:01:32,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773752173] [2020-10-25 22:01:32,846 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-25 22:01:32,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 22:01:32,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-25 22:01:32,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2020-10-25 22:01:32,847 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. Second operand 15 states. [2020-10-25 22:01:34,232 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2020-10-25 22:01:34,471 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2020-10-25 22:01:35,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:01:35,381 INFO L93 Difference]: Finished difference Result 195 states and 205 transitions. [2020-10-25 22:01:35,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-10-25 22:01:35,381 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-10-25 22:01:35,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:01:35,382 INFO L225 Difference]: With dead ends: 195 [2020-10-25 22:01:35,383 INFO L226 Difference]: Without dead ends: 158 [2020-10-25 22:01:35,384 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=455, Invalid=1437, Unknown=0, NotChecked=0, Total=1892 [2020-10-25 22:01:35,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-10-25 22:01:35,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 43. [2020-10-25 22:01:35,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-10-25 22:01:35,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2020-10-25 22:01:35,390 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 27 [2020-10-25 22:01:35,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:01:35,391 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2020-10-25 22:01:35,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-25 22:01:35,391 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2020-10-25 22:01:35,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-25 22:01:35,392 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:01:35,392 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-10-25 22:01:35,606 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2020-10-25 22:01:35,607 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:01:35,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:01:35,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1423958792, now seen corresponding path program 1 times [2020-10-25 22:01:35,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 22:01:35,609 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1836290449] [2020-10-25 22:01:35,610 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-10-25 22:01:35,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:01:35,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 21 conjunts are in the unsatisfiable core [2020-10-25 22:01:35,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:01:35,721 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-25 22:01:35,722 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:01:35,990 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 29 [2020-10-25 22:01:36,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:36,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 22:01:36,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:36,179 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1836290449] [2020-10-25 22:01:36,179 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:01:36,179 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 12 [2020-10-25 22:01:36,180 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068959391] [2020-10-25 22:01:36,180 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-25 22:01:36,180 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 22:01:36,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-25 22:01:36,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-10-25 22:01:36,181 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand 12 states. [2020-10-25 22:01:37,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:01:37,385 INFO L93 Difference]: Finished difference Result 125 states and 140 transitions. [2020-10-25 22:01:37,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-25 22:01:37,386 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2020-10-25 22:01:37,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:01:37,387 INFO L225 Difference]: With dead ends: 125 [2020-10-25 22:01:37,387 INFO L226 Difference]: Without dead ends: 101 [2020-10-25 22:01:37,389 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=209, Invalid=603, Unknown=0, NotChecked=0, Total=812 [2020-10-25 22:01:37,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-10-25 22:01:37,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 41. [2020-10-25 22:01:37,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-10-25 22:01:37,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2020-10-25 22:01:37,395 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 28 [2020-10-25 22:01:37,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:01:37,395 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2020-10-25 22:01:37,395 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-25 22:01:37,395 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2020-10-25 22:01:37,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-10-25 22:01:37,396 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:01:37,396 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-10-25 22:01:37,596 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2020-10-25 22:01:37,597 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:01:37,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:01:37,599 INFO L82 PathProgramCache]: Analyzing trace with hash 489956430, now seen corresponding path program 1 times [2020-10-25 22:01:37,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 22:01:37,600 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1808836237] [2020-10-25 22:01:37,600 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-10-25 22:01:37,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:01:37,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-25 22:01:37,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:01:37,732 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-25 22:01:37,736 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:01:37,757 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:01:37,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:37,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 22:01:38,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:38,063 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1808836237] [2020-10-25 22:01:38,063 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:01:38,063 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2020-10-25 22:01:38,064 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979468246] [2020-10-25 22:01:38,064 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-25 22:01:38,064 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 22:01:38,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-25 22:01:38,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-25 22:01:38,065 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 10 states. [2020-10-25 22:01:40,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:01:40,870 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2020-10-25 22:01:40,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-25 22:01:40,871 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2020-10-25 22:01:40,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:01:40,872 INFO L225 Difference]: With dead ends: 52 [2020-10-25 22:01:40,872 INFO L226 Difference]: Without dead ends: 41 [2020-10-25 22:01:40,872 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2020-10-25 22:01:40,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-10-25 22:01:40,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-10-25 22:01:40,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-10-25 22:01:40,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2020-10-25 22:01:40,879 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 32 [2020-10-25 22:01:40,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:01:40,879 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2020-10-25 22:01:40,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-25 22:01:40,880 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2020-10-25 22:01:40,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-10-25 22:01:40,880 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:01:40,880 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-10-25 22:01:41,091 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2020-10-25 22:01:41,092 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:01:41,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:01:41,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1191021008, now seen corresponding path program 1 times [2020-10-25 22:01:41,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 22:01:41,094 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1488988692] [2020-10-25 22:01:41,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 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-10-25 22:01:41,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:01:41,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 15 conjunts are in the unsatisfiable core [2020-10-25 22:01:41,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:01:41,206 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-25 22:01:41,206 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:01:41,229 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:01:41,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:41,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 22:01:41,323 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 1] term [2020-10-25 22:01:41,323 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-25 22:01:41,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:41,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1488988692] [2020-10-25 22:01:41,489 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:01:41,489 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2020-10-25 22:01:41,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297793637] [2020-10-25 22:01:41,489 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-25 22:01:41,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 22:01:41,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-25 22:01:41,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-10-25 22:01:41,491 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand 14 states. [2020-10-25 22:01:42,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:01:42,289 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2020-10-25 22:01:42,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-25 22:01:42,289 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2020-10-25 22:01:42,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:01:42,290 INFO L225 Difference]: With dead ends: 55 [2020-10-25 22:01:42,290 INFO L226 Difference]: Without dead ends: 41 [2020-10-25 22:01:42,291 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2020-10-25 22:01:42,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-10-25 22:01:42,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2020-10-25 22:01:42,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-10-25 22:01:42,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2020-10-25 22:01:42,297 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 32 [2020-10-25 22:01:42,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:01:42,297 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2020-10-25 22:01:42,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-25 22:01:42,298 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2020-10-25 22:01:42,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-10-25 22:01:42,298 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:01:42,298 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-10-25 22:01:42,509 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2020-10-25 22:01:42,510 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:01:42,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:01:42,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1654102483, now seen corresponding path program 1 times [2020-10-25 22:01:42,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 22:01:42,513 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1648881944] [2020-10-25 22:01:42,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2020-10-25 22:01:42,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:01:42,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-25 22:01:42,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:01:42,676 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-10-25 22:01:42,676 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:01:42,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:42,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 22:01:42,857 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 1] term [2020-10-25 22:01:42,858 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-25 22:01:42,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:42,900 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1648881944] [2020-10-25 22:01:42,901 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:01:42,901 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2020-10-25 22:01:42,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602117640] [2020-10-25 22:01:42,902 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-25 22:01:42,903 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 22:01:42,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-25 22:01:42,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-10-25 22:01:42,903 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 12 states. [2020-10-25 22:01:43,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:01:43,510 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2020-10-25 22:01:43,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-25 22:01:43,511 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2020-10-25 22:01:43,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:01:43,511 INFO L225 Difference]: With dead ends: 79 [2020-10-25 22:01:43,511 INFO L226 Difference]: Without dead ends: 61 [2020-10-25 22:01:43,512 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2020-10-25 22:01:43,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-10-25 22:01:43,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 39. [2020-10-25 22:01:43,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-10-25 22:01:43,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2020-10-25 22:01:43,517 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 33 [2020-10-25 22:01:43,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:01:43,517 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2020-10-25 22:01:43,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-25 22:01:43,517 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2020-10-25 22:01:43,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-10-25 22:01:43,517 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:01:43,517 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-10-25 22:01:43,718 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2020-10-25 22:01:43,719 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:01:43,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:01:43,719 INFO L82 PathProgramCache]: Analyzing trace with hash 798574185, now seen corresponding path program 1 times [2020-10-25 22:01:43,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 22:01:43,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1749645964] [2020-10-25 22:01:43,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2020-10-25 22:01:43,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:01:43,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-25 22:01:43,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:01:43,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-10-25 22:01:43,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 22:01:43,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:43,848 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1749645964] [2020-10-25 22:01:43,848 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:01:43,848 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-10-25 22:01:43,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311768139] [2020-10-25 22:01:43,849 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 22:01:43,849 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 22:01:43,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 22:01:43,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 22:01:43,850 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 4 states. [2020-10-25 22:01:43,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:01:43,912 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2020-10-25 22:01:43,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 22:01:43,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-10-25 22:01:43,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:01:43,912 INFO L225 Difference]: With dead ends: 39 [2020-10-25 22:01:43,912 INFO L226 Difference]: Without dead ends: 0 [2020-10-25 22:01:43,913 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-10-25 22:01:43,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-25 22:01:43,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-25 22:01:43,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-25 22:01:43,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-25 22:01:43,914 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2020-10-25 22:01:43,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:01:43,914 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-25 22:01:43,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 22:01:43,915 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-25 22:01:43,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-25 22:01:44,115 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2020-10-25 22:01:44,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-25 22:01:44,458 WARN L193 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 122 [2020-10-25 22:01:44,594 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 136 [2020-10-25 22:01:44,719 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 121 [2020-10-25 22:01:44,988 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 120 [2020-10-25 22:01:45,260 WARN L193 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 23 [2020-10-25 22:01:46,057 WARN L193 SmtUtils]: Spent 749.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 39 [2020-10-25 22:01:46,740 WARN L193 SmtUtils]: Spent 681.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 27 [2020-10-25 22:01:47,282 WARN L193 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 33 [2020-10-25 22:01:47,567 WARN L193 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 25 [2020-10-25 22:01:47,825 WARN L193 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 32 [2020-10-25 22:01:48,281 WARN L193 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 34 [2020-10-25 22:01:48,880 WARN L193 SmtUtils]: Spent 597.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 43 [2020-10-25 22:01:49,460 WARN L193 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 37 [2020-10-25 22:01:49,518 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-10-25 22:01:49,518 INFO L274 CegarLoopResult]: For program point L3(line 3) no Hoare annotation was computed. [2020-10-25 22:01:49,518 INFO L274 CegarLoopResult]: For program point L3-1(line 3) no Hoare annotation was computed. [2020-10-25 22:01:49,518 INFO L274 CegarLoopResult]: For program point L3-2(line 3) no Hoare annotation was computed. [2020-10-25 22:01:49,518 INFO L274 CegarLoopResult]: For program point L3-3(line 3) no Hoare annotation was computed. [2020-10-25 22:01:49,518 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-10-25 22:01:49,518 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-10-25 22:01:49,518 INFO L274 CegarLoopResult]: For program point L28(lines 28 34) no Hoare annotation was computed. [2020-10-25 22:01:49,518 INFO L274 CegarLoopResult]: For program point L28-1(lines 28 34) no Hoare annotation was computed. [2020-10-25 22:01:49,518 INFO L274 CegarLoopResult]: For program point L70(line 70) no Hoare annotation was computed. [2020-10-25 22:01:49,518 INFO L274 CegarLoopResult]: For program point L70-2(line 70) no Hoare annotation was computed. [2020-10-25 22:01:49,519 INFO L274 CegarLoopResult]: For program point L70-3(lines 70 71) no Hoare annotation was computed. [2020-10-25 22:01:49,519 INFO L274 CegarLoopResult]: For program point L70-5(lines 70 86) no Hoare annotation was computed. [2020-10-25 22:01:49,519 INFO L274 CegarLoopResult]: For program point L70-7(lines 70 86) no Hoare annotation was computed. [2020-10-25 22:01:49,519 INFO L274 CegarLoopResult]: For program point L71(line 71) no Hoare annotation was computed. [2020-10-25 22:01:49,519 INFO L274 CegarLoopResult]: For program point L38(lines 38 39) no Hoare annotation was computed. [2020-10-25 22:01:49,519 INFO L274 CegarLoopResult]: For program point L71-2(line 71) no Hoare annotation was computed. [2020-10-25 22:01:49,519 INFO L277 CegarLoopResult]: At program point L88(lines 61 89) the Hoare annotation is: true [2020-10-25 22:01:49,520 INFO L274 CegarLoopResult]: For program point L31(lines 31 34) no Hoare annotation was computed. [2020-10-25 22:01:49,520 INFO L274 CegarLoopResult]: For program point L31-1(lines 31 34) no Hoare annotation was computed. [2020-10-25 22:01:49,520 INFO L274 CegarLoopResult]: For program point L40(lines 40 41) no Hoare annotation was computed. [2020-10-25 22:01:49,520 INFO L274 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-10-25 22:01:49,520 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-10-25 22:01:49,520 INFO L274 CegarLoopResult]: For program point L82(line 82) no Hoare annotation was computed. [2020-10-25 22:01:49,520 INFO L274 CegarLoopResult]: For program point L82-2(lines 82 85) no Hoare annotation was computed. [2020-10-25 22:01:49,521 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-10-25 22:01:49,521 INFO L274 CegarLoopResult]: For program point L25(lines 25 34) no Hoare annotation was computed. [2020-10-25 22:01:49,521 INFO L274 CegarLoopResult]: For program point L25-1(lines 25 34) no Hoare annotation was computed. [2020-10-25 22:01:49,521 INFO L274 CegarLoopResult]: For program point L17-1(lines 17 21) no Hoare annotation was computed. [2020-10-25 22:01:49,521 INFO L270 CegarLoopResult]: At program point L17-2(lines 17 21) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start_main_~y~0)) (.cse1 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and .cse0 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (not .cse1)) (and .cse0 (= ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) .cse1 (not (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y)) (= ULTIMATE.start_fmin_float_~x ULTIMATE.start___fpclassify_float_~x)))) [2020-10-25 22:01:49,521 INFO L274 CegarLoopResult]: For program point L17-3(lines 14 35) no Hoare annotation was computed. [2020-10-25 22:01:49,521 INFO L274 CegarLoopResult]: For program point L17-5(lines 17 21) no Hoare annotation was computed. [2020-10-25 22:01:49,521 INFO L270 CegarLoopResult]: At program point L17-6(lines 17 21) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start_main_~y~0))) (or (and (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) .cse0 (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y))) (and (= ULTIMATE.start_fmin_float_~y ULTIMATE.start___fpclassify_float_~x) .cse0 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))))) [2020-10-25 22:01:49,521 INFO L274 CegarLoopResult]: For program point L17-7(lines 14 35) no Hoare annotation was computed. [2020-10-25 22:01:49,522 INFO L270 CegarLoopResult]: At program point L34(lines 14 35) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start_main_~y~0))) (or (and .cse0 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (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)))) (and (= ULTIMATE.start_fmin_float_~x .cse1) .cse0 (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|)) (= ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (= ULTIMATE.start_fmin_float_~x ULTIMATE.start___fpclassify_float_~x) (not (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y)) (fp.eq .cse1 .cse1))))) [2020-10-25 22:01:49,522 INFO L270 CegarLoopResult]: At program point L34-1(lines 14 35) the Hoare annotation is: (let ((.cse1 (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|)) (.cse0 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start_main_~y~0)) (.cse2 (= ULTIMATE.start_fmin_float_~y (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))))) (or (and (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) .cse0 (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y)) .cse1 .cse2) (and (= ULTIMATE.start_fmin_float_~y ULTIMATE.start___fpclassify_float_~x) (not .cse1) .cse0 (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_main_~y~0) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) .cse2))) [2020-10-25 22:01:49,522 INFO L270 CegarLoopResult]: At program point L59(line 59) the Hoare annotation is: (let ((.cse0 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse0) (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse0)))) [2020-10-25 22:01:49,522 INFO L270 CegarLoopResult]: At program point L59-1(line 59) the Hoare annotation is: (and (let ((.cse0 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (or (and (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse0) (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse0)))) |ULTIMATE.start_main_#t~short18| (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) [2020-10-25 22:01:49,522 INFO L270 CegarLoopResult]: At program point L59-2(line 59) the Hoare annotation is: (let ((.cse0 (not |ULTIMATE.start_main_#t~short18|)) (.cse2 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) (.cse1 (not |ULTIMATE.start_main_#t~short22|))) (or (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) .cse0 .cse1 (not (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (not .cse2)) (and (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse0 .cse2 .cse1))) [2020-10-25 22:01:49,522 INFO L270 CegarLoopResult]: At program point L59-3(line 59) the Hoare annotation is: (and (let ((.cse0 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (or (and (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse0) (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse0)))) (not |ULTIMATE.start_main_#t~short18|) (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) (not |ULTIMATE.start_main_#t~short22|) |ULTIMATE.start_main_#t~short21|) [2020-10-25 22:01:49,522 INFO L270 CegarLoopResult]: At program point L59-4(line 59) the Hoare annotation is: (let ((.cse1 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)) (.cse2 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (.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))) (.cse0 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start_main_~y~0))) (or (and (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~y~0) (= ULTIMATE.start_fmin_float_~y ULTIMATE.start___fpclassify_float_~x) .cse0 (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~y~0) .cse1 (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) .cse2 (= ULTIMATE.start_fmin_float_~y .cse3)) (and (= ULTIMATE.start_main_~y~0 |ULTIMATE.start_fmin_float_#res|) (= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~res~0) .cse0 .cse1 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) .cse2) (and (not (fp.eq .cse3 .cse3)) (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~x~0) .cse0 (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~x~0) (not (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y))))) [2020-10-25 22:01:49,523 INFO L270 CegarLoopResult]: At program point L59-5(line 59) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start_main_~y~0)) (.cse1 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)) (.cse2 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)))) (or (and (= ULTIMATE.start_main_~y~0 |ULTIMATE.start_fmin_float_#res|) (= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~res~0) .cse0 .cse1 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) |ULTIMATE.start_main_#t~short26| .cse2) (and (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~y~0) (= ULTIMATE.start_fmin_float_~y ULTIMATE.start___fpclassify_float_~x) .cse0 .cse1 (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~y~0) (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) |ULTIMATE.start_main_#t~short26| .cse2 (= ULTIMATE.start_fmin_float_~y (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)))))) [2020-10-25 22:01:49,523 INFO L270 CegarLoopResult]: At program point L59-6(line 59) the Hoare annotation is: (or (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (and (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))) (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~x~0) (= ULTIMATE.start_fmin_float_~y ULTIMATE.start_main_~y~0) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~x~0) (not (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y)))) [2020-10-25 22:01:49,523 INFO L270 CegarLoopResult]: At program point L59-7(line 59) the Hoare annotation is: (and (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))) (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~x~0) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (= ULTIMATE.start_fmin_float_~y ULTIMATE.start_main_~y~0) (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~x~0) (not (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y))) [2020-10-25 22:01:49,523 INFO L274 CegarLoopResult]: For program point L76(line 76) no Hoare annotation was computed. [2020-10-25 22:01:49,523 INFO L274 CegarLoopResult]: For program point L43(line 43) no Hoare annotation was computed. [2020-10-25 22:01:49,524 INFO L274 CegarLoopResult]: For program point L76-2(lines 76 79) no Hoare annotation was computed. [2020-10-25 22:01:49,524 INFO L274 CegarLoopResult]: For program point L43-2(line 43) no Hoare annotation was computed. [2020-10-25 22:01:49,524 INFO L270 CegarLoopResult]: At program point L43-3(lines 37 44) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start_main_~y~0)) (.cse2 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (.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)))) (or (and (not (fp.eq .cse0 .cse0)) (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~x~0) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) .cse1 (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y))) (and (= ULTIMATE.start_main_~y~0 |ULTIMATE.start_fmin_float_#res|) .cse1 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) .cse2) (and (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~y~0) (= ULTIMATE.start_fmin_float_~y ULTIMATE.start___fpclassify_float_~x) .cse1 (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) .cse2 (= ULTIMATE.start_fmin_float_~y .cse0)))) [2020-10-25 22:01:49,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 10:01:49 BoogieIcfgContainer [2020-10-25 22:01:49,579 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-25 22:01:49,579 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-25 22:01:49,579 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-25 22:01:49,580 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-25 22:01:49,580 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 10:01:15" (3/4) ... [2020-10-25 22:01:49,586 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-10-25 22:01:49,606 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2020-10-25 22:01:49,607 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-10-25 22:01:49,607 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-10-25 22:01:49,608 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-25 22:01:49,635 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0bv32 == \result && ~fp.eq~FLOAT(x, x)) || (1bv32 == \result && !~fp.eq~FLOAT(x, x)) [2020-10-25 22:01:49,635 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0bv32 == \result && ~fp.eq~FLOAT(y, y)) || (1bv32 == \result && !~fp.eq~FLOAT(y, y))) && aux-isnan_float(x) && !isnan_float(y)-aux) && !~fp.eq~FLOAT(x, x) [2020-10-25 22:01:49,635 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((1bv32 == \result && !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(y, y)) && !~fp.eq~FLOAT(x, x)) || (((0bv32 == \result && !aux-isnan_float(x) && !isnan_float(y)-aux) && ~fp.eq~FLOAT(x, x)) && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) [2020-10-25 22:01:49,636 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0bv32 == \result && ~fp.eq~FLOAT(y, y)) || (1bv32 == \result && !~fp.eq~FLOAT(y, y))) && !aux-isnan_float(x) && !isnan_float(y)-aux) && ~fp.eq~FLOAT(x, x)) && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && aux-!isnan_float(x) && isnan_float(y)-aux [2020-10-25 22:01:49,636 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((y == y && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) || (((((y == y && x == x) && 1bv32 == \result) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(y, y)) && x == x) [2020-10-25 22:01:49,637 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((y == y && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) || (((((((x == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) && y == y) && !(0bv32 == \result)) && x == x) && 1bv32 == \result) && x == x) && !~fp.eq~FLOAT(y, y)) && ~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]))) [2020-10-25 22:01:49,637 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!~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(\result, x)) && !~fp.eq~FLOAT(x, x)) && y == y) && ~fp.eq~FLOAT(x, x)) && 1bv32 == \result) && !~fp.eq~FLOAT(y, y)) || ((((y == \result && y == y) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x))) || (((((~fp.eq~FLOAT(\result, y) && y == x) && y == y) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) [2020-10-25 22:01:49,637 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!~fp.eq~FLOAT(x, x) && y == y) && ~fp.eq~FLOAT(x, x)) && 1bv32 == \result) && !~fp.eq~FLOAT(y, y)) || (((((y == x && y == y) && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) [2020-10-25 22:01:49,638 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((~fp.eq~FLOAT(\result, y) && y == x) && y == y) && ~fp.eq~FLOAT(res, y)) && 1bv32 == \result) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) || (((((y == \result && y == res) && y == y) && 1bv32 == \result) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x))) || (((((((!~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(\result, x)) && y == y) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && ~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(res, x)) && !~fp.eq~FLOAT(y, y)) [2020-10-25 22:01:49,638 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!~fp.eq~FLOAT(x, x) && y == y) && ~fp.eq~FLOAT(x, x)) && 1bv32 == \result) && !~fp.eq~FLOAT(y, y)) && 0bv32 == \result) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) || ((((((y == x && !(0bv32 == \result)) && y == y) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) [2020-10-25 22:01:49,638 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((y == \result && y == res) && y == y) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) && aux-isnan_float(x) && !isnan_float(y)-aux) && !~fp.eq~FLOAT(x, x)) || ((((((((~fp.eq~FLOAT(\result, y) && y == x) && y == y) && 0bv32 == \result) && ~fp.eq~FLOAT(res, y)) && !~fp.eq~FLOAT(x, x)) && aux-isnan_float(x) && !isnan_float(y)-aux) && !~fp.eq~FLOAT(x, x)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) [2020-10-25 22:01:49,639 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (1bv32 == \result && !~fp.eq~FLOAT(x, x)) || (((((((!~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(\result, x)) && y == y) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && ~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(res, x)) && !~fp.eq~FLOAT(y, y)) [2020-10-25 22:01:49,640 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!~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(\result, x)) && !~fp.eq~FLOAT(x, x)) && y == y) && ~fp.eq~FLOAT(x, x)) && 1bv32 == \result) && ~fp.eq~FLOAT(res, x)) && !~fp.eq~FLOAT(y, y) [2020-10-25 22:01:49,678 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-25 22:01:49,678 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-25 22:01:49,680 INFO L168 Benchmark]: Toolchain (without parser) took 35433.59 ms. Allocated memory was 50.3 MB in the beginning and 73.4 MB in the end (delta: 23.1 MB). Free memory was 28.3 MB in the beginning and 43.7 MB in the end (delta: -15.4 MB). Peak memory consumption was 9.6 MB. Max. memory is 16.1 GB. [2020-10-25 22:01:49,680 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 37.7 MB. Free memory is still 18.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 22:01:49,681 INFO L168 Benchmark]: CACSL2BoogieTranslator took 362.48 ms. Allocated memory is still 50.3 MB. Free memory was 27.7 MB in the beginning and 30.1 MB in the end (delta: -2.3 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. [2020-10-25 22:01:49,681 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.64 ms. Allocated memory is still 50.3 MB. Free memory was 30.1 MB in the beginning and 27.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-25 22:01:49,682 INFO L168 Benchmark]: Boogie Preprocessor took 40.46 ms. Allocated memory is still 50.3 MB. Free memory was 27.9 MB in the beginning and 26.3 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 22:01:49,682 INFO L168 Benchmark]: RCFGBuilder took 855.35 ms. Allocated memory was 50.3 MB in the beginning and 60.8 MB in the end (delta: 10.5 MB). Free memory was 26.1 MB in the beginning and 40.0 MB in the end (delta: -13.9 MB). Peak memory consumption was 8.8 MB. Max. memory is 16.1 GB. [2020-10-25 22:01:49,683 INFO L168 Benchmark]: TraceAbstraction took 34006.17 ms. Allocated memory was 60.8 MB in the beginning and 73.4 MB in the end (delta: 12.6 MB). Free memory was 39.8 MB in the beginning and 49.4 MB in the end (delta: -9.7 MB). Peak memory consumption was 39.7 MB. Max. memory is 16.1 GB. [2020-10-25 22:01:49,683 INFO L168 Benchmark]: Witness Printer took 99.10 ms. Allocated memory is still 73.4 MB. Free memory was 49.4 MB in the beginning and 43.7 MB in the end (delta: 5.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-10-25 22:01:49,686 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.25 ms. Allocated memory is still 37.7 MB. Free memory is still 18.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 362.48 ms. Allocated memory is still 50.3 MB. Free memory was 27.7 MB in the beginning and 30.1 MB in the end (delta: -2.3 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 52.64 ms. Allocated memory is still 50.3 MB. Free memory was 30.1 MB in the beginning and 27.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 40.46 ms. Allocated memory is still 50.3 MB. Free memory was 27.9 MB in the beginning and 26.3 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 855.35 ms. Allocated memory was 50.3 MB in the beginning and 60.8 MB in the end (delta: 10.5 MB). Free memory was 26.1 MB in the beginning and 40.0 MB in the end (delta: -13.9 MB). Peak memory consumption was 8.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 34006.17 ms. Allocated memory was 60.8 MB in the beginning and 73.4 MB in the end (delta: 12.6 MB). Free memory was 39.8 MB in the beginning and 49.4 MB in the end (delta: -9.7 MB). Peak memory consumption was 39.7 MB. Max. memory is 16.1 GB. * Witness Printer took 99.10 ms. Allocated memory is still 73.4 MB. Free memory was 49.4 MB in the beginning and 43.7 MB in the end (delta: 5.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((y == y && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) || (((((y == y && x == x) && 1bv32 == \result) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(y, y)) && x == x) - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: (((0bv32 == \result && ~fp.eq~FLOAT(y, y)) || (1bv32 == \result && !~fp.eq~FLOAT(y, y))) && aux-isnan_float(x) && !isnan_float(y)-aux) && !~fp.eq~FLOAT(x, x) - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: (0bv32 == \result && ~fp.eq~FLOAT(x, x)) || (1bv32 == \result && !~fp.eq~FLOAT(x, x)) - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: (((((((!~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(\result, x)) && !~fp.eq~FLOAT(x, x)) && y == y) && ~fp.eq~FLOAT(x, x)) && 1bv32 == \result) && !~fp.eq~FLOAT(y, y)) || ((((y == \result && y == y) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x))) || (((((~fp.eq~FLOAT(\result, y) && y == x) && y == y) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: ((((((!~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(\result, x)) && !~fp.eq~FLOAT(x, x)) && y == y) && ~fp.eq~FLOAT(x, x)) && 1bv32 == \result) && ~fp.eq~FLOAT(res, x)) && !~fp.eq~FLOAT(y, y) - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: (1bv32 == \result && !~fp.eq~FLOAT(x, x)) || (((((((!~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(\result, x)) && y == y) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && ~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(res, x)) && !~fp.eq~FLOAT(y, y)) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((!~fp.eq~FLOAT(x, x) && y == y) && ~fp.eq~FLOAT(x, x)) && 1bv32 == \result) && !~fp.eq~FLOAT(y, y)) || (((((y == x && y == y) && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: ((((((y == \result && y == res) && y == y) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) && aux-isnan_float(x) && !isnan_float(y)-aux) && !~fp.eq~FLOAT(x, x)) || ((((((((~fp.eq~FLOAT(\result, y) && y == x) && y == y) && 0bv32 == \result) && ~fp.eq~FLOAT(res, y)) && !~fp.eq~FLOAT(x, x)) && aux-isnan_float(x) && !isnan_float(y)-aux) && !~fp.eq~FLOAT(x, x)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: ((((((!~fp.eq~FLOAT(x, x) && y == y) && ~fp.eq~FLOAT(x, x)) && 1bv32 == \result) && !~fp.eq~FLOAT(y, y)) && 0bv32 == \result) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) || ((((((y == x && !(0bv32 == \result)) && y == y) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: ((((((((~fp.eq~FLOAT(\result, y) && y == x) && y == y) && ~fp.eq~FLOAT(res, y)) && 1bv32 == \result) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) || (((((y == \result && y == res) && y == y) && 1bv32 == \result) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x))) || (((((((!~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(\result, x)) && y == y) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && ~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(res, x)) && !~fp.eq~FLOAT(y, y)) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: ((((y == y && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) || (((((((x == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) && y == y) && !(0bv32 == \result)) && x == x) && 1bv32 == \result) && x == x) && !~fp.eq~FLOAT(y, y)) && ~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]))) - InvariantResult [Line: 61]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: (((((0bv32 == \result && ~fp.eq~FLOAT(y, y)) || (1bv32 == \result && !~fp.eq~FLOAT(y, y))) && !aux-isnan_float(x) && !isnan_float(y)-aux) && ~fp.eq~FLOAT(x, x)) && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && aux-!isnan_float(x) && isnan_float(y)-aux - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: ((((1bv32 == \result && !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(y, y)) && !~fp.eq~FLOAT(x, x)) || (((0bv32 == \result && !aux-isnan_float(x) && !isnan_float(y)-aux) && ~fp.eq~FLOAT(x, x)) && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 49 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 28.4s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 17.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1146 SDtfs, 2441 SDslu, 4709 SDs, 0 SdLazy, 1984 SolverSat, 266 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 9.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1045 GetRequests, 770 SyntacticMatches, 10 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 939 ImplicationChecksByTransitivity, 10.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=7, 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, 19 MinimizatonAttempts, 578 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 48 NumberOfFragments, 618 HoareAnnotationTreeSize, 14 FomulaSimplifications, 580250 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 14 FomulaSimplificationsInter, 84227 FormulaSimplificationTreeSizeReductionInter, 4.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 479 NumberOfCodeBlocks, 479 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 920 ConstructedInterpolants, 31 QuantifiedInterpolants, 94558 SizeOfPredicates, 147 NumberOfNonLiveVariables, 1698 ConjunctsInSsa, 188 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 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...