./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.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/loop-invgen/apache-get-tag.i.v+lhb-reducer.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 133ba40f5b51c272364c51a4e246bcd97a40cd88b0bcd4bd92df8f8d6bb23a52 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 03:55:26,957 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:55:26,958 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:55:26,992 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:55:26,995 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:55:26,996 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:55:26,996 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:55:26,997 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:55:26,998 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:55:26,999 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:55:26,999 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:55:27,000 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:55:27,000 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:55:27,001 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:55:27,002 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:55:27,002 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:55:27,003 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:55:27,003 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:55:27,004 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:55:27,006 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:55:27,007 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:55:27,007 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:55:27,008 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:55:27,009 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:55:27,009 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:55:27,011 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:55:27,012 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:55:27,012 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:55:27,013 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:55:27,013 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:55:27,014 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:55:27,014 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:55:27,014 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:55:27,015 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:55:27,016 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:55:27,016 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:55:27,017 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:55:27,017 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:55:27,017 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:55:27,018 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:55:27,018 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:55:27,024 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:55:27,025 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:55:27,039 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:55:27,040 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:55:27,040 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:55:27,040 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:55:27,041 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:55:27,041 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:55:27,041 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:55:27,041 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:55:27,042 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:55:27,042 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:55:27,042 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:55:27,042 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 03:55:27,042 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:55:27,043 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:55:27,043 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:55:27,043 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:55:27,047 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:55:27,047 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:55:27,047 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:55:27,047 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:55:27,048 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:55:27,048 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:55:27,048 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:55:27,048 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:55:27,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:55:27,048 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:55:27,049 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:55:27,049 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:55:27,049 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 03:55:27,049 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 03:55:27,049 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:55:27,049 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:55:27,049 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:55:27,050 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 -> 133ba40f5b51c272364c51a4e246bcd97a40cd88b0bcd4bd92df8f8d6bb23a52 [2022-07-12 03:55:27,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:55:27,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:55:27,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:55:27,262 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:55:27,262 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:55:27,263 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2022-07-12 03:55:27,318 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e08851bb8/2f35a89d7f9445d9a5468ddfa17855dd/FLAGe30117acd [2022-07-12 03:55:27,763 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:55:27,763 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2022-07-12 03:55:27,770 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e08851bb8/2f35a89d7f9445d9a5468ddfa17855dd/FLAGe30117acd [2022-07-12 03:55:27,784 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e08851bb8/2f35a89d7f9445d9a5468ddfa17855dd [2022-07-12 03:55:27,786 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:55:27,787 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:55:27,788 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:55:27,788 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:55:27,791 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:55:27,792 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:55:27" (1/1) ... [2022-07-12 03:55:27,792 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fc5ada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:55:27, skipping insertion in model container [2022-07-12 03:55:27,793 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:55:27" (1/1) ... [2022-07-12 03:55:27,798 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:55:27,829 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:55:28,001 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/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1224,1237] [2022-07-12 03:55:28,006 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/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1636,1649] [2022-07-12 03:55:28,013 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/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1851,1864] [2022-07-12 03:55:28,017 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/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2384,2397] [2022-07-12 03:55:28,019 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/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2599,2612] [2022-07-12 03:55:28,022 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/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2901,2914] [2022-07-12 03:55:28,024 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/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3116,3129] [2022-07-12 03:55:28,026 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/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3386,3399] [2022-07-12 03:55:28,029 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/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3604,3617] [2022-07-12 03:55:28,032 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/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4088,4101] [2022-07-12 03:55:28,034 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/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4306,4319] [2022-07-12 03:55:28,039 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/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4802,4815] [2022-07-12 03:55:28,045 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/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5203,5216] [2022-07-12 03:55:28,049 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/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5421,5434] [2022-07-12 03:55:28,051 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/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5792,5805] [2022-07-12 03:55:28,052 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/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6010,6023] [2022-07-12 03:55:28,053 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/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6296,6309] [2022-07-12 03:55:28,055 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/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6514,6527] [2022-07-12 03:55:28,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:55:28,067 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:55:28,085 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/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1224,1237] [2022-07-12 03:55:28,087 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/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1636,1649] [2022-07-12 03:55:28,092 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/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1851,1864] [2022-07-12 03:55:28,094 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/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2384,2397] [2022-07-12 03:55:28,095 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/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2599,2612] [2022-07-12 03:55:28,100 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/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2901,2914] [2022-07-12 03:55:28,102 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/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3116,3129] [2022-07-12 03:55:28,104 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/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3386,3399] [2022-07-12 03:55:28,105 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/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3604,3617] [2022-07-12 03:55:28,107 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/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4088,4101] [2022-07-12 03:55:28,108 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/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4306,4319] [2022-07-12 03:55:28,114 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/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4802,4815] [2022-07-12 03:55:28,115 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/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5203,5216] [2022-07-12 03:55:28,116 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/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5421,5434] [2022-07-12 03:55:28,117 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/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5792,5805] [2022-07-12 03:55:28,118 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/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6010,6023] [2022-07-12 03:55:28,119 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/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6296,6309] [2022-07-12 03:55:28,122 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/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6514,6527] [2022-07-12 03:55:28,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:55:28,135 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:55:28,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:55:28 WrapperNode [2022-07-12 03:55:28,136 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:55:28,137 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:55:28,138 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:55:28,138 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:55:28,142 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:55:28" (1/1) ... [2022-07-12 03:55:28,155 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:55:28" (1/1) ... [2022-07-12 03:55:28,177 INFO L137 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 244 [2022-07-12 03:55:28,178 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:55:28,179 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:55:28,179 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:55:28,179 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:55:28,185 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:55:28" (1/1) ... [2022-07-12 03:55:28,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:55:28" (1/1) ... [2022-07-12 03:55:28,194 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:55:28" (1/1) ... [2022-07-12 03:55:28,195 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:55:28" (1/1) ... [2022-07-12 03:55:28,201 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:55:28" (1/1) ... [2022-07-12 03:55:28,207 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:55:28" (1/1) ... [2022-07-12 03:55:28,209 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:55:28" (1/1) ... [2022-07-12 03:55:28,216 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:55:28,217 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:55:28,217 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:55:28,217 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:55:28,218 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:55:28" (1/1) ... [2022-07-12 03:55:28,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:55:28,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:55:28,241 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:55:28,260 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:55:28,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:55:28,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 03:55:28,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:55:28,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:55:28,342 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:55:28,343 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:55:28,559 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:55:28,563 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:55:28,563 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 03:55:28,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:55:28 BoogieIcfgContainer [2022-07-12 03:55:28,565 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:55:28,566 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:55:28,566 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:55:28,569 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:55:28,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:55:27" (1/3) ... [2022-07-12 03:55:28,569 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@280ea563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:55:28, skipping insertion in model container [2022-07-12 03:55:28,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:55:28" (2/3) ... [2022-07-12 03:55:28,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@280ea563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:55:28, skipping insertion in model container [2022-07-12 03:55:28,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:55:28" (3/3) ... [2022-07-12 03:55:28,571 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+lhb-reducer.c [2022-07-12 03:55:28,580 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:55:28,581 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-07-12 03:55:28,632 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:55:28,637 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@57f836b0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5074763b [2022-07-12 03:55:28,637 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-07-12 03:55:28,641 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 56 states have (on average 1.8571428571428572) internal successors, (104), 74 states have internal predecessors, (104), 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:55:28,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 03:55:28,647 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:55:28,647 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:55:28,648 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-07-12 03:55:28,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:55:28,653 INFO L85 PathProgramCache]: Analyzing trace with hash 123910062, now seen corresponding path program 1 times [2022-07-12 03:55:28,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:55:28,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315581279] [2022-07-12 03:55:28,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:55:28,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:55:28,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:28,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:55:28,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:55:28,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315581279] [2022-07-12 03:55:28,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315581279] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:55:28,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:55:28,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:55:28,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083760464] [2022-07-12 03:55:28,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:55:28,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:55:28,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:55:28,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:55:28,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:55:28,839 INFO L87 Difference]: Start difference. First operand has 75 states, 56 states have (on average 1.8571428571428572) internal successors, (104), 74 states have internal predecessors, (104), 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) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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:55:28,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:55:28,990 INFO L93 Difference]: Finished difference Result 123 states and 164 transitions. [2022-07-12 03:55:28,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:55:28,993 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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) Word has length 8 [2022-07-12 03:55:28,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:55:29,000 INFO L225 Difference]: With dead ends: 123 [2022-07-12 03:55:29,000 INFO L226 Difference]: Without dead ends: 107 [2022-07-12 03:55:29,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:55:29,009 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 81 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:55:29,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 250 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:55:29,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-12 03:55:29,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 69. [2022-07-12 03:55:29,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 68 states have internal predecessors, (73), 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:55:29,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2022-07-12 03:55:29,046 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 8 [2022-07-12 03:55:29,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:55:29,046 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2022-07-12 03:55:29,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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:55:29,047 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-07-12 03:55:29,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 03:55:29,048 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:55:29,048 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:55:29,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 03:55:29,049 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-07-12 03:55:29,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:55:29,051 INFO L85 PathProgramCache]: Analyzing trace with hash 120339118, now seen corresponding path program 1 times [2022-07-12 03:55:29,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:55:29,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243041324] [2022-07-12 03:55:29,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:55:29,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:55:29,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:29,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:55:29,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:55:29,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243041324] [2022-07-12 03:55:29,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243041324] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:55:29,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:55:29,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:55:29,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979688455] [2022-07-12 03:55:29,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:55:29,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:55:29,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:55:29,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:55:29,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:55:29,119 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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:55:29,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:55:29,190 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2022-07-12 03:55:29,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:55:29,191 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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) Word has length 8 [2022-07-12 03:55:29,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:55:29,192 INFO L225 Difference]: With dead ends: 107 [2022-07-12 03:55:29,193 INFO L226 Difference]: Without dead ends: 105 [2022-07-12 03:55:29,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:55:29,195 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 44 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:55:29,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 165 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:55:29,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-12 03:55:29,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 67. [2022-07-12 03:55:29,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 51 states have (on average 1.392156862745098) internal successors, (71), 66 states have internal predecessors, (71), 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:55:29,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2022-07-12 03:55:29,206 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 8 [2022-07-12 03:55:29,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:55:29,206 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2022-07-12 03:55:29,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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:55:29,207 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-07-12 03:55:29,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 03:55:29,208 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:55:29,208 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:55:29,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 03:55:29,209 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-07-12 03:55:29,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:55:29,210 INFO L85 PathProgramCache]: Analyzing trace with hash 2031737892, now seen corresponding path program 1 times [2022-07-12 03:55:29,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:55:29,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076681705] [2022-07-12 03:55:29,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:55:29,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:55:29,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:29,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:55:29,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:55:29,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076681705] [2022-07-12 03:55:29,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076681705] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:55:29,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:55:29,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:55:29,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682022475] [2022-07-12 03:55:29,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:55:29,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:55:29,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:55:29,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:55:29,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:55:29,291 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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:55:29,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:55:29,350 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-07-12 03:55:29,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:55:29,351 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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) Word has length 11 [2022-07-12 03:55:29,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:55:29,351 INFO L225 Difference]: With dead ends: 69 [2022-07-12 03:55:29,351 INFO L226 Difference]: Without dead ends: 67 [2022-07-12 03:55:29,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:55:29,354 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 61 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:55:29,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 119 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:55:29,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-07-12 03:55:29,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2022-07-12 03:55:29,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.38) internal successors, (69), 64 states have internal predecessors, (69), 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:55:29,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2022-07-12 03:55:29,372 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 11 [2022-07-12 03:55:29,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:55:29,372 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2022-07-12 03:55:29,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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:55:29,373 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2022-07-12 03:55:29,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 03:55:29,374 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:55:29,374 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:55:29,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 03:55:29,375 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-07-12 03:55:29,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:55:29,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1271153903, now seen corresponding path program 1 times [2022-07-12 03:55:29,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:55:29,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308380883] [2022-07-12 03:55:29,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:55:29,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:55:29,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:29,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:55:29,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:55:29,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308380883] [2022-07-12 03:55:29,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308380883] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:55:29,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:55:29,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:55:29,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771819339] [2022-07-12 03:55:29,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:55:29,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:55:29,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:55:29,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:55:29,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:55:29,410 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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:55:29,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:55:29,470 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2022-07-12 03:55:29,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:55:29,471 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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) Word has length 11 [2022-07-12 03:55:29,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:55:29,471 INFO L225 Difference]: With dead ends: 67 [2022-07-12 03:55:29,472 INFO L226 Difference]: Without dead ends: 65 [2022-07-12 03:55:29,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:55:29,474 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 59 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:55:29,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 113 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:55:29,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-07-12 03:55:29,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2022-07-12 03:55:29,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 62 states have internal predecessors, (67), 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:55:29,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2022-07-12 03:55:29,478 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 11 [2022-07-12 03:55:29,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:55:29,478 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2022-07-12 03:55:29,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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:55:29,478 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2022-07-12 03:55:29,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 03:55:29,478 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:55:29,478 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:55:29,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 03:55:29,479 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-07-12 03:55:29,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:55:29,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1440630601, now seen corresponding path program 1 times [2022-07-12 03:55:29,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:55:29,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336013207] [2022-07-12 03:55:29,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:55:29,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:55:29,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:29,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:55:29,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:55:29,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336013207] [2022-07-12 03:55:29,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336013207] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:55:29,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:55:29,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:55:29,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971714245] [2022-07-12 03:55:29,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:55:29,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:55:29,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:55:29,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:55:29,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:55:29,539 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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:55:29,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:55:29,576 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2022-07-12 03:55:29,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:55:29,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) Word has length 12 [2022-07-12 03:55:29,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:55:29,577 INFO L225 Difference]: With dead ends: 65 [2022-07-12 03:55:29,577 INFO L226 Difference]: Without dead ends: 61 [2022-07-12 03:55:29,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:55:29,578 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 16 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:55:29,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 136 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:55:29,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-12 03:55:29,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2022-07-12 03:55:29,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 58 states have internal predecessors, (63), 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:55:29,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2022-07-12 03:55:29,581 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 12 [2022-07-12 03:55:29,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:55:29,581 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2022-07-12 03:55:29,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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:55:29,582 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-07-12 03:55:29,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 03:55:29,582 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:55:29,582 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:55:29,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 03:55:29,583 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-07-12 03:55:29,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:55:29,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1440142029, now seen corresponding path program 1 times [2022-07-12 03:55:29,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:55:29,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201571079] [2022-07-12 03:55:29,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:55:29,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:55:29,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:29,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:55:29,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:55:29,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201571079] [2022-07-12 03:55:29,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201571079] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:55:29,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:55:29,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:55:29,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632269201] [2022-07-12 03:55:29,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:55:29,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:55:29,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:55:29,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:55:29,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:55:29,613 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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:55:29,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:55:29,675 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2022-07-12 03:55:29,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:55:29,676 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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) Word has length 12 [2022-07-12 03:55:29,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:55:29,676 INFO L225 Difference]: With dead ends: 95 [2022-07-12 03:55:29,676 INFO L226 Difference]: Without dead ends: 93 [2022-07-12 03:55:29,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:55:29,677 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 87 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:55:29,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 144 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:55:29,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-12 03:55:29,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 57. [2022-07-12 03:55:29,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 56 states have internal predecessors, (61), 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:55:29,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2022-07-12 03:55:29,681 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 12 [2022-07-12 03:55:29,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:55:29,681 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2022-07-12 03:55:29,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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:55:29,682 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-07-12 03:55:29,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 03:55:29,682 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:55:29,682 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:55:29,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 03:55:29,682 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-07-12 03:55:29,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:55:29,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1440126141, now seen corresponding path program 1 times [2022-07-12 03:55:29,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:55:29,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146119012] [2022-07-12 03:55:29,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:55:29,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:55:29,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:29,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:55:29,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:55:29,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146119012] [2022-07-12 03:55:29,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146119012] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:55:29,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:55:29,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:55:29,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896878726] [2022-07-12 03:55:29,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:55:29,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:55:29,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:55:29,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:55:29,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:55:29,731 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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:55:29,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:55:29,802 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2022-07-12 03:55:29,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:55:29,803 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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) Word has length 12 [2022-07-12 03:55:29,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:55:29,804 INFO L225 Difference]: With dead ends: 100 [2022-07-12 03:55:29,804 INFO L226 Difference]: Without dead ends: 98 [2022-07-12 03:55:29,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:55:29,805 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 91 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:55:29,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 144 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:55:29,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-12 03:55:29,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 55. [2022-07-12 03:55:29,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 54 states have internal predecessors, (59), 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:55:29,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2022-07-12 03:55:29,814 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 12 [2022-07-12 03:55:29,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:55:29,814 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2022-07-12 03:55:29,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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:55:29,815 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2022-07-12 03:55:29,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 03:55:29,818 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:55:29,818 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:55:29,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 03:55:29,818 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-07-12 03:55:29,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:55:29,818 INFO L85 PathProgramCache]: Analyzing trace with hash -751061257, now seen corresponding path program 1 times [2022-07-12 03:55:29,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:55:29,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744979122] [2022-07-12 03:55:29,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:55:29,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:55:29,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:29,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:55:29,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:55:29,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744979122] [2022-07-12 03:55:29,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744979122] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:55:29,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:55:29,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:55:29,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823412238] [2022-07-12 03:55:29,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:55:29,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:55:29,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:55:29,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:55:29,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:55:29,840 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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:55:29,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:55:29,864 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2022-07-12 03:55:29,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:55:29,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) Word has length 12 [2022-07-12 03:55:29,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:55:29,865 INFO L225 Difference]: With dead ends: 57 [2022-07-12 03:55:29,865 INFO L226 Difference]: Without dead ends: 53 [2022-07-12 03:55:29,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:55:29,865 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 13 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:55:29,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 118 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:55:29,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-07-12 03:55:29,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2022-07-12 03:55:29,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 50 states have internal predecessors, (55), 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:55:29,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2022-07-12 03:55:29,868 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 12 [2022-07-12 03:55:29,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:55:29,868 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2022-07-12 03:55:29,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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:55:29,868 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-07-12 03:55:29,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-12 03:55:29,868 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:55:29,868 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:55:29,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 03:55:29,869 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-07-12 03:55:29,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:55:29,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1694725733, now seen corresponding path program 1 times [2022-07-12 03:55:29,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:55:29,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566204180] [2022-07-12 03:55:29,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:55:29,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:55:29,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:29,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:55:29,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:55:29,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566204180] [2022-07-12 03:55:29,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566204180] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:55:29,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:55:29,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 03:55:29,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051787654] [2022-07-12 03:55:29,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:55:29,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 03:55:29,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:55:29,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 03:55:29,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:55:29,945 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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:55:30,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:55:30,034 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2022-07-12 03:55:30,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 03:55:30,034 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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) Word has length 13 [2022-07-12 03:55:30,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:55:30,035 INFO L225 Difference]: With dead ends: 118 [2022-07-12 03:55:30,035 INFO L226 Difference]: Without dead ends: 116 [2022-07-12 03:55:30,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:55:30,036 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 74 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:55:30,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 223 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:55:30,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-12 03:55:30,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 56. [2022-07-12 03:55:30,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 46 states have (on average 1.326086956521739) internal successors, (61), 55 states have internal predecessors, (61), 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:55:30,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-07-12 03:55:30,039 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 13 [2022-07-12 03:55:30,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:55:30,039 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-07-12 03:55:30,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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:55:30,039 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-07-12 03:55:30,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-12 03:55:30,039 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:55:30,040 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:55:30,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 03:55:30,040 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-07-12 03:55:30,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:55:30,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1694233189, now seen corresponding path program 1 times [2022-07-12 03:55:30,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:55:30,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094739921] [2022-07-12 03:55:30,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:55:30,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:55:30,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:30,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:55:30,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:55:30,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094739921] [2022-07-12 03:55:30,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094739921] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:55:30,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:55:30,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 03:55:30,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766037503] [2022-07-12 03:55:30,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:55:30,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 03:55:30,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:55:30,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 03:55:30,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:55:30,101 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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:55:30,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:55:30,186 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2022-07-12 03:55:30,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 03:55:30,186 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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) Word has length 13 [2022-07-12 03:55:30,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:55:30,187 INFO L225 Difference]: With dead ends: 116 [2022-07-12 03:55:30,187 INFO L226 Difference]: Without dead ends: 114 [2022-07-12 03:55:30,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:55:30,188 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 86 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:55:30,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 195 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:55:30,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-12 03:55:30,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 58. [2022-07-12 03:55:30,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 48 states have (on average 1.3125) internal successors, (63), 57 states have internal predecessors, (63), 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:55:30,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2022-07-12 03:55:30,193 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 13 [2022-07-12 03:55:30,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:55:30,193 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2022-07-12 03:55:30,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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:55:30,193 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2022-07-12 03:55:30,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-12 03:55:30,194 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:55:30,194 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:55:30,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 03:55:30,194 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-07-12 03:55:30,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:55:30,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1791008026, now seen corresponding path program 1 times [2022-07-12 03:55:30,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:55:30,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36951649] [2022-07-12 03:55:30,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:55:30,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:55:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:30,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:55:30,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:55:30,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36951649] [2022-07-12 03:55:30,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36951649] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:55:30,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:55:30,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:55:30,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11714270] [2022-07-12 03:55:30,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:55:30,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:55:30,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:55:30,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:55:30,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:55:30,229 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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:55:30,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:55:30,275 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-07-12 03:55:30,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:55:30,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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) Word has length 13 [2022-07-12 03:55:30,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:55:30,276 INFO L225 Difference]: With dead ends: 76 [2022-07-12 03:55:30,276 INFO L226 Difference]: Without dead ends: 74 [2022-07-12 03:55:30,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:55:30,277 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 67 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:55:30,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 103 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:55:30,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-07-12 03:55:30,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 56. [2022-07-12 03:55:30,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 47 states have (on average 1.297872340425532) internal successors, (61), 55 states have internal predecessors, (61), 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:55:30,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-07-12 03:55:30,280 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 13 [2022-07-12 03:55:30,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:55:30,280 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-07-12 03:55:30,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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:55:30,281 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-07-12 03:55:30,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-12 03:55:30,281 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:55:30,281 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:55:30,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 03:55:30,281 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-07-12 03:55:30,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:55:30,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1789284122, now seen corresponding path program 1 times [2022-07-12 03:55:30,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:55:30,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040102171] [2022-07-12 03:55:30,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:55:30,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:55:30,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:30,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:55:30,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:55:30,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040102171] [2022-07-12 03:55:30,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040102171] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:55:30,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:55:30,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:55:30,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478444262] [2022-07-12 03:55:30,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:55:30,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:55:30,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:55:30,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:55:30,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:55:30,324 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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:55:30,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:55:30,362 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2022-07-12 03:55:30,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:55:30,362 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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) Word has length 13 [2022-07-12 03:55:30,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:55:30,363 INFO L225 Difference]: With dead ends: 57 [2022-07-12 03:55:30,363 INFO L226 Difference]: Without dead ends: 55 [2022-07-12 03:55:30,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:55:30,364 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 41 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:55:30,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 77 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:55:30,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-12 03:55:30,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2022-07-12 03:55:30,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 53 states have internal predecessors, (59), 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:55:30,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2022-07-12 03:55:30,368 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 13 [2022-07-12 03:55:30,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:55:30,369 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2022-07-12 03:55:30,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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:55:30,369 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2022-07-12 03:55:30,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-12 03:55:30,370 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:55:30,370 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:55:30,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 03:55:30,371 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-07-12 03:55:30,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:55:30,371 INFO L85 PathProgramCache]: Analyzing trace with hash 313330138, now seen corresponding path program 1 times [2022-07-12 03:55:30,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:55:30,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774854063] [2022-07-12 03:55:30,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:55:30,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:55:30,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:30,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:55:30,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:55:30,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774854063] [2022-07-12 03:55:30,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774854063] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:55:30,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:55:30,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 03:55:30,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898429468] [2022-07-12 03:55:30,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:55:30,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 03:55:30,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:55:30,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 03:55:30,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:55:30,455 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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:55:30,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:55:30,523 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2022-07-12 03:55:30,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 03:55:30,523 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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) Word has length 14 [2022-07-12 03:55:30,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:55:30,524 INFO L225 Difference]: With dead ends: 92 [2022-07-12 03:55:30,524 INFO L226 Difference]: Without dead ends: 90 [2022-07-12 03:55:30,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:55:30,525 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 55 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:55:30,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 164 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:55:30,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-12 03:55:30,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 60. [2022-07-12 03:55:30,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 59 states have internal predecessors, (67), 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:55:30,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2022-07-12 03:55:30,529 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 14 [2022-07-12 03:55:30,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:55:30,529 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2022-07-12 03:55:30,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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:55:30,529 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2022-07-12 03:55:30,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-12 03:55:30,529 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:55:30,529 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:55:30,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 03:55:30,530 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-07-12 03:55:30,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:55:30,530 INFO L85 PathProgramCache]: Analyzing trace with hash 314877283, now seen corresponding path program 1 times [2022-07-12 03:55:30,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:55:30,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441174428] [2022-07-12 03:55:30,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:55:30,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:55:30,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:30,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:55:30,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:55:30,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441174428] [2022-07-12 03:55:30,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441174428] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:55:30,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:55:30,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:55:30,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322118398] [2022-07-12 03:55:30,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:55:30,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:55:30,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:55:30,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:55:30,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:55:30,549 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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:55:30,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:55:30,597 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2022-07-12 03:55:30,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:55:30,598 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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) Word has length 14 [2022-07-12 03:55:30,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:55:30,598 INFO L225 Difference]: With dead ends: 80 [2022-07-12 03:55:30,598 INFO L226 Difference]: Without dead ends: 78 [2022-07-12 03:55:30,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:55:30,599 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 58 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:55:30,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 95 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:55:30,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-12 03:55:30,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 58. [2022-07-12 03:55:30,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 57 states have internal predecessors, (65), 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:55:30,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2022-07-12 03:55:30,603 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 14 [2022-07-12 03:55:30,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:55:30,603 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2022-07-12 03:55:30,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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:55:30,604 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2022-07-12 03:55:30,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-12 03:55:30,604 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:55:30,604 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:55:30,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 03:55:30,604 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-07-12 03:55:30,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:55:30,605 INFO L85 PathProgramCache]: Analyzing trace with hash 366771218, now seen corresponding path program 1 times [2022-07-12 03:55:30,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:55:30,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626546828] [2022-07-12 03:55:30,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:55:30,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:55:30,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:30,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:55:30,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:55:30,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626546828] [2022-07-12 03:55:30,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626546828] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:55:30,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:55:30,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 03:55:30,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939863464] [2022-07-12 03:55:30,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:55:30,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 03:55:30,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:55:30,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 03:55:30,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:55:30,679 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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:55:30,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:55:30,749 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-07-12 03:55:30,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 03:55:30,749 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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) Word has length 14 [2022-07-12 03:55:30,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:55:30,750 INFO L225 Difference]: With dead ends: 70 [2022-07-12 03:55:30,750 INFO L226 Difference]: Without dead ends: 66 [2022-07-12 03:55:30,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:55:30,754 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 27 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:55:30,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 117 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:55:30,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-07-12 03:55:30,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 59. [2022-07-12 03:55:30,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 58 states have internal predecessors, (66), 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:55:30,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2022-07-12 03:55:30,759 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 14 [2022-07-12 03:55:30,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:55:30,759 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2022-07-12 03:55:30,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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:55:30,760 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2022-07-12 03:55:30,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 03:55:30,760 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:55:30,760 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:55:30,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 03:55:30,762 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-07-12 03:55:30,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:55:30,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1171265312, now seen corresponding path program 1 times [2022-07-12 03:55:30,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:55:30,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032238518] [2022-07-12 03:55:30,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:55:30,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:55:30,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:30,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:55:30,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:55:30,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032238518] [2022-07-12 03:55:30,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032238518] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:55:30,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:55:30,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 03:55:30,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758288201] [2022-07-12 03:55:30,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:55:30,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 03:55:30,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:55:30,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 03:55:30,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:55:30,846 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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:55:30,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:55:30,911 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2022-07-12 03:55:30,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 03:55:30,911 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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) Word has length 15 [2022-07-12 03:55:30,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:55:30,912 INFO L225 Difference]: With dead ends: 87 [2022-07-12 03:55:30,912 INFO L226 Difference]: Without dead ends: 85 [2022-07-12 03:55:30,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:55:30,913 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 50 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:55:30,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 147 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:55:30,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-12 03:55:30,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 62. [2022-07-12 03:55:30,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 61 states have internal predecessors, (69), 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:55:30,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2022-07-12 03:55:30,918 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 15 [2022-07-12 03:55:30,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:55:30,918 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2022-07-12 03:55:30,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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:55:30,919 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2022-07-12 03:55:30,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 03:55:30,919 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:55:30,919 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:55:30,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 03:55:30,920 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-07-12 03:55:30,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:55:30,920 INFO L85 PathProgramCache]: Analyzing trace with hash 462679229, now seen corresponding path program 1 times [2022-07-12 03:55:30,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:55:30,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667398118] [2022-07-12 03:55:30,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:55:30,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:55:30,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:30,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:55:30,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:55:30,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667398118] [2022-07-12 03:55:30,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667398118] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:55:30,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:55:30,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:55:30,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576241306] [2022-07-12 03:55:30,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:55:30,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:55:30,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:55:30,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:55:30,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:55:30,942 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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:55:30,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:55:30,964 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2022-07-12 03:55:30,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:55:30,965 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) Word has length 16 [2022-07-12 03:55:30,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:55:30,965 INFO L225 Difference]: With dead ends: 62 [2022-07-12 03:55:30,966 INFO L226 Difference]: Without dead ends: 60 [2022-07-12 03:55:30,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:55:30,966 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 37 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:55:30,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 66 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:55:30,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-07-12 03:55:30,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-07-12 03:55:30,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 59 states have internal predecessors, (67), 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:55:30,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2022-07-12 03:55:30,972 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 16 [2022-07-12 03:55:30,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:55:30,972 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2022-07-12 03:55:30,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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:55:30,973 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2022-07-12 03:55:30,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 03:55:30,973 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:55:30,973 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:55:30,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 03:55:30,974 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-07-12 03:55:30,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:55:30,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1458158324, now seen corresponding path program 1 times [2022-07-12 03:55:30,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:55:30,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54149987] [2022-07-12 03:55:30,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:55:30,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:55:30,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:30,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:55:30,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:55:30,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54149987] [2022-07-12 03:55:30,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54149987] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:55:30,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:55:30,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:55:30,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129628394] [2022-07-12 03:55:30,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:55:30,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:55:30,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:55:30,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:55:30,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:55:30,998 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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:55:31,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:55:31,023 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2022-07-12 03:55:31,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:55:31,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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) Word has length 17 [2022-07-12 03:55:31,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:55:31,024 INFO L225 Difference]: With dead ends: 60 [2022-07-12 03:55:31,024 INFO L226 Difference]: Without dead ends: 56 [2022-07-12 03:55:31,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:55:31,024 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 8 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:55:31,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 90 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:55:31,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-12 03:55:31,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-07-12 03:55:31,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 55 states have internal predecessors, (63), 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:55:31,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2022-07-12 03:55:31,029 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 17 [2022-07-12 03:55:31,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:55:31,030 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2022-07-12 03:55:31,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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:55:31,030 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2022-07-12 03:55:31,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 03:55:31,031 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:55:31,031 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:55:31,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 03:55:31,031 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-07-12 03:55:31,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:55:31,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1747922500, now seen corresponding path program 1 times [2022-07-12 03:55:31,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:55:31,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475313727] [2022-07-12 03:55:31,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:55:31,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:55:31,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:31,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:55:31,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:55:31,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475313727] [2022-07-12 03:55:31,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475313727] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:55:31,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134724013] [2022-07-12 03:55:31,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:55:31,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:55:31,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:55:31,086 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:55:31,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 03:55:31,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:31,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 03:55:31,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:55:31,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:55:31,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:55:31,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 03:55:31,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134724013] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:55:31,427 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:55:31,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 5] total 13 [2022-07-12 03:55:31,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845917983] [2022-07-12 03:55:31,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:55:31,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 03:55:31,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:55:31,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 03:55:31,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-07-12 03:55:31,430 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 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:55:31,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:55:31,589 INFO L93 Difference]: Finished difference Result 121 states and 136 transitions. [2022-07-12 03:55:31,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 03:55:31,589 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 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) Word has length 18 [2022-07-12 03:55:31,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:55:31,590 INFO L225 Difference]: With dead ends: 121 [2022-07-12 03:55:31,590 INFO L226 Difference]: Without dead ends: 119 [2022-07-12 03:55:31,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2022-07-12 03:55:31,590 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 221 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:55:31,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 117 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:55:31,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-12 03:55:31,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 52. [2022-07-12 03:55:31,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 51 states have internal predecessors, (59), 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:55:31,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-07-12 03:55:31,594 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 18 [2022-07-12 03:55:31,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:55:31,594 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-07-12 03:55:31,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 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:55:31,594 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-07-12 03:55:31,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 03:55:31,595 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:55:31,595 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:55:31,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 03:55:31,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:55:31,814 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-07-12 03:55:31,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:55:31,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1748415044, now seen corresponding path program 1 times [2022-07-12 03:55:31,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:55:31,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879806139] [2022-07-12 03:55:31,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:55:31,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:55:31,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:31,851 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:55:31,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:55:31,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879806139] [2022-07-12 03:55:31,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879806139] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:55:31,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307540188] [2022-07-12 03:55:31,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:55:31,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:55:31,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:55:31,863 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:55:31,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 03:55:31,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:31,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 03:55:31,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:55:32,073 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:55:32,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:55:32,112 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 03:55:32,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307540188] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:55:32,113 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:55:32,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 5] total 13 [2022-07-12 03:55:32,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213484410] [2022-07-12 03:55:32,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:55:32,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 03:55:32,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:55:32,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 03:55:32,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-07-12 03:55:32,114 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 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:55:32,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:55:32,258 INFO L93 Difference]: Finished difference Result 100 states and 113 transitions. [2022-07-12 03:55:32,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 03:55:32,259 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 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) Word has length 18 [2022-07-12 03:55:32,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:55:32,259 INFO L225 Difference]: With dead ends: 100 [2022-07-12 03:55:32,259 INFO L226 Difference]: Without dead ends: 98 [2022-07-12 03:55:32,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2022-07-12 03:55:32,260 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 279 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:55:32,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 108 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:55:32,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-12 03:55:32,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 45. [2022-07-12 03:55:32,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 44 states have internal predecessors, (51), 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:55:32,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-07-12 03:55:32,264 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 18 [2022-07-12 03:55:32,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:55:32,265 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-07-12 03:55:32,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 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:55:32,265 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-07-12 03:55:32,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 03:55:32,265 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:55:32,265 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:55:32,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 03:55:32,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2022-07-12 03:55:32,467 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-07-12 03:55:32,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:55:32,468 INFO L85 PathProgramCache]: Analyzing trace with hash -2026613132, now seen corresponding path program 1 times [2022-07-12 03:55:32,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:55:32,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487489454] [2022-07-12 03:55:32,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:55:32,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:55:32,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:32,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:55:32,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:55:32,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487489454] [2022-07-12 03:55:32,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487489454] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:55:32,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:55:32,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 03:55:32,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444257435] [2022-07-12 03:55:32,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:55:32,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 03:55:32,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:55:32,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 03:55:32,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:55:32,502 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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:55:32,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:55:32,555 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2022-07-12 03:55:32,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 03:55:32,556 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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) Word has length 18 [2022-07-12 03:55:32,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:55:32,557 INFO L225 Difference]: With dead ends: 60 [2022-07-12 03:55:32,558 INFO L226 Difference]: Without dead ends: 58 [2022-07-12 03:55:32,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-12 03:55:32,558 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 92 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:55:32,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 39 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:55:32,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-07-12 03:55:32,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 40. [2022-07-12 03:55:32,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 39 states have internal predecessors, (46), 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:55:32,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2022-07-12 03:55:32,562 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 18 [2022-07-12 03:55:32,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:55:32,562 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2022-07-12 03:55:32,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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:55:32,562 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2022-07-12 03:55:32,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 03:55:32,562 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:55:32,562 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:55:32,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-12 03:55:32,564 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-07-12 03:55:32,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:55:32,564 INFO L85 PathProgramCache]: Analyzing trace with hash -684716563, now seen corresponding path program 1 times [2022-07-12 03:55:32,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:55:32,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848854326] [2022-07-12 03:55:32,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:55:32,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:55:32,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:32,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:55:32,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:55:32,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848854326] [2022-07-12 03:55:32,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848854326] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:55:32,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:55:32,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 03:55:32,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565331918] [2022-07-12 03:55:32,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:55:32,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 03:55:32,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:55:32,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 03:55:32,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:55:32,604 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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:55:32,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:55:32,652 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2022-07-12 03:55:32,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 03:55:32,653 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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) Word has length 19 [2022-07-12 03:55:32,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:55:32,653 INFO L225 Difference]: With dead ends: 52 [2022-07-12 03:55:32,653 INFO L226 Difference]: Without dead ends: 50 [2022-07-12 03:55:32,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-12 03:55:32,654 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 61 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:55:32,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 34 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:55:32,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-12 03:55:32,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2022-07-12 03:55:32,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 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:55:32,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2022-07-12 03:55:32,657 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 19 [2022-07-12 03:55:32,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:55:32,657 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2022-07-12 03:55:32,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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:55:32,658 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-07-12 03:55:32,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 03:55:32,658 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:55:32,658 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:55:32,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-12 03:55:32,658 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-07-12 03:55:32,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:55:32,658 INFO L85 PathProgramCache]: Analyzing trace with hash -631275483, now seen corresponding path program 1 times [2022-07-12 03:55:32,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:55:32,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977883376] [2022-07-12 03:55:32,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:55:32,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:55:32,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:32,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:55:32,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:55:32,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977883376] [2022-07-12 03:55:32,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977883376] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:55:32,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:55:32,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 03:55:32,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809367529] [2022-07-12 03:55:32,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:55:32,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 03:55:32,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:55:32,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 03:55:32,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:55:32,690 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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:55:32,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:55:32,721 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-07-12 03:55:32,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:55:32,722 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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) Word has length 19 [2022-07-12 03:55:32,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:55:32,722 INFO L225 Difference]: With dead ends: 35 [2022-07-12 03:55:32,722 INFO L226 Difference]: Without dead ends: 0 [2022-07-12 03:55:32,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 03:55:32,722 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 43 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:55:32,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 24 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:55:32,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-12 03:55:32,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-12 03:55:32,723 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:55:32,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-12 03:55:32,723 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2022-07-12 03:55:32,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:55:32,723 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-12 03:55:32,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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:55:32,723 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-12 03:55:32,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-12 03:55:32,725 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (17 of 18 remaining) [2022-07-12 03:55:32,726 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (16 of 18 remaining) [2022-07-12 03:55:32,726 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (15 of 18 remaining) [2022-07-12 03:55:32,726 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (14 of 18 remaining) [2022-07-12 03:55:32,726 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (13 of 18 remaining) [2022-07-12 03:55:32,726 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (12 of 18 remaining) [2022-07-12 03:55:32,726 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (11 of 18 remaining) [2022-07-12 03:55:32,726 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (10 of 18 remaining) [2022-07-12 03:55:32,726 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (9 of 18 remaining) [2022-07-12 03:55:32,726 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (8 of 18 remaining) [2022-07-12 03:55:32,726 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (7 of 18 remaining) [2022-07-12 03:55:32,726 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (6 of 18 remaining) [2022-07-12 03:55:32,726 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (5 of 18 remaining) [2022-07-12 03:55:32,727 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (4 of 18 remaining) [2022-07-12 03:55:32,727 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (3 of 18 remaining) [2022-07-12 03:55:32,727 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (2 of 18 remaining) [2022-07-12 03:55:32,727 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (1 of 18 remaining) [2022-07-12 03:55:32,727 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (0 of 18 remaining) [2022-07-12 03:55:32,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-12 03:55:32,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-12 03:56:43,174 WARN L233 SmtUtils]: Spent 1.17m on a formula simplification. DAG size of input: 95 DAG size of output: 94 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-12 03:57:03,822 WARN L233 SmtUtils]: Spent 15.67s on a formula simplification. DAG size of input: 75 DAG size of output: 70 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-12 03:57:04,292 INFO L899 garLoopResultBuilder]: For program point L126(line 126) no Hoare annotation was computed. [2022-07-12 03:57:04,292 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 224) no Hoare annotation was computed. [2022-07-12 03:57:04,292 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 72) no Hoare annotation was computed. [2022-07-12 03:57:04,292 INFO L899 garLoopResultBuilder]: For program point L52(line 52) no Hoare annotation was computed. [2022-07-12 03:57:04,292 INFO L899 garLoopResultBuilder]: For program point L176(line 176) no Hoare annotation was computed. [2022-07-12 03:57:04,292 INFO L899 garLoopResultBuilder]: For program point L366(line 366) no Hoare annotation was computed. [2022-07-12 03:57:04,293 INFO L899 garLoopResultBuilder]: For program point L333(line 333) no Hoare annotation was computed. [2022-07-12 03:57:04,293 INFO L899 garLoopResultBuilder]: For program point L234(lines 234 242) no Hoare annotation was computed. [2022-07-12 03:57:04,293 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 297) no Hoare annotation was computed. [2022-07-12 03:57:04,293 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 126) no Hoare annotation was computed. [2022-07-12 03:57:04,293 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-12 03:57:04,293 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-12 03:57:04,293 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 160) no Hoare annotation was computed. [2022-07-12 03:57:04,293 INFO L899 garLoopResultBuilder]: For program point L309(line 309) no Hoare annotation was computed. [2022-07-12 03:57:04,294 INFO L899 garLoopResultBuilder]: For program point L20(lines 20 401) no Hoare annotation was computed. [2022-07-12 03:57:04,294 INFO L899 garLoopResultBuilder]: For program point L276(lines 276 391) no Hoare annotation was computed. [2022-07-12 03:57:04,294 INFO L902 garLoopResultBuilder]: At program point L400(lines 15 402) the Hoare annotation is: true [2022-07-12 03:57:04,294 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 345) no Hoare annotation was computed. [2022-07-12 03:57:04,294 INFO L899 garLoopResultBuilder]: For program point L70(lines 70 94) no Hoare annotation was computed. [2022-07-12 03:57:04,294 INFO L895 garLoopResultBuilder]: At program point L384(lines 282 391) the Hoare annotation is: (and (let ((.cse1 (= |ULTIMATE.start_main_~main__t~0#1| 0))) (let ((.cse0 (let ((.cse2 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~13#1| 0)))) (or (and (<= 1 |ULTIMATE.start_main_~main__t~0#1|) .cse2) (and .cse2 .cse1))))) (or (and .cse0 .cse1) (and (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~18#1| 0)) (<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__cond~19#1|) .cse0)))) (not (<= |ULTIMATE.start_main_~main__tagbuf_len~0#1| |ULTIMATE.start_main_~main__t~0#1|))) [2022-07-12 03:57:04,294 INFO L895 garLoopResultBuilder]: At program point L351(lines 32 395) the Hoare annotation is: (or (and (= |ULTIMATE.start_main_~main__t~0#1| 0) (< |ULTIMATE.start_main_~main__t~0#1| |ULTIMATE.start_main_~main__tagbuf_len~0#1|)) (and (not (<= |ULTIMATE.start_main_~main__tagbuf_len~0#1| |ULTIMATE.start_main_~main__t~0#1|)) (let ((.cse2 (<= |ULTIMATE.start_main_~main__t~0#1| 1))) (let ((.cse0 (let ((.cse3 (<= 1 |ULTIMATE.start_main_~main__t~0#1|)) (.cse4 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~13#1| 0))) (.cse5 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~16#1| 0)))) (or (and .cse3 .cse4 .cse2 .cse5) (and .cse3 .cse4 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~19#1| 0)) .cse5)))) (.cse1 (<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__cond~17#1|))) (or (and .cse0 .cse1 .cse2) (and (<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__cond~19#1|) .cse0 .cse1)))))) [2022-07-12 03:57:04,295 INFO L899 garLoopResultBuilder]: For program point L186(lines 186 196) no Hoare annotation was computed. [2022-07-12 03:57:04,295 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 278) no Hoare annotation was computed. [2022-07-12 03:57:04,295 INFO L899 garLoopResultBuilder]: For program point L376(lines 376 385) no Hoare annotation was computed. [2022-07-12 03:57:04,295 INFO L899 garLoopResultBuilder]: For program point L343(lines 343 352) no Hoare annotation was computed. [2022-07-12 03:57:04,295 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 114) no Hoare annotation was computed. [2022-07-12 03:57:04,295 INFO L899 garLoopResultBuilder]: For program point L112(lines 112 203) no Hoare annotation was computed. [2022-07-12 03:57:04,295 INFO L899 garLoopResultBuilder]: For program point L236(line 236) no Hoare annotation was computed. [2022-07-12 03:57:04,295 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 333) no Hoare annotation was computed. [2022-07-12 03:57:04,295 INFO L895 garLoopResultBuilder]: At program point L195(lines 56 253) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__t~0#1|) (<= |ULTIMATE.start_main_~main__t~0#1| |ULTIMATE.start_main_~main__tagbuf_len~0#1|)) [2022-07-12 03:57:04,296 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 154) no Hoare annotation was computed. [2022-07-12 03:57:04,296 INFO L899 garLoopResultBuilder]: For program point L154(line 154) no Hoare annotation was computed. [2022-07-12 03:57:04,296 INFO L899 garLoopResultBuilder]: For program point L278(line 278) no Hoare annotation was computed. [2022-07-12 03:57:04,296 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 378) no Hoare annotation was computed. [2022-07-12 03:57:04,296 INFO L899 garLoopResultBuilder]: For program point L105(lines 105 209) no Hoare annotation was computed. [2022-07-12 03:57:04,296 INFO L899 garLoopResultBuilder]: For program point L72(line 72) no Hoare annotation was computed. [2022-07-12 03:57:04,296 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 255) no Hoare annotation was computed. [2022-07-12 03:57:04,296 INFO L899 garLoopResultBuilder]: For program point L295(lines 295 317) no Hoare annotation was computed. [2022-07-12 03:57:04,297 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 142) no Hoare annotation was computed. [2022-07-12 03:57:04,297 INFO L899 garLoopResultBuilder]: For program point L188(line 188) no Hoare annotation was computed. [2022-07-12 03:57:04,297 INFO L899 garLoopResultBuilder]: For program point L378(line 378) no Hoare annotation was computed. [2022-07-12 03:57:04,297 INFO L899 garLoopResultBuilder]: For program point L345(line 345) no Hoare annotation was computed. [2022-07-12 03:57:04,297 INFO L899 garLoopResultBuilder]: For program point L114(line 114) no Hoare annotation was computed. [2022-07-12 03:57:04,297 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 366) no Hoare annotation was computed. [2022-07-12 03:57:04,297 INFO L899 garLoopResultBuilder]: For program point L32(lines 32 395) no Hoare annotation was computed. [2022-07-12 03:57:04,297 INFO L899 garLoopResultBuilder]: For program point L288(lines 288 390) no Hoare annotation was computed. [2022-07-12 03:57:04,297 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-12 03:57:04,297 INFO L899 garLoopResultBuilder]: For program point L222(lines 222 244) no Hoare annotation was computed. [2022-07-12 03:57:04,298 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 188) no Hoare annotation was computed. [2022-07-12 03:57:04,298 INFO L899 garLoopResultBuilder]: For program point L24(lines 24 396) no Hoare annotation was computed. [2022-07-12 03:57:04,298 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 52) no Hoare annotation was computed. [2022-07-12 03:57:04,298 INFO L899 garLoopResultBuilder]: For program point L82(lines 82 92) no Hoare annotation was computed. [2022-07-12 03:57:04,298 INFO L899 garLoopResultBuilder]: For program point L140(lines 140 162) no Hoare annotation was computed. [2022-07-12 03:57:04,298 INFO L899 garLoopResultBuilder]: For program point L297(line 297) no Hoare annotation was computed. [2022-07-12 03:57:04,298 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-12 03:57:04,298 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 176) no Hoare annotation was computed. [2022-07-12 03:57:04,299 INFO L899 garLoopResultBuilder]: For program point L124(lines 124 201) no Hoare annotation was computed. [2022-07-12 03:57:04,299 INFO L902 garLoopResultBuilder]: At program point L314(lines 32 395) the Hoare annotation is: true [2022-07-12 03:57:04,299 INFO L899 garLoopResultBuilder]: For program point L215(lines 215 250) no Hoare annotation was computed. [2022-07-12 03:57:04,299 INFO L899 garLoopResultBuilder]: For program point L50(lines 50 253) no Hoare annotation was computed. [2022-07-12 03:57:04,299 INFO L899 garLoopResultBuilder]: For program point L174(lines 174 198) no Hoare annotation was computed. [2022-07-12 03:57:04,299 INFO L899 garLoopResultBuilder]: For program point L364(lines 364 387) no Hoare annotation was computed. [2022-07-12 03:57:04,299 INFO L899 garLoopResultBuilder]: For program point L331(lines 331 354) no Hoare annotation was computed. [2022-07-12 03:57:04,299 INFO L899 garLoopResultBuilder]: For program point L265(lines 265 393) no Hoare annotation was computed. [2022-07-12 03:57:04,299 INFO L899 garLoopResultBuilder]: For program point L133(lines 133 200) no Hoare annotation was computed. [2022-07-12 03:57:04,300 INFO L899 garLoopResultBuilder]: For program point L224(line 224) no Hoare annotation was computed. [2022-07-12 03:57:04,300 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 236) no Hoare annotation was computed. [2022-07-12 03:57:04,300 INFO L895 garLoopResultBuilder]: At program point L249(lines 101 251) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__t~0#1|) (not (<= |ULTIMATE.start_main_~main__tagbuf_len~0#1| |ULTIMATE.start_main_~main__t~0#1|))) [2022-07-12 03:57:04,300 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 84) no Hoare annotation was computed. [2022-07-12 03:57:04,300 INFO L899 garLoopResultBuilder]: For program point L84(line 84) no Hoare annotation was computed. [2022-07-12 03:57:04,300 INFO L899 garLoopResultBuilder]: For program point L307(lines 307 315) no Hoare annotation was computed. [2022-07-12 03:57:04,300 INFO L899 garLoopResultBuilder]: For program point L142(line 142) no Hoare annotation was computed. [2022-07-12 03:57:04,300 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 309) no Hoare annotation was computed. [2022-07-12 03:57:04,300 INFO L899 garLoopResultBuilder]: For program point L101(lines 101 251) no Hoare annotation was computed. [2022-07-12 03:57:04,301 INFO L899 garLoopResultBuilder]: For program point L324(lines 324 389) no Hoare annotation was computed. [2022-07-12 03:57:04,303 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] [2022-07-12 03:57:04,304 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 03:57:04,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 03:57:04 BoogieIcfgContainer [2022-07-12 03:57:04,315 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 03:57:04,316 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 03:57:04,316 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 03:57:04,316 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 03:57:04,316 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:55:28" (3/4) ... [2022-07-12 03:57:04,318 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-12 03:57:04,326 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-07-12 03:57:04,326 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-12 03:57:04,326 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-12 03:57:04,327 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-12 03:57:04,375 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 03:57:04,376 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 03:57:04,376 INFO L158 Benchmark]: Toolchain (without parser) took 96589.09ms. Allocated memory was 111.1MB in the beginning and 474.0MB in the end (delta: 362.8MB). Free memory was 84.6MB in the beginning and 431.1MB in the end (delta: -346.5MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2022-07-12 03:57:04,376 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 111.1MB. Free memory is still 67.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:57:04,377 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.53ms. Allocated memory is still 111.1MB. Free memory was 84.5MB in the beginning and 80.4MB in the end (delta: 4.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 03:57:04,377 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.32ms. Allocated memory is still 111.1MB. Free memory was 80.4MB in the beginning and 78.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:57:04,378 INFO L158 Benchmark]: Boogie Preprocessor took 38.02ms. Allocated memory is still 111.1MB. Free memory was 78.3MB in the beginning and 77.0MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:57:04,378 INFO L158 Benchmark]: RCFGBuilder took 347.94ms. Allocated memory is still 111.1MB. Free memory was 76.9MB in the beginning and 62.8MB in the end (delta: 14.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-12 03:57:04,379 INFO L158 Benchmark]: TraceAbstraction took 95749.27ms. Allocated memory was 111.1MB in the beginning and 474.0MB in the end (delta: 362.8MB). Free memory was 62.2MB in the beginning and 436.4MB in the end (delta: -374.2MB). Peak memory consumption was 259.6MB. Max. memory is 16.1GB. [2022-07-12 03:57:04,380 INFO L158 Benchmark]: Witness Printer took 59.83ms. Allocated memory is still 474.0MB. Free memory was 436.4MB in the beginning and 431.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 03:57:04,386 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.12ms. Allocated memory is still 111.1MB. Free memory is still 67.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 348.53ms. Allocated memory is still 111.1MB. Free memory was 84.5MB in the beginning and 80.4MB in the end (delta: 4.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.32ms. Allocated memory is still 111.1MB. Free memory was 80.4MB in the beginning and 78.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.02ms. Allocated memory is still 111.1MB. Free memory was 78.3MB in the beginning and 77.0MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 347.94ms. Allocated memory is still 111.1MB. Free memory was 76.9MB in the beginning and 62.8MB in the end (delta: 14.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 95749.27ms. Allocated memory was 111.1MB in the beginning and 474.0MB in the end (delta: 362.8MB). Free memory was 62.2MB in the beginning and 436.4MB in the end (delta: -374.2MB). Peak memory consumption was 259.6MB. Max. memory is 16.1GB. * Witness Printer took 59.83ms. Allocated memory is still 474.0MB. Free memory was 436.4MB in the beginning and 431.1MB in the end (delta: 5.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: 52]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 72]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 84]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 114]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 126]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 142]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 154]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 176]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 188]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 224]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 236]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 278]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 297]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 309]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 333]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 345]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 366]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 378]: 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 1 procedures, 75 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 95.7s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 91.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1651 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1651 mSDsluCounter, 2788 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1760 mSDsCounter, 203 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2049 IncrementalHoareTripleChecker+Invalid, 2252 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 203 mSolverCounterUnsat, 1028 mSDtfsCounter, 2049 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 233 GetRequests, 98 SyntacticMatches, 10 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=0, InterpolantAutomatonStates: 142, 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, 23 MinimizatonAttempts, 531 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 12 NumberOfFragments, 161 HoareAnnotationTreeSize, 6 FomulaSimplifications, 1951247 FormulaSimplificationTreeSizeReduction, 91.1s HoareSimplificationTime, 6 FomulaSimplificationsInter, 11241620 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 356 NumberOfCodeBlocks, 356 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 365 ConstructedInterpolants, 0 QuantifiedInterpolants, 1622 SizeOfPredicates, 6 NumberOfNonLiveVariables, 217 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 27 InterpolantComputations, 21 PerfectInterpolantSequences, 8/24 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 18 specifications checked. All of them hold - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (main__t == 0 && main__t < main__tagbuf_len) || (!(main__tagbuf_len <= main__t) && (((((((1 <= main__t && !(__VERIFIER_assert__cond == 0)) && main__t <= 1) && !(__VERIFIER_assert__cond == 0)) || (((1 <= main__t && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0))) && 1 <= __VERIFIER_assert__cond) && main__t <= 1) || ((1 <= __VERIFIER_assert__cond && ((((1 <= main__t && !(__VERIFIER_assert__cond == 0)) && main__t <= 1) && !(__VERIFIER_assert__cond == 0)) || (((1 <= main__t && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)))) && 1 <= __VERIFIER_assert__cond))) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: 1 <= main__t && !(main__tagbuf_len <= main__t) - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: 1 <= main__t && main__t <= main__tagbuf_len - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 282]: Loop Invariant Derived loop invariant: ((((1 <= main__t && !(__VERIFIER_assert__cond == 0)) || (!(__VERIFIER_assert__cond == 0) && main__t == 0)) && main__t == 0) || ((!(__VERIFIER_assert__cond == 0) && 1 <= __VERIFIER_assert__cond) && ((1 <= main__t && !(__VERIFIER_assert__cond == 0)) || (!(__VERIFIER_assert__cond == 0) && main__t == 0)))) && !(main__tagbuf_len <= main__t) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-07-12 03:57:04,428 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