./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1251.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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_1251.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash de540e539c3db6027c1fdb04fcc6cae02aafb8aa58950d31054b2b0b8391af6d --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 03:13:38,737 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:13:38,740 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:13:38,766 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:13:38,768 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:13:38,770 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:13:38,773 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:13:38,776 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:13:38,779 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:13:38,785 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:13:38,786 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:13:38,787 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:13:38,788 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:13:38,790 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:13:38,792 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:13:38,794 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:13:38,796 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:13:38,797 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:13:38,799 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:13:38,804 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:13:38,809 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:13:38,810 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:13:38,812 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:13:38,813 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:13:38,813 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:13:38,815 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:13:38,816 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:13:38,816 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:13:38,817 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:13:38,817 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:13:38,818 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:13:38,818 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:13:38,819 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:13:38,819 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:13:38,820 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:13:38,821 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:13:38,821 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:13:38,822 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:13:38,822 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:13:38,822 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:13:38,822 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:13:38,823 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:13:38,824 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 03:13:38,855 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:13:38,858 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:13:38,858 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:13:38,858 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:13:38,861 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:13:38,861 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:13:38,861 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:13:38,862 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:13:38,862 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:13:38,863 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:13:38,863 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:13:38,863 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 03:13:38,864 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:13:38,864 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:13:38,864 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:13:38,864 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:13:38,864 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:13:38,864 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:13:38,865 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:13:38,866 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:13:38,866 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:13:38,867 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:13:38,867 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:13:38,867 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:13:38,867 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:13:38,868 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:13:38,868 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:13:38,868 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:13:38,868 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 03:13:38,868 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 03:13:38,869 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:13:38,869 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:13:38,869 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:13:38,869 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 -> de540e539c3db6027c1fdb04fcc6cae02aafb8aa58950d31054b2b0b8391af6d [2022-07-12 03:13:39,082 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:13:39,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:13:39,109 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:13:39,110 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:13:39,110 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:13:39,111 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2022-07-12 03:13:39,180 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0326da594/8f23f93960234373802874d5d80e7b13/FLAGf57142652 [2022-07-12 03:13:39,575 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:13:39,575 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2022-07-12 03:13:39,584 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0326da594/8f23f93960234373802874d5d80e7b13/FLAGf57142652 [2022-07-12 03:13:39,599 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0326da594/8f23f93960234373802874d5d80e7b13 [2022-07-12 03:13:39,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:13:39,602 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:13:39,604 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:13:39,604 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:13:39,606 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:13:39,607 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:13:39" (1/1) ... [2022-07-12 03:13:39,607 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ecb6c53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:39, skipping insertion in model container [2022-07-12 03:13:39,607 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:13:39" (1/1) ... [2022-07-12 03:13:39,613 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:13:39,626 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:13:39,789 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c[1980,1993] [2022-07-12 03:13:39,799 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c[2139,2152] [2022-07-12 03:13:39,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:13:39,806 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:13:39,822 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c[1980,1993] [2022-07-12 03:13:39,823 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c[2139,2152] [2022-07-12 03:13:39,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:13:39,835 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:13:39,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:39 WrapperNode [2022-07-12 03:13:39,836 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:13:39,837 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:13:39,837 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:13:39,837 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:13:39,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:39" (1/1) ... [2022-07-12 03:13:39,849 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:39" (1/1) ... [2022-07-12 03:13:39,865 INFO L137 Inliner]: procedures = 18, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 107 [2022-07-12 03:13:39,866 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:13:39,866 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:13:39,867 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:13:39,867 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:13:39,873 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:39" (1/1) ... [2022-07-12 03:13:39,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:39" (1/1) ... [2022-07-12 03:13:39,876 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:39" (1/1) ... [2022-07-12 03:13:39,877 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:39" (1/1) ... [2022-07-12 03:13:39,882 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:39" (1/1) ... [2022-07-12 03:13:39,885 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:39" (1/1) ... [2022-07-12 03:13:39,887 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:39" (1/1) ... [2022-07-12 03:13:39,888 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:13:39,892 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:13:39,892 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:13:39,892 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:13:39,893 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:39" (1/1) ... [2022-07-12 03:13:39,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:13:39,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:13:39,937 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 03:13:39,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 03:13:39,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:13:39,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 03:13:39,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 03:13:39,977 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2022-07-12 03:13:39,978 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2022-07-12 03:13:39,978 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2022-07-12 03:13:39,978 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2022-07-12 03:13:39,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-07-12 03:13:39,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:13:39,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:13:39,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 03:13:39,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 03:13:40,037 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:13:40,038 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:13:40,234 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:13:40,240 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:13:40,240 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-12 03:13:40,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:13:40 BoogieIcfgContainer [2022-07-12 03:13:40,242 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:13:40,260 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:13:40,260 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:13:40,263 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:13:40,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:13:39" (1/3) ... [2022-07-12 03:13:40,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cfb8c08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:13:40, skipping insertion in model container [2022-07-12 03:13:40,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:39" (2/3) ... [2022-07-12 03:13:40,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cfb8c08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:13:40, skipping insertion in model container [2022-07-12 03:13:40,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:13:40" (3/3) ... [2022-07-12 03:13:40,266 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1251.c [2022-07-12 03:13:40,280 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:13:40,280 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-12 03:13:40,327 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:13:40,334 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@63ea731e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4a2c7181 [2022-07-12 03:13:40,336 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-12 03:13:40,340 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 44 states have internal predecessors, (61), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-12 03:13:40,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 03:13:40,348 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:13:40,348 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:13:40,349 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:13:40,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:13:40,353 INFO L85 PathProgramCache]: Analyzing trace with hash -625969503, now seen corresponding path program 1 times [2022-07-12 03:13:40,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:13:40,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091729973] [2022-07-12 03:13:40,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:13:40,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:13:40,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:40,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 03:13:40,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:40,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 03:13:40,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:40,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 03:13:40,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:40,569 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 03:13:40,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:13:40,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091729973] [2022-07-12 03:13:40,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091729973] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:13:40,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:13:40,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:13:40,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348058845] [2022-07-12 03:13:40,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:13:40,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:13:40,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:13:40,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:13:40,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:13:40,605 INFO L87 Difference]: Start difference. First operand has 57 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 44 states have internal predecessors, (61), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 03:13:40,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:13:40,806 INFO L93 Difference]: Finished difference Result 108 states and 156 transitions. [2022-07-12 03:13:40,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 03:13:40,808 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-07-12 03:13:40,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:13:40,815 INFO L225 Difference]: With dead ends: 108 [2022-07-12 03:13:40,815 INFO L226 Difference]: Without dead ends: 62 [2022-07-12 03:13:40,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:13:40,827 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 19 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:13:40,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 245 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:13:40,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-12 03:13:40,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2022-07-12 03:13:40,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 42 states have internal predecessors, (54), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-12 03:13:40,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 74 transitions. [2022-07-12 03:13:40,888 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 74 transitions. Word has length 28 [2022-07-12 03:13:40,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:13:40,888 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 74 transitions. [2022-07-12 03:13:40,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 03:13:40,889 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 74 transitions. [2022-07-12 03:13:40,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 03:13:40,890 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:13:40,891 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2022-07-12 03:13:40,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 03:13:40,891 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:13:40,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:13:40,892 INFO L85 PathProgramCache]: Analyzing trace with hash 716059, now seen corresponding path program 1 times [2022-07-12 03:13:40,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:13:40,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370035063] [2022-07-12 03:13:40,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:13:40,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:13:40,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:41,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 03:13:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:41,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 03:13:41,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:41,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 03:13:41,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:41,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 03:13:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:41,093 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 03:13:41,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:13:41,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370035063] [2022-07-12 03:13:41,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370035063] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:13:41,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:13:41,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:13:41,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30427081] [2022-07-12 03:13:41,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:13:41,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:13:41,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:13:41,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:13:41,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:13:41,103 INFO L87 Difference]: Start difference. First operand 55 states and 74 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 03:13:41,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:13:41,187 INFO L93 Difference]: Finished difference Result 79 states and 104 transitions. [2022-07-12 03:13:41,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:13:41,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-07-12 03:13:41,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:13:41,193 INFO L225 Difference]: With dead ends: 79 [2022-07-12 03:13:41,193 INFO L226 Difference]: Without dead ends: 59 [2022-07-12 03:13:41,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:13:41,203 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 3 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:13:41,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 225 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:13:41,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-12 03:13:41,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-07-12 03:13:41,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 45 states have internal predecessors, (57), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2022-07-12 03:13:41,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 79 transitions. [2022-07-12 03:13:41,218 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 79 transitions. Word has length 34 [2022-07-12 03:13:41,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:13:41,218 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 79 transitions. [2022-07-12 03:13:41,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 03:13:41,219 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 79 transitions. [2022-07-12 03:13:41,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-12 03:13:41,220 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:13:41,220 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2022-07-12 03:13:41,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 03:13:41,221 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:13:41,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:13:41,222 INFO L85 PathProgramCache]: Analyzing trace with hash 840977401, now seen corresponding path program 1 times [2022-07-12 03:13:41,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:13:41,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085531533] [2022-07-12 03:13:41,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:13:41,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:13:41,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:41,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 03:13:41,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:41,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 03:13:41,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:41,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 03:13:41,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:41,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 03:13:41,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:41,329 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 03:13:41,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:13:41,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085531533] [2022-07-12 03:13:41,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085531533] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:13:41,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:13:41,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:13:41,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503608388] [2022-07-12 03:13:41,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:13:41,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:13:41,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:13:41,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:13:41,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:13:41,332 INFO L87 Difference]: Start difference. First operand 59 states and 79 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 03:13:41,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:13:41,395 INFO L93 Difference]: Finished difference Result 83 states and 109 transitions. [2022-07-12 03:13:41,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:13:41,398 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2022-07-12 03:13:41,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:13:41,400 INFO L225 Difference]: With dead ends: 83 [2022-07-12 03:13:41,400 INFO L226 Difference]: Without dead ends: 63 [2022-07-12 03:13:41,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:13:41,401 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 3 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:13:41,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 241 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:13:41,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-12 03:13:41,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2022-07-12 03:13:41,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 45 states have internal predecessors, (57), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2022-07-12 03:13:41,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 79 transitions. [2022-07-12 03:13:41,410 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 79 transitions. Word has length 35 [2022-07-12 03:13:41,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:13:41,410 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 79 transitions. [2022-07-12 03:13:41,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 03:13:41,411 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 79 transitions. [2022-07-12 03:13:41,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 03:13:41,412 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:13:41,412 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2022-07-12 03:13:41,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 03:13:41,412 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:13:41,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:13:41,413 INFO L85 PathProgramCache]: Analyzing trace with hash -902959273, now seen corresponding path program 1 times [2022-07-12 03:13:41,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:13:41,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104193962] [2022-07-12 03:13:41,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:13:41,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:13:41,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:41,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 03:13:41,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:41,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 03:13:41,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:41,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 03:13:41,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:41,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 03:13:41,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:41,536 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 03:13:41,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:13:41,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104193962] [2022-07-12 03:13:41,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104193962] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:13:41,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:13:41,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:13:41,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154027490] [2022-07-12 03:13:41,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:13:41,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:13:41,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:13:41,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:13:41,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:13:41,539 INFO L87 Difference]: Start difference. First operand 59 states and 79 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 03:13:41,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:13:41,608 INFO L93 Difference]: Finished difference Result 83 states and 109 transitions. [2022-07-12 03:13:41,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:13:41,608 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2022-07-12 03:13:41,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:13:41,611 INFO L225 Difference]: With dead ends: 83 [2022-07-12 03:13:41,611 INFO L226 Difference]: Without dead ends: 63 [2022-07-12 03:13:41,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:13:41,622 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 3 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:13:41,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 241 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:13:41,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-12 03:13:41,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2022-07-12 03:13:41,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 45 states have internal predecessors, (57), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2022-07-12 03:13:41,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 79 transitions. [2022-07-12 03:13:41,642 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 79 transitions. Word has length 36 [2022-07-12 03:13:41,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:13:41,643 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 79 transitions. [2022-07-12 03:13:41,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 03:13:41,643 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 79 transitions. [2022-07-12 03:13:41,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 03:13:41,644 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:13:41,645 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2022-07-12 03:13:41,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 03:13:41,645 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:13:41,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:13:41,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1658214444, now seen corresponding path program 1 times [2022-07-12 03:13:41,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:13:41,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754635188] [2022-07-12 03:13:41,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:13:41,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:13:41,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:41,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 03:13:41,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:41,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 03:13:41,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:41,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 03:13:41,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:41,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 03:13:41,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:41,717 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 03:13:41,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:13:41,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754635188] [2022-07-12 03:13:41,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754635188] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:13:41,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:13:41,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:13:41,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637804063] [2022-07-12 03:13:41,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:13:41,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:13:41,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:13:41,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:13:41,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:13:41,720 INFO L87 Difference]: Start difference. First operand 59 states and 79 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-12 03:13:41,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:13:41,765 INFO L93 Difference]: Finished difference Result 62 states and 82 transitions. [2022-07-12 03:13:41,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:13:41,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2022-07-12 03:13:41,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:13:41,768 INFO L225 Difference]: With dead ends: 62 [2022-07-12 03:13:41,768 INFO L226 Difference]: Without dead ends: 60 [2022-07-12 03:13:41,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:13:41,769 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 3 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:13:41,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 172 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:13:41,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-07-12 03:13:41,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-07-12 03:13:41,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 45 states have (on average 1.288888888888889) internal successors, (58), 46 states have internal predecessors, (58), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2022-07-12 03:13:41,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 80 transitions. [2022-07-12 03:13:41,788 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 80 transitions. Word has length 37 [2022-07-12 03:13:41,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:13:41,788 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 80 transitions. [2022-07-12 03:13:41,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-12 03:13:41,788 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 80 transitions. [2022-07-12 03:13:41,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-12 03:13:41,789 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:13:41,790 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2022-07-12 03:13:41,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 03:13:41,790 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:13:41,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:13:41,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1826594765, now seen corresponding path program 1 times [2022-07-12 03:13:41,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:13:41,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798202153] [2022-07-12 03:13:41,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:13:41,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:13:41,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 03:13:41,833 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 03:13:41,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 03:13:41,868 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 03:13:41,868 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 03:13:41,869 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-07-12 03:13:41,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-07-12 03:13:41,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 03:13:41,874 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-07-12 03:13:41,876 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 03:13:41,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 03:13:41 BoogieIcfgContainer [2022-07-12 03:13:41,919 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 03:13:41,919 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 03:13:41,919 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 03:13:41,919 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 03:13:41,920 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:13:40" (3/4) ... [2022-07-12 03:13:41,922 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-12 03:13:41,922 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 03:13:41,923 INFO L158 Benchmark]: Toolchain (without parser) took 2320.77ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 67.0MB in the beginning and 61.7MB in the end (delta: 5.3MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. [2022-07-12 03:13:41,923 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 81.8MB. Free memory was 50.9MB in the beginning and 50.9MB in the end (delta: 25.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:13:41,923 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.53ms. Allocated memory is still 98.6MB. Free memory was 67.0MB in the beginning and 74.7MB in the end (delta: -7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 03:13:41,924 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.81ms. Allocated memory is still 98.6MB. Free memory was 74.7MB in the beginning and 73.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:13:41,924 INFO L158 Benchmark]: Boogie Preprocessor took 22.10ms. Allocated memory is still 98.6MB. Free memory was 73.2MB in the beginning and 71.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:13:41,924 INFO L158 Benchmark]: RCFGBuilder took 350.65ms. Allocated memory is still 98.6MB. Free memory was 71.6MB in the beginning and 58.0MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-12 03:13:41,924 INFO L158 Benchmark]: TraceAbstraction took 1658.72ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 57.4MB in the beginning and 61.7MB in the end (delta: -4.3MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. [2022-07-12 03:13:41,925 INFO L158 Benchmark]: Witness Printer took 3.07ms. Allocated memory is still 119.5MB. Free memory is still 61.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:13:41,927 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.20ms. Allocated memory is still 81.8MB. Free memory was 50.9MB in the beginning and 50.9MB in the end (delta: 25.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.53ms. Allocated memory is still 98.6MB. Free memory was 67.0MB in the beginning and 74.7MB in the end (delta: -7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.81ms. Allocated memory is still 98.6MB. Free memory was 74.7MB in the beginning and 73.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.10ms. Allocated memory is still 98.6MB. Free memory was 73.2MB in the beginning and 71.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 350.65ms. Allocated memory is still 98.6MB. Free memory was 71.6MB in the beginning and 58.0MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1658.72ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 57.4MB in the beginning and 61.7MB in the end (delta: -4.3MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. * Witness Printer took 3.07ms. Allocated memory is still 119.5MB. Free memory is still 61.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 76]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 75. Possible FailurePath: [L66] float x = __VERIFIER_nondet_float(); [L67] float y = __VERIFIER_nondet_float(); [L69] CALL, EXPR isnan_float(x) VAL [\old(x)=4286578691] [L57] return x != x; VAL [\old(x)=4286578691, \result=1, x=4286578691] [L69] RET, EXPR isnan_float(x) VAL [isnan_float(x)=1, x=4286578691] [L69] EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, x=4286578691] [L69] CALL, EXPR isnan_float(y) VAL [\old(x)=4286578690] [L57] return x != x; VAL [\old(x)=4286578690, \result=0, x=4286578690] [L69] RET, EXPR isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, x=4286578691, y=4286578690] [L69] EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, x=4286578691, y=4286578690] [L69-L70] (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) VAL [(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))=1, isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, x=4286578691, y=4286578690] [L69-L70] COND TRUE (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L72] CALL, EXPR fmax_float(x, y) [L46] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=4286578691] [L23] __uint32_t w; VAL [\old(x)=4286578691, x=4286578691] [L26] ieee_float_shape_type gf_u; [L27] gf_u.value = (x) [L28] EXPR gf_u.word [L28] (w) = gf_u.word [L31] COND FALSE !(w == 0x00000000 || w == 0x80000000) VAL [\old(x)=4286578691, w=4286578689, x=4286578691] [L33-L34] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) VAL [\old(x)=4286578691, w=4286578689, x=4286578691] [L36-L37] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) VAL [\old(x)=4286578691, w=4286578689, x=4286578691] [L39] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L42] return 0; VAL [\old(x)=4286578691, \result=0, w=4286578689, x=4286578691] [L46] RET, EXPR __fpclassify_float(x) VAL [\old(x)=4286578691, \old(y)=4286578690, __fpclassify_float(x)=0, x=4286578691, y=4286578690] [L46] COND TRUE __fpclassify_float(x) == 0 [L47] return y; VAL [\old(x)=4286578691, \old(y)=4286578690, \result=4286578690, x=4286578691, y=4286578690] [L72] RET, EXPR fmax_float(x, y) [L72] float res = fmax_float(x, y); [L75] CALL, EXPR isnan_float(x) VAL [\old(x)=4286578691] [L57] return x != x; VAL [\old(x)=4286578691, \result=1, x=4286578691] [L75] RET, EXPR isnan_float(x) VAL [isnan_float(x)=1, res=4286578690, x=4286578691, y=4286578690] [L75] EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, res=4286578690, x=4286578691, y=4286578690] [L75] CALL, EXPR isnan_float(y) VAL [\old(x)=4286578690] [L57] return x != x; VAL [\old(x)=4286578690, \result=0, x=4286578690] [L75] RET, EXPR isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, res=4286578690, x=4286578691, y=4286578690] [L75] EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, res=4286578690, x=4286578691, y=4286578690] [L75] COND TRUE isnan_float(x) && !isnan_float(y) && res != y [L76] reach_error() VAL [res=4286578690, x=4286578691, y=4286578690] - UnprovableResult [Line: 82]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 57 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 33 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31 mSDsluCounter, 1124 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 759 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 233 IncrementalHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 365 mSDtfsCounter, 233 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=5, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 15 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 212 NumberOfCodeBlocks, 212 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 165 ConstructedInterpolants, 0 QuantifiedInterpolants, 276 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 39/39 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 [2022-07-12 03:13:41,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_1251.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash de540e539c3db6027c1fdb04fcc6cae02aafb8aa58950d31054b2b0b8391af6d --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 03:13:43,921 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:13:43,923 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:13:43,962 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:13:43,963 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:13:43,964 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:13:43,968 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:13:43,971 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:13:43,973 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:13:43,977 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:13:43,978 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:13:43,980 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:13:43,981 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:13:43,982 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:13:43,984 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:13:43,989 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:13:43,989 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:13:43,991 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:13:43,993 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:13:43,999 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:13:44,000 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:13:44,001 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:13:44,003 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:13:44,004 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:13:44,005 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:13:44,012 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:13:44,012 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:13:44,013 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:13:44,014 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:13:44,014 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:13:44,015 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:13:44,015 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:13:44,017 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:13:44,017 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:13:44,019 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:13:44,020 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:13:44,020 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:13:44,020 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:13:44,021 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:13:44,021 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:13:44,022 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:13:44,023 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:13:44,028 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-12 03:13:44,061 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:13:44,062 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:13:44,062 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:13:44,062 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:13:44,063 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:13:44,063 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:13:44,064 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:13:44,064 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:13:44,065 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:13:44,066 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:13:44,066 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:13:44,066 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:13:44,066 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:13:44,066 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:13:44,067 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:13:44,067 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:13:44,067 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 03:13:44,067 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 03:13:44,068 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 03:13:44,068 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:13:44,068 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:13:44,068 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:13:44,068 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:13:44,069 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:13:44,069 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:13:44,069 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:13:44,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:13:44,069 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:13:44,070 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:13:44,070 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:13:44,070 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 03:13:44,070 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 03:13:44,071 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:13:44,071 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:13:44,071 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:13:44,071 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 03:13:44,072 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 -> de540e539c3db6027c1fdb04fcc6cae02aafb8aa58950d31054b2b0b8391af6d [2022-07-12 03:13:44,400 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:13:44,420 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:13:44,422 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:13:44,424 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:13:44,427 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:13:44,429 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2022-07-12 03:13:44,488 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea581a033/3dbb36405c514b9fa7b52c79fff085de/FLAG176c9a765 [2022-07-12 03:13:44,943 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:13:44,944 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2022-07-12 03:13:44,948 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea581a033/3dbb36405c514b9fa7b52c79fff085de/FLAG176c9a765 [2022-07-12 03:13:44,967 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea581a033/3dbb36405c514b9fa7b52c79fff085de [2022-07-12 03:13:44,970 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:13:44,971 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:13:44,973 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:13:44,974 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:13:44,976 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:13:44,977 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:13:44" (1/1) ... [2022-07-12 03:13:44,978 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45b99002 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:44, skipping insertion in model container [2022-07-12 03:13:44,979 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:13:44" (1/1) ... [2022-07-12 03:13:44,984 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:13:45,002 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:13:45,172 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c[1980,1993] [2022-07-12 03:13:45,182 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c[2139,2152] [2022-07-12 03:13:45,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:13:45,201 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:13:45,257 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c[1980,1993] [2022-07-12 03:13:45,265 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c[2139,2152] [2022-07-12 03:13:45,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:13:45,284 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:13:45,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:45 WrapperNode [2022-07-12 03:13:45,284 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:13:45,285 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:13:45,285 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:13:45,286 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:13:45,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:45" (1/1) ... [2022-07-12 03:13:45,308 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:45" (1/1) ... [2022-07-12 03:13:45,338 INFO L137 Inliner]: procedures = 21, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 98 [2022-07-12 03:13:45,338 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:13:45,339 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:13:45,340 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:13:45,340 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:13:45,348 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:45" (1/1) ... [2022-07-12 03:13:45,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:45" (1/1) ... [2022-07-12 03:13:45,364 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:45" (1/1) ... [2022-07-12 03:13:45,364 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:45" (1/1) ... [2022-07-12 03:13:45,375 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:45" (1/1) ... [2022-07-12 03:13:45,385 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:45" (1/1) ... [2022-07-12 03:13:45,387 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:45" (1/1) ... [2022-07-12 03:13:45,393 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:13:45,397 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:13:45,397 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:13:45,397 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:13:45,398 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:45" (1/1) ... [2022-07-12 03:13:45,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:13:45,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:13:45,423 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 03:13:45,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 03:13:45,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:13:45,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 03:13:45,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 03:13:45,465 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2022-07-12 03:13:45,466 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2022-07-12 03:13:45,466 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2022-07-12 03:13:45,466 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2022-07-12 03:13:45,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-12 03:13:45,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:13:45,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:13:45,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-07-12 03:13:45,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 03:13:45,562 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:13:45,564 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:13:45,791 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:13:45,796 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:13:45,796 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-12 03:13:45,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:13:45 BoogieIcfgContainer [2022-07-12 03:13:45,798 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:13:45,800 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:13:45,800 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:13:45,802 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:13:45,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:13:44" (1/3) ... [2022-07-12 03:13:45,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51af3f85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:13:45, skipping insertion in model container [2022-07-12 03:13:45,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:45" (2/3) ... [2022-07-12 03:13:45,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51af3f85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:13:45, skipping insertion in model container [2022-07-12 03:13:45,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:13:45" (3/3) ... [2022-07-12 03:13:45,805 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1251.c [2022-07-12 03:13:45,817 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:13:45,817 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-12 03:13:45,854 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:13:45,864 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4fc9859b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5b58c4cc [2022-07-12 03:13:45,865 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-12 03:13:45,871 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 40 states have (on average 1.475) internal successors, (59), 42 states have internal predecessors, (59), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-12 03:13:45,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 03:13:45,889 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:13:45,890 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:13:45,891 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:13:45,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:13:45,895 INFO L85 PathProgramCache]: Analyzing trace with hash 956195031, now seen corresponding path program 1 times [2022-07-12 03:13:45,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:13:45,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2040580010] [2022-07-12 03:13:45,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:13:45,907 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:13:45,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:13:45,910 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:13:45,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-12 03:13:46,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:46,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-12 03:13:46,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:13:46,059 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:13:46,059 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:13:46,060 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:13:46,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2040580010] [2022-07-12 03:13:46,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2040580010] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:13:46,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:13:46,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 03:13:46,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760826704] [2022-07-12 03:13:46,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:13:46,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 03:13:46,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:13:46,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 03:13:46,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:13:46,106 INFO L87 Difference]: Start difference. First operand has 55 states, 40 states have (on average 1.475) internal successors, (59), 42 states have internal predecessors, (59), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 03:13:46,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:13:46,135 INFO L93 Difference]: Finished difference Result 93 states and 134 transitions. [2022-07-12 03:13:46,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 03:13:46,137 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-07-12 03:13:46,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:13:46,144 INFO L225 Difference]: With dead ends: 93 [2022-07-12 03:13:46,145 INFO L226 Difference]: Without dead ends: 51 [2022-07-12 03:13:46,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:13:46,152 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:13:46,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:13:46,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-12 03:13:46,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-07-12 03:13:46,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 38 states have internal predecessors, (50), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-12 03:13:46,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions. [2022-07-12 03:13:46,198 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 27 [2022-07-12 03:13:46,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:13:46,199 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 70 transitions. [2022-07-12 03:13:46,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 03:13:46,200 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-07-12 03:13:46,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 03:13:46,203 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:13:46,203 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:13:46,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-12 03:13:46,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:13:46,416 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:13:46,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:13:46,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1128254016, now seen corresponding path program 1 times [2022-07-12 03:13:46,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:13:46,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [642637043] [2022-07-12 03:13:46,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:13:46,419 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:13:46,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:13:46,420 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:13:46,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-12 03:13:46,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:46,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 03:13:46,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:13:46,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:13:46,541 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:13:46,542 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:13:46,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [642637043] [2022-07-12 03:13:46,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [642637043] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:13:46,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:13:46,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:13:46,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493311226] [2022-07-12 03:13:46,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:13:46,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:13:46,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:13:46,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:13:46,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:13:46,546 INFO L87 Difference]: Start difference. First operand 51 states and 70 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 03:13:46,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:13:46,590 INFO L93 Difference]: Finished difference Result 96 states and 131 transitions. [2022-07-12 03:13:46,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:13:46,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-07-12 03:13:46,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:13:46,594 INFO L225 Difference]: With dead ends: 96 [2022-07-12 03:13:46,594 INFO L226 Difference]: Without dead ends: 60 [2022-07-12 03:13:46,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:13:46,595 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 16 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:13:46,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 192 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:13:46,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-07-12 03:13:46,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2022-07-12 03:13:46,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 40 states have internal predecessors, (52), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-12 03:13:46,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 72 transitions. [2022-07-12 03:13:46,614 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 72 transitions. Word has length 28 [2022-07-12 03:13:46,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:13:46,615 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 72 transitions. [2022-07-12 03:13:46,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 03:13:46,615 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 72 transitions. [2022-07-12 03:13:46,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-12 03:13:46,618 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:13:46,619 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2022-07-12 03:13:46,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-12 03:13:46,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:13:46,830 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:13:46,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:13:46,830 INFO L85 PathProgramCache]: Analyzing trace with hash 987158491, now seen corresponding path program 1 times [2022-07-12 03:13:46,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:13:46,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1033076829] [2022-07-12 03:13:46,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:13:46,831 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:13:46,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:13:46,833 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:13:46,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-12 03:13:46,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:46,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 03:13:46,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:13:46,921 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 03:13:46,921 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:13:46,921 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:13:46,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1033076829] [2022-07-12 03:13:46,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1033076829] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:13:46,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:13:46,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:13:46,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766417553] [2022-07-12 03:13:46,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:13:46,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:13:46,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:13:46,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:13:46,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:13:46,930 INFO L87 Difference]: Start difference. First operand 53 states and 72 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 03:13:46,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:13:46,963 INFO L93 Difference]: Finished difference Result 76 states and 101 transitions. [2022-07-12 03:13:46,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:13:46,964 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2022-07-12 03:13:46,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:13:46,966 INFO L225 Difference]: With dead ends: 76 [2022-07-12 03:13:46,966 INFO L226 Difference]: Without dead ends: 56 [2022-07-12 03:13:46,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:13:46,968 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:13:46,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:13:46,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-12 03:13:46,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-07-12 03:13:46,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 42 states have internal predecessors, (54), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2022-07-12 03:13:46,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2022-07-12 03:13:46,975 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 76 transitions. Word has length 33 [2022-07-12 03:13:46,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:13:46,975 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 76 transitions. [2022-07-12 03:13:46,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 03:13:46,976 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2022-07-12 03:13:46,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 03:13:46,977 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:13:46,977 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2022-07-12 03:13:46,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-12 03:13:47,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:13:47,188 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:13:47,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:13:47,189 INFO L85 PathProgramCache]: Analyzing trace with hash 871427583, now seen corresponding path program 1 times [2022-07-12 03:13:47,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:13:47,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [546310397] [2022-07-12 03:13:47,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:13:47,190 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:13:47,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:13:47,192 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:13:47,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-12 03:13:47,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:47,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 03:13:47,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:13:47,314 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 03:13:47,314 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:13:47,314 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:13:47,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [546310397] [2022-07-12 03:13:47,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [546310397] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:13:47,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:13:47,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:13:47,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115046232] [2022-07-12 03:13:47,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:13:47,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:13:47,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:13:47,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:13:47,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:13:47,316 INFO L87 Difference]: Start difference. First operand 56 states and 76 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 03:13:47,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:13:47,357 INFO L93 Difference]: Finished difference Result 79 states and 105 transitions. [2022-07-12 03:13:47,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:13:47,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-07-12 03:13:47,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:13:47,364 INFO L225 Difference]: With dead ends: 79 [2022-07-12 03:13:47,364 INFO L226 Difference]: Without dead ends: 59 [2022-07-12 03:13:47,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:13:47,365 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:13:47,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 207 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:13:47,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-12 03:13:47,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2022-07-12 03:13:47,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 42 states have internal predecessors, (54), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2022-07-12 03:13:47,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2022-07-12 03:13:47,376 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 76 transitions. Word has length 34 [2022-07-12 03:13:47,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:13:47,376 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 76 transitions. [2022-07-12 03:13:47,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 03:13:47,377 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2022-07-12 03:13:47,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-12 03:13:47,378 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:13:47,378 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2022-07-12 03:13:47,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-07-12 03:13:47,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:13:47,579 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:13:47,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:13:47,579 INFO L85 PathProgramCache]: Analyzing trace with hash 405124703, now seen corresponding path program 1 times [2022-07-12 03:13:47,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:13:47,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1735572033] [2022-07-12 03:13:47,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:13:47,580 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:13:47,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:13:47,582 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:13:47,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-12 03:13:47,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:47,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 03:13:47,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:13:47,675 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 03:13:47,676 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:13:47,676 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:13:47,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1735572033] [2022-07-12 03:13:47,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1735572033] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:13:47,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:13:47,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:13:47,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70885194] [2022-07-12 03:13:47,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:13:47,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:13:47,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:13:47,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:13:47,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:13:47,683 INFO L87 Difference]: Start difference. First operand 56 states and 76 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 03:13:47,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:13:47,712 INFO L93 Difference]: Finished difference Result 79 states and 105 transitions. [2022-07-12 03:13:47,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:13:47,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2022-07-12 03:13:47,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:13:47,714 INFO L225 Difference]: With dead ends: 79 [2022-07-12 03:13:47,714 INFO L226 Difference]: Without dead ends: 59 [2022-07-12 03:13:47,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:13:47,715 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:13:47,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 207 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:13:47,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-12 03:13:47,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2022-07-12 03:13:47,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 42 states have internal predecessors, (54), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2022-07-12 03:13:47,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2022-07-12 03:13:47,722 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 76 transitions. Word has length 35 [2022-07-12 03:13:47,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:13:47,723 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 76 transitions. [2022-07-12 03:13:47,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 03:13:47,727 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2022-07-12 03:13:47,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 03:13:47,728 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:13:47,728 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2022-07-12 03:13:47,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-12 03:13:47,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:13:47,941 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:13:47,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:13:47,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1955992579, now seen corresponding path program 1 times [2022-07-12 03:13:47,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:13:47,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [97910989] [2022-07-12 03:13:47,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:13:47,943 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:13:47,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:13:47,944 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:13:47,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-12 03:13:47,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:47,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 03:13:48,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:13:48,014 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 03:13:48,014 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:13:48,014 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:13:48,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [97910989] [2022-07-12 03:13:48,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [97910989] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:13:48,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:13:48,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:13:48,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52536946] [2022-07-12 03:13:48,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:13:48,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:13:48,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:13:48,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:13:48,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:13:48,017 INFO L87 Difference]: Start difference. First operand 56 states and 76 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 03:13:48,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:13:48,039 INFO L93 Difference]: Finished difference Result 79 states and 105 transitions. [2022-07-12 03:13:48,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:13:48,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2022-07-12 03:13:48,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:13:48,040 INFO L225 Difference]: With dead ends: 79 [2022-07-12 03:13:48,040 INFO L226 Difference]: Without dead ends: 59 [2022-07-12 03:13:48,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:13:48,042 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:13:48,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 207 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:13:48,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-12 03:13:48,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2022-07-12 03:13:48,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 42 states have internal predecessors, (54), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2022-07-12 03:13:48,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2022-07-12 03:13:48,048 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 76 transitions. Word has length 36 [2022-07-12 03:13:48,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:13:48,048 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 76 transitions. [2022-07-12 03:13:48,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 03:13:48,048 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2022-07-12 03:13:48,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 03:13:48,049 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:13:48,050 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2022-07-12 03:13:48,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-12 03:13:48,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:13:48,260 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:13:48,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:13:48,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1662589572, now seen corresponding path program 1 times [2022-07-12 03:13:48,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:13:48,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1434745824] [2022-07-12 03:13:48,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:13:48,262 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:13:48,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:13:48,263 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:13:48,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-12 03:13:48,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:48,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 03:13:48,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:13:48,567 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 03:13:48,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:13:48,807 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 03:13:48,807 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:13:48,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1434745824] [2022-07-12 03:13:48,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1434745824] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:13:48,807 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 03:13:48,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2022-07-12 03:13:48,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880283106] [2022-07-12 03:13:48,808 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 03:13:48,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 03:13:48,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:13:48,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 03:13:48,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-07-12 03:13:48,809 INFO L87 Difference]: Start difference. First operand 56 states and 76 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 03:13:49,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:13:49,311 INFO L93 Difference]: Finished difference Result 102 states and 138 transitions. [2022-07-12 03:13:49,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 03:13:49,312 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) Word has length 36 [2022-07-12 03:13:49,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:13:49,313 INFO L225 Difference]: With dead ends: 102 [2022-07-12 03:13:49,313 INFO L226 Difference]: Without dead ends: 88 [2022-07-12 03:13:49,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2022-07-12 03:13:49,314 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 103 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 03:13:49,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 639 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 03:13:49,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-12 03:13:49,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 74. [2022-07-12 03:13:49,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 54 states have internal predecessors, (71), 15 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (19), 17 states have call predecessors, (19), 15 states have call successors, (19) [2022-07-12 03:13:49,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 105 transitions. [2022-07-12 03:13:49,328 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 105 transitions. Word has length 36 [2022-07-12 03:13:49,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:13:49,329 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 105 transitions. [2022-07-12 03:13:49,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 03:13:49,329 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 105 transitions. [2022-07-12 03:13:49,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-12 03:13:49,330 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:13:49,330 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2022-07-12 03:13:49,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-12 03:13:49,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:13:49,531 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:13:49,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:13:49,532 INFO L85 PathProgramCache]: Analyzing trace with hash 2045835875, now seen corresponding path program 1 times [2022-07-12 03:13:49,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:13:49,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1591529978] [2022-07-12 03:13:49,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:13:49,532 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:13:49,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:13:49,534 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:13:49,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-12 03:13:49,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:49,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 03:13:49,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:13:49,739 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 03:13:49,740 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:13:49,740 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:13:49,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1591529978] [2022-07-12 03:13:49,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1591529978] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:13:49,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:13:49,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 03:13:49,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864443667] [2022-07-12 03:13:49,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:13:49,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 03:13:49,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:13:49,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 03:13:49,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 03:13:49,742 INFO L87 Difference]: Start difference. First operand 74 states and 105 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-12 03:13:50,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:13:50,076 INFO L93 Difference]: Finished difference Result 127 states and 174 transitions. [2022-07-12 03:13:50,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 03:13:50,076 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2022-07-12 03:13:50,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:13:50,077 INFO L225 Difference]: With dead ends: 127 [2022-07-12 03:13:50,077 INFO L226 Difference]: Without dead ends: 87 [2022-07-12 03:13:50,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-07-12 03:13:50,079 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 56 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:13:50,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 498 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 03:13:50,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-12 03:13:50,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 74. [2022-07-12 03:13:50,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 54 states have internal predecessors, (70), 15 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (19), 17 states have call predecessors, (19), 15 states have call successors, (19) [2022-07-12 03:13:50,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 104 transitions. [2022-07-12 03:13:50,087 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 104 transitions. Word has length 38 [2022-07-12 03:13:50,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:13:50,088 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 104 transitions. [2022-07-12 03:13:50,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-12 03:13:50,088 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 104 transitions. [2022-07-12 03:13:50,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-12 03:13:50,089 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:13:50,089 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2022-07-12 03:13:50,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-12 03:13:50,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:13:50,300 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:13:50,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:13:50,301 INFO L85 PathProgramCache]: Analyzing trace with hash -490349503, now seen corresponding path program 1 times [2022-07-12 03:13:50,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:13:50,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [224027222] [2022-07-12 03:13:50,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:13:50,301 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:13:50,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:13:50,302 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:13:50,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-12 03:13:50,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:50,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 03:13:50,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:13:50,749 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 03:13:50,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:13:50,917 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 03:13:50,917 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:13:50,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [224027222] [2022-07-12 03:13:50,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [224027222] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:13:50,918 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 03:13:50,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2022-07-12 03:13:50,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107850102] [2022-07-12 03:13:50,918 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 03:13:50,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-12 03:13:50,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:13:50,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-12 03:13:50,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-07-12 03:13:50,919 INFO L87 Difference]: Start difference. First operand 74 states and 104 transitions. Second operand has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 15 states have internal predecessors, (39), 5 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2022-07-12 03:13:51,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:13:51,666 INFO L93 Difference]: Finished difference Result 117 states and 162 transitions. [2022-07-12 03:13:51,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 03:13:51,666 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 15 states have internal predecessors, (39), 5 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) Word has length 41 [2022-07-12 03:13:51,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:13:51,667 INFO L225 Difference]: With dead ends: 117 [2022-07-12 03:13:51,668 INFO L226 Difference]: Without dead ends: 115 [2022-07-12 03:13:51,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2022-07-12 03:13:51,668 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 149 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 03:13:51,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 463 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 03:13:51,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-12 03:13:51,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 84. [2022-07-12 03:13:51,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 61 states have (on average 1.278688524590164) internal successors, (78), 61 states have internal predecessors, (78), 18 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (23), 20 states have call predecessors, (23), 18 states have call successors, (23) [2022-07-12 03:13:51,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 119 transitions. [2022-07-12 03:13:51,687 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 119 transitions. Word has length 41 [2022-07-12 03:13:51,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:13:51,687 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 119 transitions. [2022-07-12 03:13:51,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 15 states have internal predecessors, (39), 5 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2022-07-12 03:13:51,687 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 119 transitions. [2022-07-12 03:13:51,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-12 03:13:51,688 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:13:51,693 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2022-07-12 03:13:51,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-12 03:13:51,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:13:51,894 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:13:51,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:13:51,894 INFO L85 PathProgramCache]: Analyzing trace with hash 38675638, now seen corresponding path program 1 times [2022-07-12 03:13:51,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:13:51,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1834083500] [2022-07-12 03:13:51,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:13:51,895 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:13:51,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:13:51,896 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:13:51,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-12 03:13:51,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:51,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 03:13:51,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:13:51,976 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-12 03:13:51,976 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:13:51,976 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:13:51,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1834083500] [2022-07-12 03:13:51,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1834083500] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:13:51,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:13:51,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:13:51,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062582120] [2022-07-12 03:13:51,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:13:51,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:13:51,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:13:51,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:13:51,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:13:51,978 INFO L87 Difference]: Start difference. First operand 84 states and 119 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-12 03:13:51,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:13:51,994 INFO L93 Difference]: Finished difference Result 87 states and 122 transitions. [2022-07-12 03:13:51,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:13:51,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 43 [2022-07-12 03:13:51,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:13:51,997 INFO L225 Difference]: With dead ends: 87 [2022-07-12 03:13:51,997 INFO L226 Difference]: Without dead ends: 85 [2022-07-12 03:13:51,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:13:51,999 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:13:51,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:13:52,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-12 03:13:52,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2022-07-12 03:13:52,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 61 states have (on average 1.278688524590164) internal successors, (78), 61 states have internal predecessors, (78), 18 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (23), 20 states have call predecessors, (23), 18 states have call successors, (23) [2022-07-12 03:13:52,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 119 transitions. [2022-07-12 03:13:52,013 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 119 transitions. Word has length 43 [2022-07-12 03:13:52,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:13:52,013 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 119 transitions. [2022-07-12 03:13:52,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-12 03:13:52,014 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 119 transitions. [2022-07-12 03:13:52,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 03:13:52,015 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:13:52,015 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 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] [2022-07-12 03:13:52,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-12 03:13:52,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:13:52,230 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:13:52,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:13:52,230 INFO L85 PathProgramCache]: Analyzing trace with hash 972082008, now seen corresponding path program 1 times [2022-07-12 03:13:52,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:13:52,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1042540399] [2022-07-12 03:13:52,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:13:52,231 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:13:52,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:13:52,232 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:13:52,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-12 03:13:52,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:52,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 03:13:52,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:13:52,320 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 03:13:52,321 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:13:52,321 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:13:52,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1042540399] [2022-07-12 03:13:52,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1042540399] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:13:52,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:13:52,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:13:52,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192402791] [2022-07-12 03:13:52,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:13:52,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:13:52,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:13:52,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:13:52,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:13:52,323 INFO L87 Difference]: Start difference. First operand 84 states and 119 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 03:13:52,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:13:52,348 INFO L93 Difference]: Finished difference Result 113 states and 159 transitions. [2022-07-12 03:13:52,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:13:52,349 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 46 [2022-07-12 03:13:52,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:13:52,350 INFO L225 Difference]: With dead ends: 113 [2022-07-12 03:13:52,350 INFO L226 Difference]: Without dead ends: 88 [2022-07-12 03:13:52,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:13:52,352 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:13:52,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:13:52,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-12 03:13:52,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-07-12 03:13:52,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 64 states have (on average 1.265625) internal successors, (81), 63 states have internal predecessors, (81), 18 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (28), 22 states have call predecessors, (28), 18 states have call successors, (28) [2022-07-12 03:13:52,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 127 transitions. [2022-07-12 03:13:52,360 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 127 transitions. Word has length 46 [2022-07-12 03:13:52,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:13:52,360 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 127 transitions. [2022-07-12 03:13:52,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 03:13:52,360 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 127 transitions. [2022-07-12 03:13:52,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-12 03:13:52,361 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:13:52,362 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 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] [2022-07-12 03:13:52,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-12 03:13:52,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:13:52,573 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:13:52,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:13:52,574 INFO L85 PathProgramCache]: Analyzing trace with hash 411048800, now seen corresponding path program 1 times [2022-07-12 03:13:52,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:13:52,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1716769788] [2022-07-12 03:13:52,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:13:52,575 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:13:52,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:13:52,576 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:13:52,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-12 03:13:52,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:52,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 03:13:52,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:13:52,653 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 03:13:52,653 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:13:52,653 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:13:52,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1716769788] [2022-07-12 03:13:52,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1716769788] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:13:52,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:13:52,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:13:52,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345015717] [2022-07-12 03:13:52,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:13:52,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:13:52,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:13:52,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:13:52,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:13:52,656 INFO L87 Difference]: Start difference. First operand 88 states and 127 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 03:13:52,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:13:52,696 INFO L93 Difference]: Finished difference Result 117 states and 167 transitions. [2022-07-12 03:13:52,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:13:52,696 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 47 [2022-07-12 03:13:52,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:13:52,697 INFO L225 Difference]: With dead ends: 117 [2022-07-12 03:13:52,698 INFO L226 Difference]: Without dead ends: 92 [2022-07-12 03:13:52,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:13:52,699 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:13:52,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 207 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:13:52,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-12 03:13:52,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2022-07-12 03:13:52,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 64 states have (on average 1.265625) internal successors, (81), 63 states have internal predecessors, (81), 18 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (28), 22 states have call predecessors, (28), 18 states have call successors, (28) [2022-07-12 03:13:52,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 127 transitions. [2022-07-12 03:13:52,706 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 127 transitions. Word has length 47 [2022-07-12 03:13:52,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:13:52,706 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 127 transitions. [2022-07-12 03:13:52,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 03:13:52,707 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 127 transitions. [2022-07-12 03:13:52,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-12 03:13:52,708 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:13:52,708 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 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] [2022-07-12 03:13:52,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-12 03:13:52,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:13:52,919 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:13:52,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:13:52,919 INFO L85 PathProgramCache]: Analyzing trace with hash -877982242, now seen corresponding path program 1 times [2022-07-12 03:13:52,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:13:52,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2026566464] [2022-07-12 03:13:52,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:13:52,920 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:13:52,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:13:52,921 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:13:52,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-12 03:13:52,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:52,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 03:13:52,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:13:53,100 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 03:13:53,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:13:53,181 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:13:53,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2026566464] [2022-07-12 03:13:53,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2026566464] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:13:53,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [824622213] [2022-07-12 03:13:53,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:13:53,182 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 03:13:53,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 03:13:53,187 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-12 03:13:53,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2022-07-12 03:13:53,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:53,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 03:13:53,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:13:53,458 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 03:13:53,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:13:53,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [824622213] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:13:53,477 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 03:13:53,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2022-07-12 03:13:53,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305303224] [2022-07-12 03:13:53,478 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 03:13:53,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 03:13:53,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:13:53,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 03:13:53,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-12 03:13:53,479 INFO L87 Difference]: Start difference. First operand 88 states and 127 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 03:13:53,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:13:53,780 INFO L93 Difference]: Finished difference Result 123 states and 168 transitions. [2022-07-12 03:13:53,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 03:13:53,780 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 48 [2022-07-12 03:13:53,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:13:53,782 INFO L225 Difference]: With dead ends: 123 [2022-07-12 03:13:53,782 INFO L226 Difference]: Without dead ends: 102 [2022-07-12 03:13:53,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-07-12 03:13:53,783 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 68 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:13:53,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 309 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 03:13:53,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-12 03:13:53,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 88. [2022-07-12 03:13:53,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 64 states have (on average 1.25) internal successors, (80), 63 states have internal predecessors, (80), 18 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (28), 22 states have call predecessors, (28), 18 states have call successors, (28) [2022-07-12 03:13:53,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 126 transitions. [2022-07-12 03:13:53,789 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 126 transitions. Word has length 48 [2022-07-12 03:13:53,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:13:53,792 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 126 transitions. [2022-07-12 03:13:53,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 03:13:53,792 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 126 transitions. [2022-07-12 03:13:53,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-12 03:13:53,794 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:13:53,794 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 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] [2022-07-12 03:13:53,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Forceful destruction successful, exit code 0 [2022-07-12 03:13:54,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-12 03:13:54,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:13:54,198 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:13:54,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:13:54,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1899050596, now seen corresponding path program 1 times [2022-07-12 03:13:54,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:13:54,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1809025985] [2022-07-12 03:13:54,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:13:54,199 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:13:54,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:13:54,200 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:13:54,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-12 03:13:54,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:54,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-12 03:13:54,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:13:54,634 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-12 03:13:54,634 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:13:54,634 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:13:54,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1809025985] [2022-07-12 03:13:54,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1809025985] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:13:54,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:13:54,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 03:13:54,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863499099] [2022-07-12 03:13:54,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:13:54,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 03:13:54,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:13:54,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 03:13:54,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-12 03:13:54,636 INFO L87 Difference]: Start difference. First operand 88 states and 126 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-12 03:13:55,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:13:55,195 INFO L93 Difference]: Finished difference Result 137 states and 191 transitions. [2022-07-12 03:13:55,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 03:13:55,196 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 48 [2022-07-12 03:13:55,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:13:55,197 INFO L225 Difference]: With dead ends: 137 [2022-07-12 03:13:55,198 INFO L226 Difference]: Without dead ends: 135 [2022-07-12 03:13:55,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-07-12 03:13:55,198 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 91 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 03:13:55,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 513 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 03:13:55,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-12 03:13:55,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 100. [2022-07-12 03:13:55,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 74 states have (on average 1.2432432432432432) internal successors, (92), 72 states have internal predecessors, (92), 19 states have call successors, (19), 2 states have call predecessors, (19), 5 states have return successors, (34), 25 states have call predecessors, (34), 19 states have call successors, (34) [2022-07-12 03:13:55,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 145 transitions. [2022-07-12 03:13:55,206 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 145 transitions. Word has length 48 [2022-07-12 03:13:55,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:13:55,207 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 145 transitions. [2022-07-12 03:13:55,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-12 03:13:55,207 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 145 transitions. [2022-07-12 03:13:55,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-12 03:13:55,208 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:13:55,208 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 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] [2022-07-12 03:13:55,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-12 03:13:55,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:13:55,419 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:13:55,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:13:55,420 INFO L85 PathProgramCache]: Analyzing trace with hash 505566420, now seen corresponding path program 1 times [2022-07-12 03:13:55,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:13:55,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [428127198] [2022-07-12 03:13:55,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:13:55,420 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:13:55,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:13:55,421 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:13:55,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-12 03:13:55,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:55,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 03:13:55,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:13:55,489 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 03:13:55,489 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:13:55,489 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:13:55,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [428127198] [2022-07-12 03:13:55,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [428127198] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:13:55,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:13:55,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:13:55,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764337084] [2022-07-12 03:13:55,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:13:55,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:13:55,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:13:55,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:13:55,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:13:55,491 INFO L87 Difference]: Start difference. First operand 100 states and 145 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 03:13:55,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:13:55,583 INFO L93 Difference]: Finished difference Result 129 states and 185 transitions. [2022-07-12 03:13:55,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:13:55,583 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2022-07-12 03:13:55,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:13:55,595 INFO L225 Difference]: With dead ends: 129 [2022-07-12 03:13:55,596 INFO L226 Difference]: Without dead ends: 104 [2022-07-12 03:13:55,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:13:55,597 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:13:55,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 207 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:13:55,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-12 03:13:55,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2022-07-12 03:13:55,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 74 states have (on average 1.2432432432432432) internal successors, (92), 72 states have internal predecessors, (92), 19 states have call successors, (19), 2 states have call predecessors, (19), 5 states have return successors, (34), 25 states have call predecessors, (34), 19 states have call successors, (34) [2022-07-12 03:13:55,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 145 transitions. [2022-07-12 03:13:55,604 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 145 transitions. Word has length 48 [2022-07-12 03:13:55,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:13:55,605 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 145 transitions. [2022-07-12 03:13:55,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 03:13:55,605 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 145 transitions. [2022-07-12 03:13:55,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-12 03:13:55,606 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:13:55,606 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1] [2022-07-12 03:13:55,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-12 03:13:55,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:13:55,817 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:13:55,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:13:55,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1437385679, now seen corresponding path program 1 times [2022-07-12 03:13:55,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:13:55,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [510249917] [2022-07-12 03:13:55,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:13:55,818 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:13:55,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:13:55,819 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:13:55,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-12 03:13:55,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:55,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 03:13:55,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:13:56,043 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-12 03:13:56,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:13:56,334 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-12 03:13:56,335 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:13:56,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [510249917] [2022-07-12 03:13:56,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [510249917] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:13:56,335 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 03:13:56,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2022-07-12 03:13:56,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249980565] [2022-07-12 03:13:56,335 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 03:13:56,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 03:13:56,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:13:56,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 03:13:56,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-07-12 03:13:56,336 INFO L87 Difference]: Start difference. First operand 100 states and 145 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 5 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-12 03:13:56,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:13:56,657 INFO L93 Difference]: Finished difference Result 122 states and 170 transitions. [2022-07-12 03:13:56,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 03:13:56,658 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 5 states have call predecessors, (8), 2 states have call successors, (8) Word has length 48 [2022-07-12 03:13:56,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:13:56,659 INFO L225 Difference]: With dead ends: 122 [2022-07-12 03:13:56,659 INFO L226 Difference]: Without dead ends: 99 [2022-07-12 03:13:56,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2022-07-12 03:13:56,660 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 86 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:13:56,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 443 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 03:13:56,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-12 03:13:56,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2022-07-12 03:13:56,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 69 states have internal predecessors, (85), 19 states have call successors, (19), 2 states have call predecessors, (19), 5 states have return successors, (33), 23 states have call predecessors, (33), 19 states have call successors, (33) [2022-07-12 03:13:56,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2022-07-12 03:13:56,667 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 48 [2022-07-12 03:13:56,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:13:56,667 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2022-07-12 03:13:56,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 5 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-12 03:13:56,668 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2022-07-12 03:13:56,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-12 03:13:56,668 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:13:56,669 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1] [2022-07-12 03:13:56,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-12 03:13:56,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:13:56,881 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:13:56,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:13:56,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1803392071, now seen corresponding path program 1 times [2022-07-12 03:13:56,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:13:56,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1220343032] [2022-07-12 03:13:56,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:13:56,882 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:13:56,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:13:56,883 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:13:56,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-12 03:13:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:56,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 03:13:56,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:13:57,069 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-12 03:13:57,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:13:57,269 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-12 03:13:57,270 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:13:57,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1220343032] [2022-07-12 03:13:57,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1220343032] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:13:57,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 03:13:57,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2022-07-12 03:13:57,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271719151] [2022-07-12 03:13:57,270 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 03:13:57,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 03:13:57,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:13:57,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 03:13:57,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-07-12 03:13:57,271 INFO L87 Difference]: Start difference. First operand 95 states and 137 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-12 03:13:58,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:13:58,018 INFO L93 Difference]: Finished difference Result 133 states and 178 transitions. [2022-07-12 03:13:58,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 03:13:58,019 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) Word has length 48 [2022-07-12 03:13:58,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:13:58,019 INFO L225 Difference]: With dead ends: 133 [2022-07-12 03:13:58,020 INFO L226 Difference]: Without dead ends: 89 [2022-07-12 03:13:58,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2022-07-12 03:13:58,021 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 48 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 03:13:58,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 530 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 03:13:58,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-12 03:13:58,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2022-07-12 03:13:58,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 63 states have internal predecessors, (76), 16 states have call successors, (16), 2 states have call predecessors, (16), 5 states have return successors, (27), 20 states have call predecessors, (27), 16 states have call successors, (27) [2022-07-12 03:13:58,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 119 transitions. [2022-07-12 03:13:58,030 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 119 transitions. Word has length 48 [2022-07-12 03:13:58,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:13:58,030 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 119 transitions. [2022-07-12 03:13:58,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-12 03:13:58,030 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 119 transitions. [2022-07-12 03:13:58,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-12 03:13:58,031 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:13:58,031 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1] [2022-07-12 03:13:58,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2022-07-12 03:13:58,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:13:58,241 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:13:58,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:13:58,242 INFO L85 PathProgramCache]: Analyzing trace with hash -495361713, now seen corresponding path program 1 times [2022-07-12 03:13:58,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:13:58,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1124075150] [2022-07-12 03:13:58,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:13:58,242 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:13:58,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:13:58,243 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:13:58,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-12 03:13:58,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:58,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 03:13:58,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:13:58,459 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 03:13:58,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:13:58,620 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-12 03:13:58,621 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:13:58,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1124075150] [2022-07-12 03:13:58,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1124075150] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:13:58,621 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 03:13:58,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2022-07-12 03:13:58,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407720724] [2022-07-12 03:13:58,621 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 03:13:58,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 03:13:58,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:13:58,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 03:13:58,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-07-12 03:13:58,622 INFO L87 Difference]: Start difference. First operand 86 states and 119 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-12 03:13:58,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:13:58,851 INFO L93 Difference]: Finished difference Result 101 states and 133 transitions. [2022-07-12 03:13:58,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 03:13:58,852 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) Word has length 48 [2022-07-12 03:13:58,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:13:58,853 INFO L225 Difference]: With dead ends: 101 [2022-07-12 03:13:58,853 INFO L226 Difference]: Without dead ends: 82 [2022-07-12 03:13:58,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-07-12 03:13:58,854 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 48 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:13:58,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 503 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 03:13:58,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-12 03:13:58,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 74. [2022-07-12 03:13:58,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 55 states have internal predecessors, (63), 13 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (24), 16 states have call predecessors, (24), 13 states have call successors, (24) [2022-07-12 03:13:58,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 100 transitions. [2022-07-12 03:13:58,859 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 100 transitions. Word has length 48 [2022-07-12 03:13:58,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:13:58,859 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 100 transitions. [2022-07-12 03:13:58,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-12 03:13:58,859 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 100 transitions. [2022-07-12 03:13:58,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-12 03:13:58,860 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:13:58,860 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 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] [2022-07-12 03:13:58,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-12 03:13:59,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:13:59,070 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:13:59,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:13:59,071 INFO L85 PathProgramCache]: Analyzing trace with hash 113915812, now seen corresponding path program 1 times [2022-07-12 03:13:59,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:13:59,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [161155320] [2022-07-12 03:13:59,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:13:59,071 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:13:59,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:13:59,073 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:13:59,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-12 03:13:59,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:59,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 03:13:59,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:13:59,565 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-12 03:13:59,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:13:59,740 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-12 03:13:59,740 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:13:59,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [161155320] [2022-07-12 03:13:59,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [161155320] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:13:59,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 03:13:59,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2022-07-12 03:13:59,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451241239] [2022-07-12 03:13:59,741 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 03:13:59,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-12 03:13:59,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:13:59,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-12 03:13:59,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2022-07-12 03:13:59,742 INFO L87 Difference]: Start difference. First operand 74 states and 100 transitions. Second operand has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 17 states have internal predecessors, (44), 5 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-12 03:14:00,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:14:00,098 INFO L93 Difference]: Finished difference Result 84 states and 111 transitions. [2022-07-12 03:14:00,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 03:14:00,099 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 17 states have internal predecessors, (44), 5 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) Word has length 49 [2022-07-12 03:14:00,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:14:00,099 INFO L225 Difference]: With dead ends: 84 [2022-07-12 03:14:00,099 INFO L226 Difference]: Without dead ends: 72 [2022-07-12 03:14:00,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=495, Unknown=0, NotChecked=0, Total=650 [2022-07-12 03:14:00,100 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 81 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:14:00,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 309 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 03:14:00,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-12 03:14:00,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2022-07-12 03:14:00,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.16) internal successors, (58), 51 states have internal predecessors, (58), 13 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (20), 15 states have call predecessors, (20), 13 states have call successors, (20) [2022-07-12 03:14:00,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2022-07-12 03:14:00,105 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 49 [2022-07-12 03:14:00,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:14:00,105 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2022-07-12 03:14:00,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 17 states have internal predecessors, (44), 5 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-12 03:14:00,105 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2022-07-12 03:14:00,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-12 03:14:00,106 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:14:00,106 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 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] [2022-07-12 03:14:00,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-12 03:14:00,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:14:00,312 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:14:00,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:14:00,312 INFO L85 PathProgramCache]: Analyzing trace with hash -552676772, now seen corresponding path program 1 times [2022-07-12 03:14:00,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:14:00,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1487650368] [2022-07-12 03:14:00,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:14:00,312 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:14:00,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:14:00,314 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:14:00,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-12 03:14:00,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:00,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 03:14:00,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:14:00,383 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 03:14:00,383 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:14:00,383 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:14:00,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1487650368] [2022-07-12 03:14:00,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1487650368] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:14:00,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:14:00,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:14:00,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27500743] [2022-07-12 03:14:00,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:14:00,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:14:00,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:14:00,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:14:00,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:14:00,385 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 03:14:00,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:14:00,406 INFO L93 Difference]: Finished difference Result 96 states and 121 transitions. [2022-07-12 03:14:00,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:14:00,407 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 49 [2022-07-12 03:14:00,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:14:00,407 INFO L225 Difference]: With dead ends: 96 [2022-07-12 03:14:00,407 INFO L226 Difference]: Without dead ends: 70 [2022-07-12 03:14:00,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:14:00,408 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:14:00,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:14:00,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-12 03:14:00,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2022-07-12 03:14:00,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 49 states have (on average 1.163265306122449) internal successors, (57), 49 states have internal predecessors, (57), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (16), 15 states have call predecessors, (16), 13 states have call successors, (16) [2022-07-12 03:14:00,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 86 transitions. [2022-07-12 03:14:00,413 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 86 transitions. Word has length 49 [2022-07-12 03:14:00,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:14:00,413 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 86 transitions. [2022-07-12 03:14:00,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 03:14:00,413 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2022-07-12 03:14:00,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-12 03:14:00,414 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:14:00,414 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 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] [2022-07-12 03:14:00,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-12 03:14:00,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:14:00,627 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:14:00,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:14:00,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1549749125, now seen corresponding path program 1 times [2022-07-12 03:14:00,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:14:00,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2053509584] [2022-07-12 03:14:00,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:14:00,632 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:14:00,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:14:00,634 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:14:00,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-12 03:14:00,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:00,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 03:14:00,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:14:01,062 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 03:14:01,062 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:14:01,062 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:14:01,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2053509584] [2022-07-12 03:14:01,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2053509584] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:14:01,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:14:01,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-12 03:14:01,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831574882] [2022-07-12 03:14:01,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:14:01,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 03:14:01,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:14:01,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 03:14:01,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-07-12 03:14:01,066 INFO L87 Difference]: Start difference. First operand 67 states and 86 transitions. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-12 03:14:01,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:14:01,682 INFO L93 Difference]: Finished difference Result 90 states and 116 transitions. [2022-07-12 03:14:01,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 03:14:01,682 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 49 [2022-07-12 03:14:01,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:14:01,683 INFO L225 Difference]: With dead ends: 90 [2022-07-12 03:14:01,683 INFO L226 Difference]: Without dead ends: 69 [2022-07-12 03:14:01,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2022-07-12 03:14:01,684 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 42 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 03:14:01,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 585 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 400 Invalid, 0 Unknown, 36 Unchecked, 0.4s Time] [2022-07-12 03:14:01,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-12 03:14:01,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 49. [2022-07-12 03:14:01,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 36 states have internal predecessors, (44), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-07-12 03:14:01,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2022-07-12 03:14:01,688 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 49 [2022-07-12 03:14:01,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:14:01,688 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2022-07-12 03:14:01,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-12 03:14:01,688 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2022-07-12 03:14:01,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-12 03:14:01,689 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:14:01,689 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:14:01,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-12 03:14:01,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:14:01,900 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:14:01,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:14:01,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1451512262, now seen corresponding path program 1 times [2022-07-12 03:14:01,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:14:01,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [85928337] [2022-07-12 03:14:01,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:14:01,901 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:14:01,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:14:01,902 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:14:01,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-12 03:14:01,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:01,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-12 03:14:01,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:14:02,298 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 27 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-12 03:14:02,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:14:03,114 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-12 03:14:03,115 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:14:03,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [85928337] [2022-07-12 03:14:03,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [85928337] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:14:03,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 03:14:03,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2022-07-12 03:14:03,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160415694] [2022-07-12 03:14:03,115 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 03:14:03,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-12 03:14:03,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:14:03,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-12 03:14:03,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2022-07-12 03:14:03,117 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 4 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-12 03:14:03,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:14:03,872 INFO L93 Difference]: Finished difference Result 88 states and 111 transitions. [2022-07-12 03:14:03,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 03:14:03,873 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 4 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 55 [2022-07-12 03:14:03,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:14:03,874 INFO L225 Difference]: With dead ends: 88 [2022-07-12 03:14:03,874 INFO L226 Difference]: Without dead ends: 55 [2022-07-12 03:14:03,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=161, Invalid=709, Unknown=0, NotChecked=0, Total=870 [2022-07-12 03:14:03,875 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 131 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 03:14:03,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 261 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 307 Invalid, 0 Unknown, 24 Unchecked, 0.4s Time] [2022-07-12 03:14:03,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-12 03:14:03,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 48. [2022-07-12 03:14:03,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-07-12 03:14:03,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2022-07-12 03:14:03,879 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 55 [2022-07-12 03:14:03,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:14:03,879 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2022-07-12 03:14:03,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 4 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-12 03:14:03,879 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2022-07-12 03:14:03,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-12 03:14:03,880 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:14:03,880 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2022-07-12 03:14:03,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-07-12 03:14:04,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:14:04,090 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:14:04,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:14:04,090 INFO L85 PathProgramCache]: Analyzing trace with hash 2059347801, now seen corresponding path program 1 times [2022-07-12 03:14:04,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:14:04,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1823866256] [2022-07-12 03:14:04,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:14:04,091 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:14:04,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:14:04,092 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:14:04,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-12 03:14:04,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:04,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 03:14:04,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:14:04,269 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-12 03:14:04,269 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:14:04,269 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:14:04,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1823866256] [2022-07-12 03:14:04,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1823866256] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:14:04,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:14:04,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 03:14:04,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622890575] [2022-07-12 03:14:04,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:14:04,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 03:14:04,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:14:04,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 03:14:04,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:14:04,271 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-12 03:14:04,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:14:04,397 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2022-07-12 03:14:04,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 03:14:04,397 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 62 [2022-07-12 03:14:04,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:14:04,398 INFO L225 Difference]: With dead ends: 65 [2022-07-12 03:14:04,398 INFO L226 Difference]: Without dead ends: 48 [2022-07-12 03:14:04,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-12 03:14:04,398 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 15 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:14:04,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 226 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:14:04,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-07-12 03:14:04,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-07-12 03:14:04,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-07-12 03:14:04,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2022-07-12 03:14:04,401 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 62 [2022-07-12 03:14:04,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:14:04,402 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2022-07-12 03:14:04,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-12 03:14:04,402 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2022-07-12 03:14:04,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-12 03:14:04,402 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:14:04,403 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2022-07-12 03:14:04,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Ended with exit code 0 [2022-07-12 03:14:04,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:14:04,607 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:14:04,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:14:04,608 INFO L85 PathProgramCache]: Analyzing trace with hash 253909467, now seen corresponding path program 1 times [2022-07-12 03:14:04,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:14:04,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1676301107] [2022-07-12 03:14:04,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:14:04,609 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:14:04,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:14:04,610 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:14:04,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-07-12 03:14:04,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:04,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-12 03:14:04,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:14:04,821 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 03:14:04,821 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:14:04,821 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:14:04,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1676301107] [2022-07-12 03:14:04,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1676301107] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:14:04,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:14:04,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 03:14:04,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361048879] [2022-07-12 03:14:04,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:14:04,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 03:14:04,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:14:04,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 03:14:04,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-12 03:14:04,823 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-12 03:14:05,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:14:05,168 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2022-07-12 03:14:05,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 03:14:05,169 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 62 [2022-07-12 03:14:05,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:14:05,169 INFO L225 Difference]: With dead ends: 69 [2022-07-12 03:14:05,169 INFO L226 Difference]: Without dead ends: 50 [2022-07-12 03:14:05,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-07-12 03:14:05,170 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 38 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 03:14:05,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 251 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 03:14:05,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-12 03:14:05,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-07-12 03:14:05,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 37 states have (on average 1.135135135135135) internal successors, (42), 38 states have internal predecessors, (42), 8 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2022-07-12 03:14:05,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2022-07-12 03:14:05,173 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 62 [2022-07-12 03:14:05,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:14:05,173 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2022-07-12 03:14:05,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-12 03:14:05,173 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2022-07-12 03:14:05,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-12 03:14:05,174 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:14:05,174 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:14:05,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Ended with exit code 0 [2022-07-12 03:14:05,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:14:05,384 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:14:05,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:14:05,384 INFO L85 PathProgramCache]: Analyzing trace with hash 647887735, now seen corresponding path program 1 times [2022-07-12 03:14:05,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:14:05,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [667688373] [2022-07-12 03:14:05,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:14:05,384 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:14:05,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:14:05,385 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:14:05,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-07-12 03:14:05,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:05,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-12 03:14:05,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:14:05,617 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 03:14:05,618 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:14:05,618 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:14:05,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [667688373] [2022-07-12 03:14:05,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [667688373] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:14:05,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:14:05,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 03:14:05,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386904150] [2022-07-12 03:14:05,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:14:05,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 03:14:05,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:14:05,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 03:14:05,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-12 03:14:05,620 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-12 03:14:06,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:14:06,047 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2022-07-12 03:14:06,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 03:14:06,048 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 63 [2022-07-12 03:14:06,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:14:06,053 INFO L225 Difference]: With dead ends: 71 [2022-07-12 03:14:06,053 INFO L226 Difference]: Without dead ends: 52 [2022-07-12 03:14:06,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-07-12 03:14:06,054 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 35 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:14:06,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 257 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 24 Unchecked, 0.2s Time] [2022-07-12 03:14:06,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-07-12 03:14:06,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2022-07-12 03:14:06,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 37 states have (on average 1.135135135135135) internal successors, (42), 38 states have internal predecessors, (42), 8 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2022-07-12 03:14:06,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2022-07-12 03:14:06,057 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 63 [2022-07-12 03:14:06,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:14:06,058 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2022-07-12 03:14:06,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-12 03:14:06,058 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2022-07-12 03:14:06,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-12 03:14:06,059 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:14:06,059 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:14:06,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-07-12 03:14:06,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:14:06,263 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:14:06,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:14:06,264 INFO L85 PathProgramCache]: Analyzing trace with hash -589254976, now seen corresponding path program 1 times [2022-07-12 03:14:06,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:14:06,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1328000506] [2022-07-12 03:14:06,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:14:06,265 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:14:06,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:14:06,266 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:14:06,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-07-12 03:14:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:06,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 03:14:06,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:14:06,690 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-07-12 03:14:06,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:14:06,925 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-07-12 03:14:06,925 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:14:06,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1328000506] [2022-07-12 03:14:06,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1328000506] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:14:06,926 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 03:14:06,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2022-07-12 03:14:06,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566326285] [2022-07-12 03:14:06,926 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 03:14:06,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 03:14:06,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:14:06,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 03:14:06,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-07-12 03:14:06,927 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 15 states, 13 states have (on average 4.0) internal successors, (52), 15 states have internal predecessors, (52), 7 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 7 states have call successors, (13) [2022-07-12 03:14:07,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:14:07,331 INFO L93 Difference]: Finished difference Result 84 states and 101 transitions. [2022-07-12 03:14:07,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 03:14:07,335 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.0) internal successors, (52), 15 states have internal predecessors, (52), 7 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 7 states have call successors, (13) Word has length 63 [2022-07-12 03:14:07,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:14:07,336 INFO L225 Difference]: With dead ends: 84 [2022-07-12 03:14:07,336 INFO L226 Difference]: Without dead ends: 71 [2022-07-12 03:14:07,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-07-12 03:14:07,337 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 72 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 03:14:07,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 519 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 03:14:07,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-07-12 03:14:07,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 54. [2022-07-12 03:14:07,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 41 states have internal predecessors, (44), 9 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (13), 10 states have call predecessors, (13), 9 states have call successors, (13) [2022-07-12 03:14:07,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2022-07-12 03:14:07,341 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 63 [2022-07-12 03:14:07,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:14:07,341 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2022-07-12 03:14:07,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.0) internal successors, (52), 15 states have internal predecessors, (52), 7 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 7 states have call successors, (13) [2022-07-12 03:14:07,341 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2022-07-12 03:14:07,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-12 03:14:07,342 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:14:07,342 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:14:07,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-07-12 03:14:07,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:14:07,553 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:14:07,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:14:07,554 INFO L85 PathProgramCache]: Analyzing trace with hash -472199073, now seen corresponding path program 1 times [2022-07-12 03:14:07,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:14:07,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [585814478] [2022-07-12 03:14:07,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:14:07,554 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:14:07,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:14:07,556 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:14:07,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-07-12 03:14:07,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:07,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-12 03:14:07,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:14:07,792 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 03:14:07,792 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:14:07,793 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:14:07,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [585814478] [2022-07-12 03:14:07,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [585814478] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:14:07,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:14:07,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 03:14:07,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333630482] [2022-07-12 03:14:07,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:14:07,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 03:14:07,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:14:07,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 03:14:07,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-12 03:14:07,794 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-12 03:14:08,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:14:08,248 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2022-07-12 03:14:08,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 03:14:08,249 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 64 [2022-07-12 03:14:08,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:14:08,249 INFO L225 Difference]: With dead ends: 75 [2022-07-12 03:14:08,249 INFO L226 Difference]: Without dead ends: 56 [2022-07-12 03:14:08,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-07-12 03:14:08,250 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 34 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 03:14:08,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 257 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 24 Unchecked, 0.3s Time] [2022-07-12 03:14:08,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-12 03:14:08,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2022-07-12 03:14:08,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 41 states have internal predecessors, (44), 9 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (13), 10 states have call predecessors, (13), 9 states have call successors, (13) [2022-07-12 03:14:08,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2022-07-12 03:14:08,254 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 64 [2022-07-12 03:14:08,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:14:08,254 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2022-07-12 03:14:08,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-12 03:14:08,254 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2022-07-12 03:14:08,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-12 03:14:08,255 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:14:08,255 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:14:08,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-07-12 03:14:08,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:14:08,466 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:14:08,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:14:08,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1512938488, now seen corresponding path program 1 times [2022-07-12 03:14:08,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:14:08,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [24048192] [2022-07-12 03:14:08,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:14:08,466 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:14:08,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:14:08,468 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:14:08,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-07-12 03:14:08,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:08,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 03:14:08,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:14:08,826 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-07-12 03:14:08,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:14:08,966 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-07-12 03:14:08,967 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:14:08,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [24048192] [2022-07-12 03:14:08,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [24048192] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:14:08,967 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 03:14:08,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2022-07-12 03:14:08,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590570441] [2022-07-12 03:14:08,967 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 03:14:08,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 03:14:08,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:14:08,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 03:14:08,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2022-07-12 03:14:08,968 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 13 states have internal predecessors, (50), 6 states have call successors, (13), 1 states have call predecessors, (13), 3 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2022-07-12 03:14:09,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:14:09,520 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2022-07-12 03:14:09,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 03:14:09,520 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 13 states have internal predecessors, (50), 6 states have call successors, (13), 1 states have call predecessors, (13), 3 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) Word has length 64 [2022-07-12 03:14:09,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:14:09,521 INFO L225 Difference]: With dead ends: 68 [2022-07-12 03:14:09,521 INFO L226 Difference]: Without dead ends: 55 [2022-07-12 03:14:09,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2022-07-12 03:14:09,522 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 112 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 03:14:09,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 229 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 03:14:09,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-12 03:14:09,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2022-07-12 03:14:09,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 8 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-07-12 03:14:09,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2022-07-12 03:14:09,525 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 64 [2022-07-12 03:14:09,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:14:09,525 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2022-07-12 03:14:09,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 13 states have internal predecessors, (50), 6 states have call successors, (13), 1 states have call predecessors, (13), 3 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2022-07-12 03:14:09,526 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2022-07-12 03:14:09,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-12 03:14:09,526 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:14:09,527 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:14:09,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2022-07-12 03:14:09,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:14:09,738 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:14:09,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:14:09,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1283662981, now seen corresponding path program 1 times [2022-07-12 03:14:09,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:14:09,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1547160039] [2022-07-12 03:14:09,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:14:09,739 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:14:09,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:14:09,740 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:14:09,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-07-12 03:14:09,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:09,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-12 03:14:09,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:14:09,948 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 03:14:09,948 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:14:09,948 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:14:09,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1547160039] [2022-07-12 03:14:09,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1547160039] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:14:09,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:14:09,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 03:14:09,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847003096] [2022-07-12 03:14:09,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:14:09,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 03:14:09,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:14:09,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 03:14:09,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-12 03:14:09,950 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-12 03:14:10,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:14:10,282 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2022-07-12 03:14:10,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 03:14:10,282 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 65 [2022-07-12 03:14:10,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:14:10,283 INFO L225 Difference]: With dead ends: 68 [2022-07-12 03:14:10,283 INFO L226 Difference]: Without dead ends: 49 [2022-07-12 03:14:10,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-07-12 03:14:10,284 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 32 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:14:10,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 249 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 03:14:10,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-12 03:14:10,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2022-07-12 03:14:10,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-12 03:14:10,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2022-07-12 03:14:10,287 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 65 [2022-07-12 03:14:10,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:14:10,287 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2022-07-12 03:14:10,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-12 03:14:10,287 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-07-12 03:14:10,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-12 03:14:10,292 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:14:10,292 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:14:10,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-07-12 03:14:10,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:14:10,503 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:14:10,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:14:10,503 INFO L85 PathProgramCache]: Analyzing trace with hash -322048964, now seen corresponding path program 1 times [2022-07-12 03:14:10,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:14:10,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1768490706] [2022-07-12 03:14:10,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:14:10,504 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:14:10,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:14:10,505 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:14:10,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-07-12 03:14:10,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:10,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 03:14:10,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:14:10,581 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 03:14:10,581 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:14:10,581 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:14:10,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1768490706] [2022-07-12 03:14:10,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1768490706] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:14:10,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:14:10,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:14:10,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719883299] [2022-07-12 03:14:10,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:14:10,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:14:10,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:14:10,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:14:10,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:14:10,583 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-12 03:14:10,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:14:10,593 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2022-07-12 03:14:10,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:14:10,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 65 [2022-07-12 03:14:10,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:14:10,594 INFO L225 Difference]: With dead ends: 50 [2022-07-12 03:14:10,594 INFO L226 Difference]: Without dead ends: 0 [2022-07-12 03:14:10,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:14:10,595 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:14:10,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:14:10,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-12 03:14:10,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-12 03:14:10,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:14:10,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-12 03:14:10,596 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2022-07-12 03:14:10,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:14:10,597 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-12 03:14:10,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-12 03:14:10,597 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-12 03:14:10,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-12 03:14:10,599 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-07-12 03:14:10,600 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-07-12 03:14:10,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2022-07-12 03:14:10,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:14:10,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-12 03:14:11,524 INFO L899 garLoopResultBuilder]: For program point isnan_floatFINAL(line 57) no Hoare annotation was computed. [2022-07-12 03:14:11,525 INFO L902 garLoopResultBuilder]: At program point isnan_floatENTRY(line 57) the Hoare annotation is: true [2022-07-12 03:14:11,525 INFO L899 garLoopResultBuilder]: For program point isnan_floatEXIT(line 57) no Hoare annotation was computed. [2022-07-12 03:14:11,525 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 82) no Hoare annotation was computed. [2022-07-12 03:14:11,525 INFO L895 garLoopResultBuilder]: At program point L81(line 81) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_fmax_float_~y#1| |ULTIMATE.start_main_~y~0#1|))) (or (and .cse0 (not (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|))) (and (= |ULTIMATE.start_fmax_float_#res#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~res~0#1| |ULTIMATE.start_main_~x~0#1|) .cse0 (= |ULTIMATE.start_fmax_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (not (fp.eq |ULTIMATE.start_fmax_float_~y#1| |ULTIMATE.start_fmax_float_~y#1|))))) [2022-07-12 03:14:11,525 INFO L899 garLoopResultBuilder]: For program point L81-1(line 81) no Hoare annotation was computed. [2022-07-12 03:14:11,525 INFO L899 garLoopResultBuilder]: For program point L81-2(line 81) no Hoare annotation was computed. [2022-07-12 03:14:11,525 INFO L895 garLoopResultBuilder]: At program point L81-3(line 81) the Hoare annotation is: (and (= |ULTIMATE.start_fmax_float_#res#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~res~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_fmax_float_~y#1| |ULTIMATE.start_main_~y~0#1|) (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_fmax_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (not (fp.eq |ULTIMATE.start_fmax_float_~y#1| |ULTIMATE.start_fmax_float_~y#1|))) [2022-07-12 03:14:11,526 INFO L899 garLoopResultBuilder]: For program point L81-4(line 81) no Hoare annotation was computed. [2022-07-12 03:14:11,526 INFO L899 garLoopResultBuilder]: For program point L81-6(lines 81 84) no Hoare annotation was computed. [2022-07-12 03:14:11,526 INFO L902 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: true [2022-07-12 03:14:11,526 INFO L899 garLoopResultBuilder]: For program point L69-1(line 69) no Hoare annotation was computed. [2022-07-12 03:14:11,526 INFO L899 garLoopResultBuilder]: For program point L69-2(line 69) no Hoare annotation was computed. [2022-07-12 03:14:11,526 INFO L895 garLoopResultBuilder]: At program point L69-3(line 69) the Hoare annotation is: (and (= |ULTIMATE.start_main_#t~ret10#1| (_ bv1 32)) |ULTIMATE.start_main_#t~short12#1| (not (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|))) [2022-07-12 03:14:11,526 INFO L899 garLoopResultBuilder]: For program point L69-4(line 69) no Hoare annotation was computed. [2022-07-12 03:14:11,526 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-12 03:14:11,526 INFO L899 garLoopResultBuilder]: For program point L69-6(line 69) no Hoare annotation was computed. [2022-07-12 03:14:11,526 INFO L899 garLoopResultBuilder]: For program point L69-7(lines 69 70) no Hoare annotation was computed. [2022-07-12 03:14:11,526 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-12 03:14:11,527 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-12 03:14:11,527 INFO L899 garLoopResultBuilder]: For program point L69-9(lines 69 85) no Hoare annotation was computed. [2022-07-12 03:14:11,527 INFO L899 garLoopResultBuilder]: For program point L69-11(lines 69 85) no Hoare annotation was computed. [2022-07-12 03:14:11,527 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 76) no Hoare annotation was computed. [2022-07-12 03:14:11,527 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2022-07-12 03:14:11,527 INFO L899 garLoopResultBuilder]: For program point L53-2(line 53) no Hoare annotation was computed. [2022-07-12 03:14:11,527 INFO L895 garLoopResultBuilder]: At program point L53-3(lines 45 54) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_fmax_float_~y#1| |ULTIMATE.start_main_~y~0#1|)) (.cse1 (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|))) (or (and .cse0 (not (fp.eq |ULTIMATE.start_fmax_float_~x#1| |ULTIMATE.start_fmax_float_~x#1|)) (not .cse1) (= |ULTIMATE.start_fmax_float_#res#1| |ULTIMATE.start_main_~y~0#1|) (fp.eq |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (and (= |ULTIMATE.start_fmax_float_#res#1| |ULTIMATE.start_main_~x~0#1|) .cse0 .cse1 (= |ULTIMATE.start_fmax_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (not (fp.eq |ULTIMATE.start_fmax_float_~y#1| |ULTIMATE.start_fmax_float_~y#1|))))) [2022-07-12 03:14:11,528 INFO L899 garLoopResultBuilder]: For program point L82(line 82) no Hoare annotation was computed. [2022-07-12 03:14:11,528 INFO L895 garLoopResultBuilder]: At program point L70(line 70) the Hoare annotation is: (let ((.cse0 (not |ULTIMATE.start_main_#t~short12#1|)) (.cse1 (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse2 (not |ULTIMATE.start_main_#t~short16#1|))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ret10#1| (_ bv1 32)) (= |ULTIMATE.start_main_#t~ret11#1| (_ bv1 32)) (not (fp.eq |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (not .cse1) .cse2) (and .cse0 (= |ULTIMATE.start_main_#t~ret10#1| (_ bv0 32)) .cse1 .cse2))) [2022-07-12 03:14:11,528 INFO L899 garLoopResultBuilder]: For program point L70-1(line 70) no Hoare annotation was computed. [2022-07-12 03:14:11,528 INFO L899 garLoopResultBuilder]: For program point L70-2(line 70) no Hoare annotation was computed. [2022-07-12 03:14:11,528 INFO L895 garLoopResultBuilder]: At program point L70-3(line 70) the Hoare annotation is: (and (not |ULTIMATE.start_main_#t~short12#1|) |ULTIMATE.start_main_#t~short15#1| (= |ULTIMATE.start_main_#t~ret13#1| (_ bv0 32)) (= |ULTIMATE.start_main_#t~ret10#1| (_ bv0 32)) (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|) (not |ULTIMATE.start_main_#t~short16#1|)) [2022-07-12 03:14:11,528 INFO L899 garLoopResultBuilder]: For program point L70-4(line 70) no Hoare annotation was computed. [2022-07-12 03:14:11,528 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-12 03:14:11,529 INFO L899 garLoopResultBuilder]: For program point L70-6(line 70) no Hoare annotation was computed. [2022-07-12 03:14:11,529 INFO L902 garLoopResultBuilder]: At program point L87(lines 59 88) the Hoare annotation is: true [2022-07-12 03:14:11,529 INFO L895 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_fmax_float_~y#1| |ULTIMATE.start_main_~y~0#1|)) (.cse1 (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse2 (fp.eq |ULTIMATE.start_fmax_float_~y#1| |ULTIMATE.start_fmax_float_~y#1|))) (or (and .cse0 (not (fp.eq |ULTIMATE.start_fmax_float_~x#1| |ULTIMATE.start_fmax_float_~x#1|)) (not .cse1) .cse2) (and .cse0 .cse1 (= |ULTIMATE.start_fmax_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (not .cse2)))) [2022-07-12 03:14:11,529 INFO L899 garLoopResultBuilder]: For program point L50-1(lines 50 52) no Hoare annotation was computed. [2022-07-12 03:14:11,529 INFO L895 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_fmax_float_~y#1| |ULTIMATE.start_main_~y~0#1|)) (.cse1 (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse2 (fp.eq |ULTIMATE.start_fmax_float_~y#1| |ULTIMATE.start_fmax_float_~y#1|))) (or (and .cse0 (not (fp.eq |ULTIMATE.start_fmax_float_~x#1| |ULTIMATE.start_fmax_float_~x#1|)) (not .cse1) .cse2) (and .cse0 .cse1 (= |ULTIMATE.start_fmax_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (not .cse2)))) [2022-07-12 03:14:11,529 INFO L899 garLoopResultBuilder]: For program point L46-1(lines 46 48) no Hoare annotation was computed. [2022-07-12 03:14:11,529 INFO L895 garLoopResultBuilder]: At program point L75(line 75) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_fmax_float_~y#1| |ULTIMATE.start_main_~y~0#1|)) (.cse1 (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|))) (or (and (= |ULTIMATE.start_fmax_float_#res#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~res~0#1| |ULTIMATE.start_main_~x~0#1|) .cse0 .cse1 (= |ULTIMATE.start_fmax_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (not (fp.eq |ULTIMATE.start_fmax_float_~y#1| |ULTIMATE.start_fmax_float_~y#1|))) (and .cse0 (not (fp.eq |ULTIMATE.start_fmax_float_~x#1| |ULTIMATE.start_fmax_float_~x#1|)) (= |ULTIMATE.start_main_~res~0#1| |ULTIMATE.start_main_~y~0#1|) (not .cse1) (= |ULTIMATE.start_fmax_float_#res#1| |ULTIMATE.start_main_~y~0#1|) (fp.eq |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))) [2022-07-12 03:14:11,530 INFO L899 garLoopResultBuilder]: For program point L75-1(line 75) no Hoare annotation was computed. [2022-07-12 03:14:11,530 INFO L899 garLoopResultBuilder]: For program point L75-2(line 75) no Hoare annotation was computed. [2022-07-12 03:14:11,530 INFO L895 garLoopResultBuilder]: At program point L75-3(line 75) the Hoare annotation is: (and |ULTIMATE.start_main_#t~short20#1| (= |ULTIMATE.start_fmax_float_~y#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~res~0#1| |ULTIMATE.start_main_~y~0#1|) (not (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|)) (= |ULTIMATE.start_fmax_float_#res#1| |ULTIMATE.start_main_~y~0#1|) (fp.eq |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) [2022-07-12 03:14:11,530 INFO L899 garLoopResultBuilder]: For program point L75-4(line 75) no Hoare annotation was computed. [2022-07-12 03:14:11,530 INFO L899 garLoopResultBuilder]: For program point L75-6(lines 75 78) no Hoare annotation was computed. [2022-07-12 03:14:11,530 INFO L899 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2022-07-12 03:14:11,530 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 42) no Hoare annotation was computed. [2022-07-12 03:14:11,531 INFO L899 garLoopResultBuilder]: For program point __fpclassify_floatFINAL(lines 22 43) no Hoare annotation was computed. [2022-07-12 03:14:11,531 INFO L899 garLoopResultBuilder]: For program point L25-1(lines 25 29) no Hoare annotation was computed. [2022-07-12 03:14:11,531 INFO L895 garLoopResultBuilder]: At program point L25-2(lines 25 29) the Hoare annotation is: (= |__fpclassify_float_#in~x| __fpclassify_float_~x) [2022-07-12 03:14:11,531 INFO L899 garLoopResultBuilder]: For program point L25-3(lines 22 43) no Hoare annotation was computed. [2022-07-12 03:14:11,531 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 42) no Hoare annotation was computed. [2022-07-12 03:14:11,531 INFO L902 garLoopResultBuilder]: At program point __fpclassify_floatENTRY(lines 22 43) the Hoare annotation is: true [2022-07-12 03:14:11,531 INFO L899 garLoopResultBuilder]: For program point __fpclassify_floatEXIT(lines 22 43) no Hoare annotation was computed. [2022-07-12 03:14:11,532 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 42) no Hoare annotation was computed. [2022-07-12 03:14:11,535 INFO L356 BasicCegarLoop]: Path program 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] [2022-07-12 03:14:11,537 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 03:14:11,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 03:14:11 BoogieIcfgContainer [2022-07-12 03:14:11,553 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 03:14:11,554 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 03:14:11,554 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 03:14:11,554 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 03:14:11,559 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:13:45" (3/4) ... [2022-07-12 03:14:11,562 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-12 03:14:11,567 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure isnan_float [2022-07-12 03:14:11,567 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_float [2022-07-12 03:14:11,576 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-07-12 03:14:11,576 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-07-12 03:14:11,576 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-12 03:14:11,577 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-12 03:14:11,596 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x [2022-07-12 03:14:11,596 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((y == y && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && \result == y) && ~fp.eq~FLOAT(y, y)) || ((((\result == x && y == y) && ~fp.eq~FLOAT(x, x)) && x == x) && !~fp.eq~FLOAT(y, y)) [2022-07-12 03:14:11,609 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 03:14:11,609 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 03:14:11,609 INFO L158 Benchmark]: Toolchain (without parser) took 26638.49ms. Allocated memory was 52.4MB in the beginning and 79.7MB in the end (delta: 27.3MB). Free memory was 28.8MB in the beginning and 27.2MB in the end (delta: 1.6MB). Peak memory consumption was 28.4MB. Max. memory is 16.1GB. [2022-07-12 03:14:11,610 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 52.4MB. Free memory is still 33.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:14:11,610 INFO L158 Benchmark]: CACSL2BoogieTranslator took 311.26ms. Allocated memory was 52.4MB in the beginning and 65.0MB in the end (delta: 12.6MB). Free memory was 28.5MB in the beginning and 46.8MB in the end (delta: -18.2MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. [2022-07-12 03:14:11,610 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.10ms. Allocated memory is still 65.0MB. Free memory was 46.8MB in the beginning and 45.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:14:11,610 INFO L158 Benchmark]: Boogie Preprocessor took 56.70ms. Allocated memory is still 65.0MB. Free memory was 45.1MB in the beginning and 43.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:14:11,611 INFO L158 Benchmark]: RCFGBuilder took 401.44ms. Allocated memory is still 65.0MB. Free memory was 43.5MB in the beginning and 45.6MB in the end (delta: -2.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-12 03:14:11,611 INFO L158 Benchmark]: TraceAbstraction took 25753.49ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 45.3MB in the beginning and 31.4MB in the end (delta: 13.9MB). Peak memory consumption was 42.0MB. Max. memory is 16.1GB. [2022-07-12 03:14:11,611 INFO L158 Benchmark]: Witness Printer took 55.42ms. Allocated memory is still 79.7MB. Free memory was 31.4MB in the beginning and 27.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 03:14:11,612 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.20ms. Allocated memory is still 52.4MB. Free memory is still 33.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 311.26ms. Allocated memory was 52.4MB in the beginning and 65.0MB in the end (delta: 12.6MB). Free memory was 28.5MB in the beginning and 46.8MB in the end (delta: -18.2MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.10ms. Allocated memory is still 65.0MB. Free memory was 46.8MB in the beginning and 45.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 56.70ms. Allocated memory is still 65.0MB. Free memory was 45.1MB in the beginning and 43.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 401.44ms. Allocated memory is still 65.0MB. Free memory was 43.5MB in the beginning and 45.6MB in the end (delta: -2.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 25753.49ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 45.3MB in the beginning and 31.4MB in the end (delta: 13.9MB). Peak memory consumption was 42.0MB. Max. memory is 16.1GB. * Witness Printer took 55.42ms. Allocated memory is still 79.7MB. Free memory was 31.4MB in the beginning and 27.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 76]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 82]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 55 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 25.7s, OverallIterations: 30, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1332 SdHoareTripleChecker+Valid, 5.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1257 mSDsluCounter, 9173 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 108 IncrementalHoareTripleChecker+Unchecked, 7355 mSDsCounter, 334 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4147 IncrementalHoareTripleChecker+Invalid, 4589 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 334 mSolverCounterUnsat, 1818 mSDtfsCounter, 4147 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2044 GetRequests, 1738 SyntacticMatches, 2 SemanticMatches, 304 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100occurred in iteration=14, InterpolantAutomatonStates: 243, 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, 30 MinimizatonAttempts, 209 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 137 PreInvPairs, 163 NumberOfFragments, 264 HoareAnnotationTreeSize, 137 FomulaSimplifications, 1064 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 15 FomulaSimplificationsInter, 1513 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 1490 NumberOfCodeBlocks, 1490 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1902 ConstructedInterpolants, 9 QuantifiedInterpolants, 5587 SizeOfPredicates, 152 NumberOfNonLiveVariables, 3436 ConjunctsInSsa, 301 ConjunctsInUnsatCore, 40 InterpolantComputations, 20 PerfectInterpolantSequences, 1033/1145 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 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: ((((y == y && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && \result == y) && ~fp.eq~FLOAT(y, y)) || ((((\result == x && y == y) && ~fp.eq~FLOAT(x, x)) && x == x) && !~fp.eq~FLOAT(y, y)) - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: \old(x) == x RESULT: Ultimate proved your program to be correct! [2022-07-12 03:14:11,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE