/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 20:15:01,938 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 20:15:01,940 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 20:15:02,010 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 20:15:02,010 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 20:15:02,012 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 20:15:02,013 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 20:15:02,015 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 20:15:02,016 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 20:15:02,017 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 20:15:02,018 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 20:15:02,018 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 20:15:02,019 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 20:15:02,020 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 20:15:02,020 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 20:15:02,021 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 20:15:02,022 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 20:15:02,022 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 20:15:02,024 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 20:15:02,025 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 20:15:02,026 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 20:15:02,027 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 20:15:02,028 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 20:15:02,028 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 20:15:02,031 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 20:15:02,031 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 20:15:02,031 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 20:15:02,032 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 20:15:02,032 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 20:15:02,033 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 20:15:02,033 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 20:15:02,034 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 20:15:02,035 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 20:15:02,035 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 20:15:02,036 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 20:15:02,036 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 20:15:02,037 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 20:15:02,037 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 20:15:02,037 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 20:15:02,038 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 20:15:02,039 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 20:15:02,040 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-10 20:15:02,056 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 20:15:02,056 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 20:15:02,057 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 20:15:02,057 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 20:15:02,058 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 20:15:02,058 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 20:15:02,058 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 20:15:02,058 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 20:15:02,058 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 20:15:02,058 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 20:15:02,058 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 20:15:02,059 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 20:15:02,059 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 20:15:02,059 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 20:15:02,059 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 20:15:02,059 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 20:15:02,059 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 20:15:02,059 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 20:15:02,060 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 20:15:02,060 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 20:15:02,060 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 20:15:02,060 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 20:15:02,060 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 20:15:02,060 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 20:15:02,060 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 20:15:02,061 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 20:15:02,061 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 20:15:02,061 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 20:15:02,061 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 20:15:02,061 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 20:15:02,061 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 20:15:02,061 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 20:15:02,063 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 20:15:02,063 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 20:15:02,239 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 20:15:02,260 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 20:15:02,262 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 20:15:02,263 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 20:15:02,264 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 20:15:02,264 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2022-01-10 20:15:02,320 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b20cfd1b2/2c9dc7daa4f644b1994cf964e34d9a06/FLAG615cca74d [2022-01-10 20:15:02,715 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 20:15:02,715 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2022-01-10 20:15:02,725 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b20cfd1b2/2c9dc7daa4f644b1994cf964e34d9a06/FLAG615cca74d [2022-01-10 20:15:02,741 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b20cfd1b2/2c9dc7daa4f644b1994cf964e34d9a06 [2022-01-10 20:15:02,743 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 20:15:02,744 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 20:15:02,750 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 20:15:02,750 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 20:15:02,753 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 20:15:02,753 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 08:15:02" (1/1) ... [2022-01-10 20:15:02,754 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@254078f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:15:02, skipping insertion in model container [2022-01-10 20:15:02,754 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 08:15:02" (1/1) ... [2022-01-10 20:15:02,760 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 20:15:02,799 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 20:15:03,005 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1224,1237] [2022-01-10 20:15:03,012 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1636,1649] [2022-01-10 20:15:03,017 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1851,1864] [2022-01-10 20:15:03,025 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2384,2397] [2022-01-10 20:15:03,029 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2599,2612] [2022-01-10 20:15:03,031 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2901,2914] [2022-01-10 20:15:03,033 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3116,3129] [2022-01-10 20:15:03,037 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3386,3399] [2022-01-10 20:15:03,039 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3604,3617] [2022-01-10 20:15:03,041 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4088,4101] [2022-01-10 20:15:03,042 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4306,4319] [2022-01-10 20:15:03,043 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4802,4815] [2022-01-10 20:15:03,046 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5203,5216] [2022-01-10 20:15:03,047 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5421,5434] [2022-01-10 20:15:03,048 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5792,5805] [2022-01-10 20:15:03,049 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6010,6023] [2022-01-10 20:15:03,050 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6296,6309] [2022-01-10 20:15:03,051 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6514,6527] [2022-01-10 20:15:03,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 20:15:03,061 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 20:15:03,072 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1224,1237] [2022-01-10 20:15:03,074 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1636,1649] [2022-01-10 20:15:03,075 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1851,1864] [2022-01-10 20:15:03,077 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2384,2397] [2022-01-10 20:15:03,078 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2599,2612] [2022-01-10 20:15:03,079 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2901,2914] [2022-01-10 20:15:03,080 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3116,3129] [2022-01-10 20:15:03,081 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3386,3399] [2022-01-10 20:15:03,082 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3604,3617] [2022-01-10 20:15:03,084 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4088,4101] [2022-01-10 20:15:03,085 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4306,4319] [2022-01-10 20:15:03,086 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4802,4815] [2022-01-10 20:15:03,087 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5203,5216] [2022-01-10 20:15:03,088 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5421,5434] [2022-01-10 20:15:03,090 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5792,5805] [2022-01-10 20:15:03,090 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6010,6023] [2022-01-10 20:15:03,091 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6296,6309] [2022-01-10 20:15:03,092 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6514,6527] [2022-01-10 20:15:03,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 20:15:03,104 INFO L208 MainTranslator]: Completed translation [2022-01-10 20:15:03,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:15:03 WrapperNode [2022-01-10 20:15:03,105 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 20:15:03,106 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 20:15:03,106 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 20:15:03,106 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 20:15:03,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:15:03" (1/1) ... [2022-01-10 20:15:03,119 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:15:03" (1/1) ... [2022-01-10 20:15:03,140 INFO L137 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 238 [2022-01-10 20:15:03,140 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 20:15:03,141 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 20:15:03,141 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 20:15:03,141 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 20:15:03,146 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:15:03" (1/1) ... [2022-01-10 20:15:03,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:15:03" (1/1) ... [2022-01-10 20:15:03,149 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:15:03" (1/1) ... [2022-01-10 20:15:03,149 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:15:03" (1/1) ... [2022-01-10 20:15:03,154 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:15:03" (1/1) ... [2022-01-10 20:15:03,156 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:15:03" (1/1) ... [2022-01-10 20:15:03,158 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:15:03" (1/1) ... [2022-01-10 20:15:03,160 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 20:15:03,165 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 20:15:03,165 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 20:15:03,165 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 20:15:03,167 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:15:03" (1/1) ... [2022-01-10 20:15:03,175 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 20:15:03,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 20:15:03,193 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-01-10 20:15:03,194 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-01-10 20:15:03,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 20:15:03,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 20:15:03,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 20:15:03,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 20:15:03,290 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 20:15:03,292 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 20:15:03,469 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 20:15:03,474 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 20:15:03,474 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-10 20:15:03,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:15:03 BoogieIcfgContainer [2022-01-10 20:15:03,476 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 20:15:03,477 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 20:15:03,477 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 20:15:03,478 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 20:15:03,480 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:15:03" (1/1) ... [2022-01-10 20:15:03,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 08:15:03 BasicIcfg [2022-01-10 20:15:03,627 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 20:15:03,629 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 20:15:03,629 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 20:15:03,634 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 20:15:03,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 08:15:02" (1/4) ... [2022-01-10 20:15:03,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dfff2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 08:15:03, skipping insertion in model container [2022-01-10 20:15:03,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:15:03" (2/4) ... [2022-01-10 20:15:03,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dfff2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 08:15:03, skipping insertion in model container [2022-01-10 20:15:03,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:15:03" (3/4) ... [2022-01-10 20:15:03,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dfff2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 08:15:03, skipping insertion in model container [2022-01-10 20:15:03,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 08:15:03" (4/4) ... [2022-01-10 20:15:03,637 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+lhb-reducer.cTransformedIcfg [2022-01-10 20:15:03,640 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 20:15:03,640 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-01-10 20:15:03,681 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 20:15:03,688 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 20:15:03,688 INFO L340 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-01-10 20:15:03,705 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-01-10 20:15:03,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-01-10 20:15:03,709 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:15:03,710 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:15:03,710 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-01-10 20:15:03,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:15:03,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1205591853, now seen corresponding path program 1 times [2022-01-10 20:15:03,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:15:03,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676228058] [2022-01-10 20:15:03,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:03,729 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:04,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:04,125 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:04,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676228058] [2022-01-10 20:15:04,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676228058] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:15:04,126 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:15:04,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 20:15:04,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361313417] [2022-01-10 20:15:04,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:15:04,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 20:15:04,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:15:04,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 20:15:04,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 20:15:04,163 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-01-10 20:15:04,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:15:04,310 INFO L93 Difference]: Finished difference Result 123 states and 164 transitions. [2022-01-10 20:15:04,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 20:15:04,313 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-01-10 20:15:04,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:15:04,322 INFO L225 Difference]: With dead ends: 123 [2022-01-10 20:15:04,322 INFO L226 Difference]: Without dead ends: 107 [2022-01-10 20:15:04,325 INFO L932 BasicCegarLoop]: 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-01-10 20:15:04,329 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 57 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:15:04,333 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 204 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:15:04,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-01-10 20:15:04,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 69. [2022-01-10 20:15:04,362 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-01-10 20:15:04,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2022-01-10 20:15:04,364 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 8 [2022-01-10 20:15:04,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:15:04,365 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2022-01-10 20:15:04,365 INFO L471 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-01-10 20:15:04,365 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-01-10 20:15:04,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-01-10 20:15:04,366 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:15:04,366 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:15:04,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 20:15:04,367 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-01-10 20:15:04,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:15:04,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1205623631, now seen corresponding path program 1 times [2022-01-10 20:15:04,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:15:04,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116657613] [2022-01-10 20:15:04,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:04,370 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:04,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:04,536 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:04,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116657613] [2022-01-10 20:15:04,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116657613] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:15:04,536 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:15:04,536 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 20:15:04,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359357] [2022-01-10 20:15:04,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:15:04,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 20:15:04,539 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:15:04,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 20:15:04,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 20:15:04,541 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-01-10 20:15:04,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:15:04,666 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2022-01-10 20:15:04,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 20:15:04,667 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-01-10 20:15:04,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:15:04,669 INFO L225 Difference]: With dead ends: 107 [2022-01-10 20:15:04,669 INFO L226 Difference]: Without dead ends: 105 [2022-01-10 20:15:04,670 INFO L932 BasicCegarLoop]: 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-01-10 20:15:04,671 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 67 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:15:04,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 206 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:15:04,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-01-10 20:15:04,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 67. [2022-01-10 20:15:04,688 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-01-10 20:15:04,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2022-01-10 20:15:04,691 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 8 [2022-01-10 20:15:04,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:15:04,691 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2022-01-10 20:15:04,691 INFO L471 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-01-10 20:15:04,691 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-01-10 20:15:04,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-10 20:15:04,692 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:15:04,692 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:15:04,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 20:15:04,693 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-01-10 20:15:04,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:15:04,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1271570235, now seen corresponding path program 1 times [2022-01-10 20:15:04,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:15:04,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705714677] [2022-01-10 20:15:04,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:04,694 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:04,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:04,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:04,825 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:04,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705714677] [2022-01-10 20:15:04,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705714677] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:15:04,826 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:15:04,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 20:15:04,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748073085] [2022-01-10 20:15:04,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:15:04,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 20:15:04,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:15:04,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 20:15:04,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-01-10 20:15:04,828 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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-01-10 20:15:04,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:15:04,978 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2022-01-10 20:15:04,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:15:04,978 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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-01-10 20:15:04,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:15:04,983 INFO L225 Difference]: With dead ends: 120 [2022-01-10 20:15:04,983 INFO L226 Difference]: Without dead ends: 118 [2022-01-10 20:15:04,983 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-01-10 20:15:04,986 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 70 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:15:04,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 168 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:15:04,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-01-10 20:15:05,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 70. [2022-01-10 20:15:05,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 69 states have internal predecessors, (75), 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-01-10 20:15:05,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2022-01-10 20:15:05,006 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 11 [2022-01-10 20:15:05,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:15:05,007 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2022-01-10 20:15:05,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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-01-10 20:15:05,007 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2022-01-10 20:15:05,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-10 20:15:05,007 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:15:05,008 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:15:05,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 20:15:05,009 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-01-10 20:15:05,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:15:05,011 INFO L85 PathProgramCache]: Analyzing trace with hash -2076696609, now seen corresponding path program 1 times [2022-01-10 20:15:05,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:15:05,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557358947] [2022-01-10 20:15:05,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:05,013 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:05,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:05,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:05,164 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:05,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557358947] [2022-01-10 20:15:05,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557358947] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:15:05,164 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:15:05,164 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 20:15:05,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644259386] [2022-01-10 20:15:05,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:15:05,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 20:15:05,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:15:05,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 20:15:05,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-10 20:15:05,166 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 8 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-01-10 20:15:05,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:15:05,306 INFO L93 Difference]: Finished difference Result 118 states and 125 transitions. [2022-01-10 20:15:05,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:15:05,306 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 8 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-01-10 20:15:05,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:15:05,307 INFO L225 Difference]: With dead ends: 118 [2022-01-10 20:15:05,307 INFO L226 Difference]: Without dead ends: 116 [2022-01-10 20:15:05,307 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-01-10 20:15:05,308 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 70 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:15:05,308 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 207 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:15:05,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-01-10 20:15:05,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 73. [2022-01-10 20:15:05,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 72 states have internal predecessors, (79), 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-01-10 20:15:05,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2022-01-10 20:15:05,314 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 11 [2022-01-10 20:15:05,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:15:05,314 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2022-01-10 20:15:05,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 8 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-01-10 20:15:05,314 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2022-01-10 20:15:05,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-10 20:15:05,315 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:15:05,315 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:15:05,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 20:15:05,315 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-01-10 20:15:05,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:15:05,319 INFO L85 PathProgramCache]: Analyzing trace with hash 763972897, now seen corresponding path program 1 times [2022-01-10 20:15:05,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:15:05,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144040610] [2022-01-10 20:15:05,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:05,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:05,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:05,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:05,510 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:05,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144040610] [2022-01-10 20:15:05,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144040610] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:15:05,510 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:15:05,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 20:15:05,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642474892] [2022-01-10 20:15:05,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:15:05,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 20:15:05,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:15:05,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 20:15:05,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-01-10 20:15:05,512 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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-01-10 20:15:05,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:15:05,667 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2022-01-10 20:15:05,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:15:05,668 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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-01-10 20:15:05,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:15:05,668 INFO L225 Difference]: With dead ends: 110 [2022-01-10 20:15:05,669 INFO L226 Difference]: Without dead ends: 106 [2022-01-10 20:15:05,669 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-01-10 20:15:05,670 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 129 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:15:05,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 223 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:15:05,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-01-10 20:15:05,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 69. [2022-01-10 20:15:05,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 68 states have internal predecessors, (74), 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-01-10 20:15:05,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2022-01-10 20:15:05,677 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 12 [2022-01-10 20:15:05,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:15:05,677 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2022-01-10 20:15:05,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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-01-10 20:15:05,678 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2022-01-10 20:15:05,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-10 20:15:05,679 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:15:05,679 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:15:05,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 20:15:05,679 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-01-10 20:15:05,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:15:05,680 INFO L85 PathProgramCache]: Analyzing trace with hash 46915845, now seen corresponding path program 1 times [2022-01-10 20:15:05,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:15:05,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246073670] [2022-01-10 20:15:05,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:05,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:05,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:05,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:05,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:05,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246073670] [2022-01-10 20:15:05,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246073670] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:15:05,930 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:15:05,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-10 20:15:05,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091007040] [2022-01-10 20:15:05,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:15:05,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 20:15:05,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:15:05,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 20:15:05,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-01-10 20:15:05,932 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 10 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-01-10 20:15:06,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:15:06,079 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2022-01-10 20:15:06,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:15:06,080 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.2) internal successors, (12), 10 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-01-10 20:15:06,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:15:06,080 INFO L225 Difference]: With dead ends: 106 [2022-01-10 20:15:06,080 INFO L226 Difference]: Without dead ends: 102 [2022-01-10 20:15:06,081 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-01-10 20:15:06,081 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 108 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:15:06,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 215 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:15:06,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-01-10 20:15:06,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 65. [2022-01-10 20:15:06,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 51 states have (on average 1.3529411764705883) 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-01-10 20:15:06,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2022-01-10 20:15:06,087 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 12 [2022-01-10 20:15:06,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:15:06,087 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2022-01-10 20:15:06,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.2) internal successors, (12), 10 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-01-10 20:15:06,087 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2022-01-10 20:15:06,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-10 20:15:06,088 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:15:06,088 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:15:06,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 20:15:06,088 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-01-10 20:15:06,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:15:06,088 INFO L85 PathProgramCache]: Analyzing trace with hash 46946661, now seen corresponding path program 1 times [2022-01-10 20:15:06,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:15:06,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046544514] [2022-01-10 20:15:06,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:06,089 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:06,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:06,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:06,135 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:06,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046544514] [2022-01-10 20:15:06,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046544514] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:15:06,136 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:15:06,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:15:06,136 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931206727] [2022-01-10 20:15:06,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:15:06,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:15:06,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:15:06,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:15:06,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:15:06,137 INFO L87 Difference]: Start difference. First operand 65 states and 69 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-01-10 20:15:06,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:15:06,248 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2022-01-10 20:15:06,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:15:06,248 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-01-10 20:15:06,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:15:06,249 INFO L225 Difference]: With dead ends: 135 [2022-01-10 20:15:06,249 INFO L226 Difference]: Without dead ends: 133 [2022-01-10 20:15:06,249 INFO L932 BasicCegarLoop]: 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-01-10 20:15:06,250 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 81 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:15:06,250 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 215 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:15:06,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-01-10 20:15:06,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 67. [2022-01-10 20:15:06,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 66 states have internal predecessors, (72), 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-01-10 20:15:06,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2022-01-10 20:15:06,255 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 12 [2022-01-10 20:15:06,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:15:06,255 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2022-01-10 20:15:06,255 INFO L471 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-01-10 20:15:06,255 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2022-01-10 20:15:06,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-10 20:15:06,256 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:15:06,256 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:15:06,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 20:15:06,256 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-01-10 20:15:06,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:15:06,257 INFO L85 PathProgramCache]: Analyzing trace with hash 46947688, now seen corresponding path program 1 times [2022-01-10 20:15:06,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:15:06,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123513140] [2022-01-10 20:15:06,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:06,257 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:06,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:06,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:06,300 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:06,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123513140] [2022-01-10 20:15:06,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123513140] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:15:06,300 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:15:06,300 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:15:06,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173693428] [2022-01-10 20:15:06,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:15:06,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:15:06,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:15:06,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:15:06,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:15:06,301 INFO L87 Difference]: Start difference. First operand 67 states and 72 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-01-10 20:15:06,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:15:06,427 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2022-01-10 20:15:06,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:15:06,428 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-01-10 20:15:06,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:15:06,428 INFO L225 Difference]: With dead ends: 133 [2022-01-10 20:15:06,428 INFO L226 Difference]: Without dead ends: 131 [2022-01-10 20:15:06,429 INFO L932 BasicCegarLoop]: 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-01-10 20:15:06,429 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 91 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:15:06,429 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 240 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:15:06,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-01-10 20:15:06,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 68. [2022-01-10 20:15:06,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 67 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-01-10 20:15:06,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2022-01-10 20:15:06,435 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 12 [2022-01-10 20:15:06,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:15:06,435 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2022-01-10 20:15:06,435 INFO L471 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-01-10 20:15:06,435 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2022-01-10 20:15:06,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 20:15:06,436 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:15:06,436 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:15:06,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 20:15:06,436 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-01-10 20:15:06,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:15:06,436 INFO L85 PathProgramCache]: Analyzing trace with hash -2085688371, now seen corresponding path program 1 times [2022-01-10 20:15:06,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:15:06,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258624428] [2022-01-10 20:15:06,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:06,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:06,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:06,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:06,480 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:06,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258624428] [2022-01-10 20:15:06,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258624428] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:15:06,480 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:15:06,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:15:06,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194388679] [2022-01-10 20:15:06,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:15:06,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:15:06,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:15:06,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:15:06,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:15:06,481 INFO L87 Difference]: Start difference. First operand 68 states and 73 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-01-10 20:15:06,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:15:06,588 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2022-01-10 20:15:06,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:15:06,588 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-01-10 20:15:06,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:15:06,589 INFO L225 Difference]: With dead ends: 118 [2022-01-10 20:15:06,589 INFO L226 Difference]: Without dead ends: 116 [2022-01-10 20:15:06,589 INFO L932 BasicCegarLoop]: 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-01-10 20:15:06,590 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 67 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:15:06,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 195 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:15:06,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-01-10 20:15:06,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 71. [2022-01-10 20:15:06,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 57 states have (on average 1.368421052631579) internal successors, (78), 70 states have internal predecessors, (78), 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-01-10 20:15:06,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2022-01-10 20:15:06,595 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 13 [2022-01-10 20:15:06,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:15:06,595 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2022-01-10 20:15:06,595 INFO L471 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-01-10 20:15:06,595 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2022-01-10 20:15:06,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 20:15:06,596 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:15:06,596 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:15:06,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 20:15:06,596 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-01-10 20:15:06,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:15:06,597 INFO L85 PathProgramCache]: Analyzing trace with hash -2085656559, now seen corresponding path program 1 times [2022-01-10 20:15:06,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:15:06,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663455089] [2022-01-10 20:15:06,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:06,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:06,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:06,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:06,645 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:06,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663455089] [2022-01-10 20:15:06,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663455089] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:15:06,645 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:15:06,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:15:06,646 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823359453] [2022-01-10 20:15:06,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:15:06,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:15:06,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:15:06,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:15:06,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:15:06,647 INFO L87 Difference]: Start difference. First operand 71 states and 78 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-01-10 20:15:06,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:15:06,744 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2022-01-10 20:15:06,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:15:06,744 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-01-10 20:15:06,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:15:06,745 INFO L225 Difference]: With dead ends: 96 [2022-01-10 20:15:06,745 INFO L226 Difference]: Without dead ends: 94 [2022-01-10 20:15:06,745 INFO L932 BasicCegarLoop]: 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-01-10 20:15:06,746 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 36 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:15:06,746 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 156 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:15:06,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-01-10 20:15:06,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 73. [2022-01-10 20:15:06,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 72 states have internal predecessors, (81), 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-01-10 20:15:06,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2022-01-10 20:15:06,750 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 13 [2022-01-10 20:15:06,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:15:06,751 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2022-01-10 20:15:06,751 INFO L471 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-01-10 20:15:06,751 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2022-01-10 20:15:06,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 20:15:06,751 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:15:06,751 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:15:06,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 20:15:06,752 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-01-10 20:15:06,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:15:06,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1455347795, now seen corresponding path program 1 times [2022-01-10 20:15:06,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:15:06,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424018121] [2022-01-10 20:15:06,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:06,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:06,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:07,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:07,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:07,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424018121] [2022-01-10 20:15:07,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424018121] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:15:07,077 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:15:07,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 20:15:07,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778648726] [2022-01-10 20:15:07,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:15:07,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 20:15:07,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:15:07,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 20:15:07,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-01-10 20:15:07,078 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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-01-10 20:15:07,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:15:07,286 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2022-01-10 20:15:07,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 20:15:07,287 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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-01-10 20:15:07,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:15:07,287 INFO L225 Difference]: With dead ends: 127 [2022-01-10 20:15:07,288 INFO L226 Difference]: Without dead ends: 125 [2022-01-10 20:15:07,288 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-01-10 20:15:07,288 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 86 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 20:15:07,289 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 340 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 20:15:07,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-01-10 20:15:07,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 74. [2022-01-10 20:15:07,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 60 states have (on average 1.3666666666666667) internal successors, (82), 73 states have internal predecessors, (82), 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-01-10 20:15:07,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2022-01-10 20:15:07,293 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 13 [2022-01-10 20:15:07,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:15:07,293 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2022-01-10 20:15:07,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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-01-10 20:15:07,294 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2022-01-10 20:15:07,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 20:15:07,294 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:15:07,294 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:15:07,294 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 20:15:07,294 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-01-10 20:15:07,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:15:07,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1455379634, now seen corresponding path program 1 times [2022-01-10 20:15:07,295 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:15:07,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383410079] [2022-01-10 20:15:07,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:07,295 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:07,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:07,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:07,468 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:07,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383410079] [2022-01-10 20:15:07,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383410079] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:15:07,469 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:15:07,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 20:15:07,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958942084] [2022-01-10 20:15:07,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:15:07,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 20:15:07,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:15:07,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 20:15:07,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-01-10 20:15:07,470 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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-01-10 20:15:07,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:15:07,667 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2022-01-10 20:15:07,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 20:15:07,668 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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-01-10 20:15:07,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:15:07,668 INFO L225 Difference]: With dead ends: 125 [2022-01-10 20:15:07,668 INFO L226 Difference]: Without dead ends: 123 [2022-01-10 20:15:07,669 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-01-10 20:15:07,669 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 103 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 20:15:07,669 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 328 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 20:15:07,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-01-10 20:15:07,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 75. [2022-01-10 20:15:07,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 61 states have (on average 1.360655737704918) internal successors, (83), 74 states have internal predecessors, (83), 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-01-10 20:15:07,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2022-01-10 20:15:07,674 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 13 [2022-01-10 20:15:07,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:15:07,674 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2022-01-10 20:15:07,674 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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-01-10 20:15:07,675 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2022-01-10 20:15:07,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-10 20:15:07,675 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:15:07,675 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:15:07,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 20:15:07,675 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-01-10 20:15:07,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:15:07,676 INFO L85 PathProgramCache]: Analyzing trace with hash -231828753, now seen corresponding path program 1 times [2022-01-10 20:15:07,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:15:07,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220419761] [2022-01-10 20:15:07,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:07,676 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:07,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:07,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:07,856 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:07,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220419761] [2022-01-10 20:15:07,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220419761] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:15:07,856 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:15:07,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 20:15:07,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705247670] [2022-01-10 20:15:07,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:15:07,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 20:15:07,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:15:07,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 20:15:07,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-01-10 20:15:07,858 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 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-01-10 20:15:07,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:15:07,992 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2022-01-10 20:15:07,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 20:15:07,993 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 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-01-10 20:15:07,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:15:07,993 INFO L225 Difference]: With dead ends: 113 [2022-01-10 20:15:07,993 INFO L226 Difference]: Without dead ends: 111 [2022-01-10 20:15:07,994 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-01-10 20:15:07,994 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 90 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:15:07,994 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 242 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:15:07,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-01-10 20:15:07,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 76. [2022-01-10 20:15:07,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 62 states have (on average 1.3548387096774193) internal successors, (84), 75 states have internal predecessors, (84), 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-01-10 20:15:07,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2022-01-10 20:15:07,999 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 14 [2022-01-10 20:15:07,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:15:07,999 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2022-01-10 20:15:07,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 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-01-10 20:15:07,999 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2022-01-10 20:15:07,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-10 20:15:07,999 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:15:08,000 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:15:08,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 20:15:08,000 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-01-10 20:15:08,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:15:08,000 INFO L85 PathProgramCache]: Analyzing trace with hash -231797935, now seen corresponding path program 1 times [2022-01-10 20:15:08,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:15:08,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886589693] [2022-01-10 20:15:08,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:08,001 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:08,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:08,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:08,052 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:08,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886589693] [2022-01-10 20:15:08,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886589693] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:15:08,052 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:15:08,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:15:08,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811623667] [2022-01-10 20:15:08,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:15:08,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:15:08,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:15:08,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:15:08,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:15:08,053 INFO L87 Difference]: Start difference. First operand 76 states and 84 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-01-10 20:15:08,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:15:08,164 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2022-01-10 20:15:08,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:15:08,164 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-01-10 20:15:08,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:15:08,165 INFO L225 Difference]: With dead ends: 115 [2022-01-10 20:15:08,165 INFO L226 Difference]: Without dead ends: 113 [2022-01-10 20:15:08,165 INFO L932 BasicCegarLoop]: 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-01-10 20:15:08,166 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 56 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:15:08,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 221 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:15:08,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-01-10 20:15:08,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 78. [2022-01-10 20:15:08,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 64 states have (on average 1.34375) internal successors, (86), 77 states have internal predecessors, (86), 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-01-10 20:15:08,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2022-01-10 20:15:08,171 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 14 [2022-01-10 20:15:08,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:15:08,171 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2022-01-10 20:15:08,171 INFO L471 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-01-10 20:15:08,171 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2022-01-10 20:15:08,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-10 20:15:08,171 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:15:08,172 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:15:08,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 20:15:08,172 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-01-10 20:15:08,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:15:08,172 INFO L85 PathProgramCache]: Analyzing trace with hash -230842573, now seen corresponding path program 1 times [2022-01-10 20:15:08,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:15:08,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854087756] [2022-01-10 20:15:08,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:08,173 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:08,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:08,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:08,345 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:08,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854087756] [2022-01-10 20:15:08,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854087756] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:15:08,345 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:15:08,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 20:15:08,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115641555] [2022-01-10 20:15:08,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:15:08,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 20:15:08,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:15:08,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 20:15:08,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-01-10 20:15:08,347 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 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-01-10 20:15:08,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:15:08,479 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2022-01-10 20:15:08,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:15:08,479 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 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-01-10 20:15:08,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:15:08,480 INFO L225 Difference]: With dead ends: 86 [2022-01-10 20:15:08,480 INFO L226 Difference]: Without dead ends: 82 [2022-01-10 20:15:08,480 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-01-10 20:15:08,481 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 34 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:15:08,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 251 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:15:08,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-01-10 20:15:08,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2022-01-10 20:15:08,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 76 states have internal predecessors, (84), 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-01-10 20:15:08,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2022-01-10 20:15:08,486 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 14 [2022-01-10 20:15:08,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:15:08,486 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2022-01-10 20:15:08,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 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-01-10 20:15:08,486 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2022-01-10 20:15:08,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 20:15:08,486 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:15:08,486 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:15:08,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 20:15:08,487 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-01-10 20:15:08,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:15:08,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1404199927, now seen corresponding path program 1 times [2022-01-10 20:15:08,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:15:08,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829532473] [2022-01-10 20:15:08,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:08,487 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:08,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:08,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:08,651 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:08,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829532473] [2022-01-10 20:15:08,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829532473] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:15:08,653 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:15:08,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 20:15:08,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950514423] [2022-01-10 20:15:08,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:15:08,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 20:15:08,653 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:15:08,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 20:15:08,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-01-10 20:15:08,654 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 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-01-10 20:15:08,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:15:08,791 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2022-01-10 20:15:08,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 20:15:08,792 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 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-01-10 20:15:08,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:15:08,792 INFO L225 Difference]: With dead ends: 112 [2022-01-10 20:15:08,792 INFO L226 Difference]: Without dead ends: 110 [2022-01-10 20:15:08,793 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-01-10 20:15:08,793 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 82 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:15:08,793 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 270 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:15:08,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-01-10 20:15:08,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 78. [2022-01-10 20:15:08,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 64 states have (on average 1.328125) internal successors, (85), 77 states have internal predecessors, (85), 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-01-10 20:15:08,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2022-01-10 20:15:08,798 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 15 [2022-01-10 20:15:08,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:15:08,798 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2022-01-10 20:15:08,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 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-01-10 20:15:08,798 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2022-01-10 20:15:08,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 20:15:08,798 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:15:08,798 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:15:08,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 20:15:08,799 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-01-10 20:15:08,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:15:08,799 INFO L85 PathProgramCache]: Analyzing trace with hash 550908916, now seen corresponding path program 1 times [2022-01-10 20:15:08,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:15:08,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357618447] [2022-01-10 20:15:08,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:08,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:08,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:08,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:08,902 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:08,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357618447] [2022-01-10 20:15:08,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357618447] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:15:08,902 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:15:08,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 20:15:08,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099061438] [2022-01-10 20:15:08,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:15:08,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 20:15:08,903 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:15:08,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 20:15:08,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-10 20:15:08,903 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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-01-10 20:15:09,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:15:09,120 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2022-01-10 20:15:09,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 20:15:09,120 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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-01-10 20:15:09,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:15:09,121 INFO L225 Difference]: With dead ends: 132 [2022-01-10 20:15:09,121 INFO L226 Difference]: Without dead ends: 130 [2022-01-10 20:15:09,121 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-01-10 20:15:09,122 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 83 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 20:15:09,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 201 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 20:15:09,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-01-10 20:15:09,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 80. [2022-01-10 20:15:09,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 79 states have internal predecessors, (88), 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-01-10 20:15:09,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2022-01-10 20:15:09,136 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 16 [2022-01-10 20:15:09,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:15:09,136 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2022-01-10 20:15:09,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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-01-10 20:15:09,137 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2022-01-10 20:15:09,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 20:15:09,137 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:15:09,137 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:15:09,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 20:15:09,137 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-01-10 20:15:09,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:15:09,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1429332653, now seen corresponding path program 1 times [2022-01-10 20:15:09,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:15:09,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625075136] [2022-01-10 20:15:09,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:09,138 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:09,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:09,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:09,240 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:09,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625075136] [2022-01-10 20:15:09,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625075136] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:15:09,240 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:15:09,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 20:15:09,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664336750] [2022-01-10 20:15:09,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:15:09,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 20:15:09,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:15:09,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 20:15:09,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-10 20:15:09,241 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 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-01-10 20:15:09,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:15:09,505 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2022-01-10 20:15:09,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:15:09,506 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 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-01-10 20:15:09,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:15:09,506 INFO L225 Difference]: With dead ends: 130 [2022-01-10 20:15:09,506 INFO L226 Difference]: Without dead ends: 127 [2022-01-10 20:15:09,507 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-01-10 20:15:09,507 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 78 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 20:15:09,507 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 285 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 20:15:09,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-01-10 20:15:09,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 82. [2022-01-10 20:15:09,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 68 states have (on average 1.3235294117647058) internal successors, (90), 81 states have internal predecessors, (90), 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-01-10 20:15:09,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2022-01-10 20:15:09,513 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 16 [2022-01-10 20:15:09,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:15:09,513 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2022-01-10 20:15:09,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 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-01-10 20:15:09,514 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2022-01-10 20:15:09,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 20:15:09,514 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:15:09,514 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:15:09,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 20:15:09,514 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-01-10 20:15:09,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:15:09,515 INFO L85 PathProgramCache]: Analyzing trace with hash -480785159, now seen corresponding path program 1 times [2022-01-10 20:15:09,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:15:09,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992802945] [2022-01-10 20:15:09,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:09,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:09,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:09,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:09,612 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:09,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992802945] [2022-01-10 20:15:09,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992802945] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 20:15:09,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623790453] [2022-01-10 20:15:09,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:09,613 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 20:15:09,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 20:15:09,615 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-01-10 20:15:09,625 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-01-10 20:15:09,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:09,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-10 20:15:09,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 20:15:10,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 20:15:10,054 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 20:15:10,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623790453] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:15:10,054 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 20:15:10,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 12 [2022-01-10 20:15:10,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816149527] [2022-01-10 20:15:10,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:15:10,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 20:15:10,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:15:10,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 20:15:10,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-01-10 20:15:10,058 INFO L87 Difference]: Start difference. First operand 82 states and 90 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-01-10 20:15:10,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:15:10,242 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2022-01-10 20:15:10,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 20:15:10,242 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 16 [2022-01-10 20:15:10,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:15:10,243 INFO L225 Difference]: With dead ends: 116 [2022-01-10 20:15:10,243 INFO L226 Difference]: Without dead ends: 113 [2022-01-10 20:15:10,243 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-01-10 20:15:10,244 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 125 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:15:10,244 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 194 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:15:10,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-01-10 20:15:10,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 79. [2022-01-10 20:15:10,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 66 states have (on average 1.3181818181818181) internal successors, (87), 78 states have internal predecessors, (87), 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-01-10 20:15:10,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2022-01-10 20:15:10,254 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 16 [2022-01-10 20:15:10,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:15:10,254 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2022-01-10 20:15:10,254 INFO L471 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-01-10 20:15:10,255 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2022-01-10 20:15:10,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 20:15:10,256 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:15:10,256 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:15:10,283 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-01-10 20:15:10,475 WARN L452 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-01-10 20:15:10,475 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-01-10 20:15:10,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:15:10,476 INFO L85 PathProgramCache]: Analyzing trace with hash -101699009, now seen corresponding path program 1 times [2022-01-10 20:15:10,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:15:10,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791830624] [2022-01-10 20:15:10,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:10,476 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:10,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:10,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:10,530 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:10,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791830624] [2022-01-10 20:15:10,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791830624] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:15:10,530 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:15:10,530 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 20:15:10,531 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059935732] [2022-01-10 20:15:10,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:15:10,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 20:15:10,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:15:10,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 20:15:10,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 20:15:10,532 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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-01-10 20:15:10,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:15:10,771 INFO L93 Difference]: Finished difference Result 165 states and 179 transitions. [2022-01-10 20:15:10,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 20:15:10,772 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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-01-10 20:15:10,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:15:10,772 INFO L225 Difference]: With dead ends: 165 [2022-01-10 20:15:10,772 INFO L226 Difference]: Without dead ends: 163 [2022-01-10 20:15:10,773 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-10 20:15:10,773 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 107 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 20:15:10,773 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 252 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 20:15:10,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-01-10 20:15:10,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 84. [2022-01-10 20:15:10,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 83 states have internal predecessors, (95), 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-01-10 20:15:10,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 95 transitions. [2022-01-10 20:15:10,783 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 95 transitions. Word has length 17 [2022-01-10 20:15:10,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:15:10,784 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 95 transitions. [2022-01-10 20:15:10,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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-01-10 20:15:10,784 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 95 transitions. [2022-01-10 20:15:10,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 20:15:10,784 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:15:10,784 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:15:10,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 20:15:10,785 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-01-10 20:15:10,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:15:10,785 INFO L85 PathProgramCache]: Analyzing trace with hash -101691462, now seen corresponding path program 1 times [2022-01-10 20:15:10,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:15:10,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978409045] [2022-01-10 20:15:10,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:10,785 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:10,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:10,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:10,946 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:10,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978409045] [2022-01-10 20:15:10,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978409045] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:15:10,946 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:15:10,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 20:15:10,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101389556] [2022-01-10 20:15:10,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:15:10,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 20:15:10,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:15:10,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 20:15:10,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-01-10 20:15:10,947 INFO L87 Difference]: Start difference. First operand 84 states and 95 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 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-01-10 20:15:11,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:15:11,380 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2022-01-10 20:15:11,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 20:15:11,380 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 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-01-10 20:15:11,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:15:11,381 INFO L225 Difference]: With dead ends: 94 [2022-01-10 20:15:11,381 INFO L226 Difference]: Without dead ends: 90 [2022-01-10 20:15:11,381 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2022-01-10 20:15:11,382 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 138 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 20:15:11,382 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 192 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 20:15:11,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-01-10 20:15:11,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 80. [2022-01-10 20:15:11,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 68 states have (on average 1.3235294117647058) internal successors, (90), 79 states have internal predecessors, (90), 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-01-10 20:15:11,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2022-01-10 20:15:11,392 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 17 [2022-01-10 20:15:11,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:15:11,392 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2022-01-10 20:15:11,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 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-01-10 20:15:11,392 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2022-01-10 20:15:11,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 20:15:11,392 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:15:11,392 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:15:11,392 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-10 20:15:11,392 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-01-10 20:15:11,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:15:11,393 INFO L85 PathProgramCache]: Analyzing trace with hash -2019405941, now seen corresponding path program 1 times [2022-01-10 20:15:11,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:15:11,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939239424] [2022-01-10 20:15:11,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:11,393 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:11,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:11,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:11,442 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:11,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939239424] [2022-01-10 20:15:11,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939239424] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 20:15:11,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114499461] [2022-01-10 20:15:11,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:11,443 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 20:15:11,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 20:15:11,448 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-01-10 20:15:11,452 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-01-10 20:15:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:11,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-10 20:15:11,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 20:15:11,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:11,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 20:15:11,897 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:11,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114499461] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 20:15:11,897 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 20:15:11,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-01-10 20:15:11,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233703656] [2022-01-10 20:15:11,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 20:15:11,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-10 20:15:11,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:15:11,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-10 20:15:11,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-01-10 20:15:11,899 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 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-01-10 20:15:13,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:15:13,101 INFO L93 Difference]: Finished difference Result 385 states and 417 transitions. [2022-01-10 20:15:13,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 20:15:13,104 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 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-01-10 20:15:13,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:15:13,105 INFO L225 Difference]: With dead ends: 385 [2022-01-10 20:15:13,105 INFO L226 Difference]: Without dead ends: 383 [2022-01-10 20:15:13,105 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2022-01-10 20:15:13,105 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 601 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 20:15:13,106 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [601 Valid, 370 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-10 20:15:13,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2022-01-10 20:15:13,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 99. [2022-01-10 20:15:13,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 87 states have (on average 1.367816091954023) internal successors, (119), 98 states have internal predecessors, (119), 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-01-10 20:15:13,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 119 transitions. [2022-01-10 20:15:13,123 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 119 transitions. Word has length 17 [2022-01-10 20:15:13,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:15:13,123 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 119 transitions. [2022-01-10 20:15:13,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 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-01-10 20:15:13,123 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 119 transitions. [2022-01-10 20:15:13,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 20:15:13,123 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:15:13,123 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:15:13,151 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-01-10 20:15:13,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-01-10 20:15:13,341 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-01-10 20:15:13,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:15:13,342 INFO L85 PathProgramCache]: Analyzing trace with hash -2019404914, now seen corresponding path program 1 times [2022-01-10 20:15:13,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:15:13,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426283520] [2022-01-10 20:15:13,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:13,342 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:13,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:13,397 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:13,398 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:13,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426283520] [2022-01-10 20:15:13,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426283520] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 20:15:13,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080155105] [2022-01-10 20:15:13,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:13,398 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 20:15:13,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 20:15:13,399 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 20:15:13,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-10 20:15:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:13,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 24 conjunts are in the unsatisfiable core [2022-01-10 20:15:13,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 20:15:14,987 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:14,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 20:15:16,349 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:16,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080155105] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 20:15:16,349 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 20:15:16,349 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 11] total 21 [2022-01-10 20:15:16,349 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769433207] [2022-01-10 20:15:16,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 20:15:16,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-10 20:15:16,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:15:16,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-10 20:15:16,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2022-01-10 20:15:16,351 INFO L87 Difference]: Start difference. First operand 99 states and 119 transitions. Second operand has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 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-01-10 20:15:25,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:15:25,388 INFO L93 Difference]: Finished difference Result 328 states and 366 transitions. [2022-01-10 20:15:25,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-10 20:15:25,389 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 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 17 [2022-01-10 20:15:25,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:15:25,390 INFO L225 Difference]: With dead ends: 328 [2022-01-10 20:15:25,390 INFO L226 Difference]: Without dead ends: 326 [2022-01-10 20:15:25,392 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=322, Invalid=800, Unknown=0, NotChecked=0, Total=1122 [2022-01-10 20:15:25,392 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 1203 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1203 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-01-10 20:15:25,393 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1203 Valid, 669 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-01-10 20:15:25,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-01-10 20:15:25,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 100. [2022-01-10 20:15:25,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 99 states have internal predecessors, (117), 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-01-10 20:15:25,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 117 transitions. [2022-01-10 20:15:25,410 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 117 transitions. Word has length 17 [2022-01-10 20:15:25,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:15:25,411 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 117 transitions. [2022-01-10 20:15:25,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 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-01-10 20:15:25,411 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 117 transitions. [2022-01-10 20:15:25,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 20:15:25,411 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:15:25,411 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:15:25,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-10 20:15:25,626 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 20:15:25,627 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-01-10 20:15:25,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:15:25,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1142299337, now seen corresponding path program 1 times [2022-01-10 20:15:25,627 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:15:25,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240928490] [2022-01-10 20:15:25,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:25,628 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:25,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:25,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:25,908 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:25,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240928490] [2022-01-10 20:15:25,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240928490] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:15:25,909 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:15:25,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-10 20:15:25,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463750056] [2022-01-10 20:15:25,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:15:25,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-10 20:15:25,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:15:25,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-10 20:15:25,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-01-10 20:15:25,910 INFO L87 Difference]: Start difference. First operand 100 states and 117 transitions. Second operand has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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-01-10 20:15:26,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:15:26,165 INFO L93 Difference]: Finished difference Result 133 states and 155 transitions. [2022-01-10 20:15:26,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 20:15:26,166 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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-01-10 20:15:26,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:15:26,167 INFO L225 Difference]: With dead ends: 133 [2022-01-10 20:15:26,167 INFO L226 Difference]: Without dead ends: 131 [2022-01-10 20:15:26,167 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-01-10 20:15:26,168 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 134 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 20:15:26,168 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 274 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 20:15:26,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-01-10 20:15:26,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 98. [2022-01-10 20:15:26,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 87 states have (on average 1.3218390804597702) internal successors, (115), 97 states have internal predecessors, (115), 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-01-10 20:15:26,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 115 transitions. [2022-01-10 20:15:26,185 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 115 transitions. Word has length 18 [2022-01-10 20:15:26,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:15:26,185 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 115 transitions. [2022-01-10 20:15:26,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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-01-10 20:15:26,185 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 115 transitions. [2022-01-10 20:15:26,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 20:15:26,186 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:15:26,186 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:15:26,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-10 20:15:26,186 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-01-10 20:15:26,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:15:26,186 INFO L85 PathProgramCache]: Analyzing trace with hash 801850341, now seen corresponding path program 1 times [2022-01-10 20:15:26,186 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:15:26,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467621993] [2022-01-10 20:15:26,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:26,187 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:26,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:26,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:26,230 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:26,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467621993] [2022-01-10 20:15:26,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467621993] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:15:26,230 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:15:26,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 20:15:26,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340412719] [2022-01-10 20:15:26,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:15:26,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 20:15:26,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:15:26,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 20:15:26,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 20:15:26,231 INFO L87 Difference]: Start difference. First operand 98 states and 115 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-01-10 20:15:26,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:15:26,456 INFO L93 Difference]: Finished difference Result 139 states and 156 transitions. [2022-01-10 20:15:26,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 20:15:26,457 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-01-10 20:15:26,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:15:26,457 INFO L225 Difference]: With dead ends: 139 [2022-01-10 20:15:26,457 INFO L226 Difference]: Without dead ends: 137 [2022-01-10 20:15:26,458 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-10 20:15:26,458 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 77 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 20:15:26,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 204 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 20:15:26,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-01-10 20:15:26,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 99. [2022-01-10 20:15:26,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 88 states have (on average 1.3181818181818181) internal successors, (116), 98 states have internal predecessors, (116), 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-01-10 20:15:26,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 116 transitions. [2022-01-10 20:15:26,474 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 116 transitions. Word has length 18 [2022-01-10 20:15:26,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:15:26,474 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 116 transitions. [2022-01-10 20:15:26,475 INFO L471 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-01-10 20:15:26,475 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 116 transitions. [2022-01-10 20:15:26,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 20:15:26,476 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:15:26,476 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:15:26,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-10 20:15:26,476 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-01-10 20:15:26,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:15:26,476 INFO L85 PathProgramCache]: Analyzing trace with hash 801882153, now seen corresponding path program 1 times [2022-01-10 20:15:26,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:15:26,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354914822] [2022-01-10 20:15:26,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:26,477 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:26,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:26,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:26,546 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:26,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354914822] [2022-01-10 20:15:26,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354914822] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:15:26,546 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:15:26,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 20:15:26,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316950834] [2022-01-10 20:15:26,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:15:26,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 20:15:26,547 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:15:26,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 20:15:26,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 20:15:26,548 INFO L87 Difference]: Start difference. First operand 99 states and 116 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-01-10 20:15:26,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:15:26,720 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2022-01-10 20:15:26,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 20:15:26,721 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-01-10 20:15:26,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:15:26,722 INFO L225 Difference]: With dead ends: 116 [2022-01-10 20:15:26,722 INFO L226 Difference]: Without dead ends: 114 [2022-01-10 20:15:26,722 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-10 20:15:26,722 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 45 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:15:26,723 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 175 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:15:26,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-01-10 20:15:26,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 100. [2022-01-10 20:15:26,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 89 states have (on average 1.3146067415730338) internal successors, (117), 99 states have internal predecessors, (117), 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-01-10 20:15:26,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 117 transitions. [2022-01-10 20:15:26,742 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 117 transitions. Word has length 18 [2022-01-10 20:15:26,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:15:26,742 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 117 transitions. [2022-01-10 20:15:26,743 INFO L471 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-01-10 20:15:26,743 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 117 transitions. [2022-01-10 20:15:26,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 20:15:26,744 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:15:26,744 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:15:26,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-10 20:15:26,744 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-01-10 20:15:26,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:15:26,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1822926573, now seen corresponding path program 1 times [2022-01-10 20:15:26,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:15:26,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231556684] [2022-01-10 20:15:26,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:26,745 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:26,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:26,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:26,938 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:26,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231556684] [2022-01-10 20:15:26,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231556684] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 20:15:26,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839720485] [2022-01-10 20:15:26,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:26,939 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 20:15:26,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 20:15:26,944 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 20:15:26,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-10 20:15:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:27,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 22 conjunts are in the unsatisfiable core [2022-01-10 20:15:27,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 20:15:27,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:27,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 20:15:28,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:28,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839720485] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 20:15:28,151 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 20:15:28,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 23 [2022-01-10 20:15:28,152 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883510995] [2022-01-10 20:15:28,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 20:15:28,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-10 20:15:28,152 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:15:28,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-10 20:15:28,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2022-01-10 20:15:28,153 INFO L87 Difference]: Start difference. First operand 100 states and 117 transitions. Second operand has 23 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 23 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-01-10 20:15:29,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:15:29,400 INFO L93 Difference]: Finished difference Result 216 states and 240 transitions. [2022-01-10 20:15:29,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-10 20:15:29,400 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 23 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-01-10 20:15:29,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:15:29,401 INFO L225 Difference]: With dead ends: 216 [2022-01-10 20:15:29,401 INFO L226 Difference]: Without dead ends: 214 [2022-01-10 20:15:29,402 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=307, Invalid=953, Unknown=0, NotChecked=0, Total=1260 [2022-01-10 20:15:29,402 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 820 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-10 20:15:29,402 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [820 Valid, 327 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-10 20:15:29,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-01-10 20:15:29,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 98. [2022-01-10 20:15:29,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 88 states have (on average 1.3068181818181819) internal successors, (115), 97 states have internal predecessors, (115), 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-01-10 20:15:29,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 115 transitions. [2022-01-10 20:15:29,420 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 115 transitions. Word has length 18 [2022-01-10 20:15:29,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:15:29,420 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 115 transitions. [2022-01-10 20:15:29,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 23 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-01-10 20:15:29,421 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 115 transitions. [2022-01-10 20:15:29,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 20:15:29,421 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:15:29,421 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:15:29,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-10 20:15:29,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-01-10 20:15:29,635 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-01-10 20:15:29,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:15:29,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1822958412, now seen corresponding path program 1 times [2022-01-10 20:15:29,635 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:15:29,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595960978] [2022-01-10 20:15:29,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:29,635 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:29,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:29,815 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:29,815 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:29,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595960978] [2022-01-10 20:15:29,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595960978] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 20:15:29,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350912051] [2022-01-10 20:15:29,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:29,816 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 20:15:29,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 20:15:29,817 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 20:15:29,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-10 20:15:30,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:30,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 22 conjunts are in the unsatisfiable core [2022-01-10 20:15:30,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 20:15:30,342 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:30,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 20:15:31,203 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:31,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350912051] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 20:15:31,204 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 20:15:31,204 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 23 [2022-01-10 20:15:31,204 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845260982] [2022-01-10 20:15:31,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 20:15:31,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-10 20:15:31,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:15:31,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-10 20:15:31,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2022-01-10 20:15:31,205 INFO L87 Difference]: Start difference. First operand 98 states and 115 transitions. Second operand has 23 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 23 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-01-10 20:15:32,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:15:32,309 INFO L93 Difference]: Finished difference Result 191 states and 213 transitions. [2022-01-10 20:15:32,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-10 20:15:32,309 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 23 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-01-10 20:15:32,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:15:32,310 INFO L225 Difference]: With dead ends: 191 [2022-01-10 20:15:32,310 INFO L226 Difference]: Without dead ends: 189 [2022-01-10 20:15:32,311 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=307, Invalid=953, Unknown=0, NotChecked=0, Total=1260 [2022-01-10 20:15:32,311 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 485 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 20:15:32,311 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [485 Valid, 426 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 20:15:32,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-01-10 20:15:32,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 96. [2022-01-10 20:15:32,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 87 states have (on average 1.264367816091954) internal successors, (110), 95 states have internal predecessors, (110), 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-01-10 20:15:32,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 110 transitions. [2022-01-10 20:15:32,333 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 110 transitions. Word has length 18 [2022-01-10 20:15:32,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:15:32,333 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 110 transitions. [2022-01-10 20:15:32,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 23 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-01-10 20:15:32,333 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 110 transitions. [2022-01-10 20:15:32,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 20:15:32,333 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:15:32,334 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:15:32,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-10 20:15:32,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-01-10 20:15:32,539 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-01-10 20:15:32,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:15:32,539 INFO L85 PathProgramCache]: Analyzing trace with hash -912441897, now seen corresponding path program 1 times [2022-01-10 20:15:32,539 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:15:32,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156767960] [2022-01-10 20:15:32,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:32,540 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:32,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:33,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:33,109 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:33,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156767960] [2022-01-10 20:15:33,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156767960] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:15:33,109 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:15:33,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-10 20:15:33,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750989118] [2022-01-10 20:15:33,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:15:33,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-10 20:15:33,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:15:33,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-10 20:15:33,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-01-10 20:15:33,110 INFO L87 Difference]: Start difference. First operand 96 states and 110 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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-01-10 20:15:34,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:15:34,678 INFO L93 Difference]: Finished difference Result 134 states and 152 transitions. [2022-01-10 20:15:34,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 20:15:34,678 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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-01-10 20:15:34,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:15:34,679 INFO L225 Difference]: With dead ends: 134 [2022-01-10 20:15:34,679 INFO L226 Difference]: Without dead ends: 132 [2022-01-10 20:15:34,679 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-01-10 20:15:34,680 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 116 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 20:15:34,680 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 272 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 20:15:34,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-01-10 20:15:34,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 101. [2022-01-10 20:15:34,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 92 states have (on average 1.2717391304347827) internal successors, (117), 100 states have internal predecessors, (117), 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-01-10 20:15:34,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2022-01-10 20:15:34,696 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 117 transitions. Word has length 19 [2022-01-10 20:15:34,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:15:34,696 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 117 transitions. [2022-01-10 20:15:34,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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-01-10 20:15:34,696 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2022-01-10 20:15:34,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 20:15:34,696 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:15:34,696 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:15:34,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-10 20:15:34,697 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-01-10 20:15:34,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:15:34,697 INFO L85 PathProgramCache]: Analyzing trace with hash -911455717, now seen corresponding path program 1 times [2022-01-10 20:15:34,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:15:34,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981908930] [2022-01-10 20:15:34,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:34,697 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:34,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:34,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:34,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:34,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981908930] [2022-01-10 20:15:34,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981908930] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:15:34,930 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:15:34,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-10 20:15:34,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404294549] [2022-01-10 20:15:34,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:15:34,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-10 20:15:34,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:15:34,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-10 20:15:34,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-01-10 20:15:34,931 INFO L87 Difference]: Start difference. First operand 101 states and 117 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 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-01-10 20:15:35,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:15:35,108 INFO L93 Difference]: Finished difference Result 101 states and 117 transitions. [2022-01-10 20:15:35,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 20:15:35,109 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 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-01-10 20:15:35,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:15:35,109 INFO L225 Difference]: With dead ends: 101 [2022-01-10 20:15:35,109 INFO L226 Difference]: Without dead ends: 97 [2022-01-10 20:15:35,110 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-01-10 20:15:35,110 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 121 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:15:35,110 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 130 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:15:35,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-01-10 20:15:35,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-01-10 20:15:35,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 89 states have (on average 1.2584269662921348) internal successors, (112), 96 states have internal predecessors, (112), 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-01-10 20:15:35,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 112 transitions. [2022-01-10 20:15:35,125 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 112 transitions. Word has length 19 [2022-01-10 20:15:35,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:15:35,125 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 112 transitions. [2022-01-10 20:15:35,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 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-01-10 20:15:35,125 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 112 transitions. [2022-01-10 20:15:35,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-10 20:15:35,125 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:15:35,125 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:15:35,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-10 20:15:35,126 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-01-10 20:15:35,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:15:35,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1761996984, now seen corresponding path program 1 times [2022-01-10 20:15:35,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:15:35,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719335026] [2022-01-10 20:15:35,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:35,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:35,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:35,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:35,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719335026] [2022-01-10 20:15:35,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719335026] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 20:15:35,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657094314] [2022-01-10 20:15:35,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:35,273 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 20:15:35,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 20:15:35,276 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 20:15:35,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-10 20:15:35,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:35,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-10 20:15:35,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 20:15:35,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 20:15:35,520 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 20:15:35,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657094314] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:15:35,520 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 20:15:35,520 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 12 [2022-01-10 20:15:35,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803561807] [2022-01-10 20:15:35,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:15:35,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 20:15:35,520 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:15:35,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 20:15:35,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-01-10 20:15:35,521 INFO L87 Difference]: Start difference. First operand 97 states and 112 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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-01-10 20:15:35,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:15:35,665 INFO L93 Difference]: Finished difference Result 123 states and 141 transitions. [2022-01-10 20:15:35,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 20:15:35,666 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 20 [2022-01-10 20:15:35,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:15:35,666 INFO L225 Difference]: With dead ends: 123 [2022-01-10 20:15:35,666 INFO L226 Difference]: Without dead ends: 119 [2022-01-10 20:15:35,666 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-01-10 20:15:35,667 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 76 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:15:35,667 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 125 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:15:35,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-01-10 20:15:35,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 94. [2022-01-10 20:15:35,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 87 states have (on average 1.2528735632183907) internal successors, (109), 93 states have internal predecessors, (109), 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-01-10 20:15:35,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 109 transitions. [2022-01-10 20:15:35,683 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 109 transitions. Word has length 20 [2022-01-10 20:15:35,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:15:35,683 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 109 transitions. [2022-01-10 20:15:35,683 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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-01-10 20:15:35,683 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 109 transitions. [2022-01-10 20:15:35,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-10 20:15:35,683 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:15:35,683 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:15:35,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-10 20:15:35,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 20:15:35,884 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-01-10 20:15:35,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:15:35,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1984475308, now seen corresponding path program 1 times [2022-01-10 20:15:35,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:15:35,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997076174] [2022-01-10 20:15:35,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:35,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:35,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:36,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:36,056 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:36,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997076174] [2022-01-10 20:15:36,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997076174] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 20:15:36,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918091700] [2022-01-10 20:15:36,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:36,056 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 20:15:36,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 20:15:36,058 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 20:15:36,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-10 20:15:36,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:36,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-10 20:15:36,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 20:15:36,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:36,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 20:15:36,926 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:36,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918091700] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 20:15:36,926 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 20:15:36,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 7] total 21 [2022-01-10 20:15:36,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224271962] [2022-01-10 20:15:36,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 20:15:36,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-10 20:15:36,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:15:36,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-10 20:15:36,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2022-01-10 20:15:36,927 INFO L87 Difference]: Start difference. First operand 94 states and 109 transitions. Second operand has 21 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 21 states have internal predecessors, (48), 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-01-10 20:15:37,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:15:37,375 INFO L93 Difference]: Finished difference Result 117 states and 135 transitions. [2022-01-10 20:15:37,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-10 20:15:37,376 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 21 states have internal predecessors, (48), 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 20 [2022-01-10 20:15:37,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:15:37,376 INFO L225 Difference]: With dead ends: 117 [2022-01-10 20:15:37,376 INFO L226 Difference]: Without dead ends: 115 [2022-01-10 20:15:37,377 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2022-01-10 20:15:37,377 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 229 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 20:15:37,377 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [229 Valid, 334 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 20:15:37,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-01-10 20:15:37,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 87. [2022-01-10 20:15:37,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 81 states have (on average 1.2345679012345678) internal successors, (100), 86 states have internal predecessors, (100), 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-01-10 20:15:37,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 100 transitions. [2022-01-10 20:15:37,396 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 100 transitions. Word has length 20 [2022-01-10 20:15:37,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:15:37,396 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 100 transitions. [2022-01-10 20:15:37,396 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 21 states have internal predecessors, (48), 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-01-10 20:15:37,396 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 100 transitions. [2022-01-10 20:15:37,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 20:15:37,396 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:15:37,397 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:15:37,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-01-10 20:15:37,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 20:15:37,601 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-01-10 20:15:37,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:15:37,601 INFO L85 PathProgramCache]: Analyzing trace with hash -683293476, now seen corresponding path program 1 times [2022-01-10 20:15:37,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:15:37,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242200070] [2022-01-10 20:15:37,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:37,601 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:37,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:37,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:37,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:37,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242200070] [2022-01-10 20:15:37,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242200070] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:15:37,729 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:15:37,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 20:15:37,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509596417] [2022-01-10 20:15:37,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:15:37,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 20:15:37,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:15:37,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 20:15:37,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-01-10 20:15:37,731 INFO L87 Difference]: Start difference. First operand 87 states and 100 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 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-01-10 20:15:38,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:15:38,308 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2022-01-10 20:15:38,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 20:15:38,309 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 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 21 [2022-01-10 20:15:38,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:15:38,309 INFO L225 Difference]: With dead ends: 97 [2022-01-10 20:15:38,309 INFO L226 Difference]: Without dead ends: 94 [2022-01-10 20:15:38,310 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2022-01-10 20:15:38,310 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 127 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 20:15:38,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 140 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 20:15:38,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-01-10 20:15:38,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 84. [2022-01-10 20:15:38,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 83 states have internal predecessors, (97), 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-01-10 20:15:38,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 97 transitions. [2022-01-10 20:15:38,324 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 97 transitions. Word has length 21 [2022-01-10 20:15:38,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:15:38,324 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 97 transitions. [2022-01-10 20:15:38,324 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 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-01-10 20:15:38,324 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 97 transitions. [2022-01-10 20:15:38,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 20:15:38,324 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:15:38,324 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:15:38,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-10 20:15:38,325 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-01-10 20:15:38,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:15:38,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1060991846, now seen corresponding path program 1 times [2022-01-10 20:15:38,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:15:38,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226018866] [2022-01-10 20:15:38,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:38,325 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:38,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:38,426 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:38,426 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:38,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226018866] [2022-01-10 20:15:38,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226018866] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 20:15:38,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219675861] [2022-01-10 20:15:38,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:38,426 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 20:15:38,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 20:15:38,427 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 20:15:38,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-10 20:15:38,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:38,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 27 conjunts are in the unsatisfiable core [2022-01-10 20:15:38,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 20:15:39,326 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:39,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 20:15:43,123 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:43,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219675861] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 20:15:43,123 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 20:15:43,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 29 [2022-01-10 20:15:43,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837554599] [2022-01-10 20:15:43,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 20:15:43,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-10 20:15:43,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:15:43,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-10 20:15:43,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=631, Unknown=0, NotChecked=0, Total=812 [2022-01-10 20:15:43,125 INFO L87 Difference]: Start difference. First operand 84 states and 97 transitions. Second operand has 29 states, 29 states have (on average 2.0) internal successors, (58), 29 states have internal predecessors, (58), 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-01-10 20:15:48,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:15:48,855 INFO L93 Difference]: Finished difference Result 217 states and 249 transitions. [2022-01-10 20:15:48,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-01-10 20:15:48,858 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.0) internal successors, (58), 29 states have internal predecessors, (58), 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 22 [2022-01-10 20:15:48,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:15:48,859 INFO L225 Difference]: With dead ends: 217 [2022-01-10 20:15:48,859 INFO L226 Difference]: Without dead ends: 215 [2022-01-10 20:15:48,860 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2268 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1833, Invalid=4809, Unknown=0, NotChecked=0, Total=6642 [2022-01-10 20:15:48,860 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 1310 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1310 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-10 20:15:48,861 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1310 Valid, 349 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-10 20:15:48,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-01-10 20:15:48,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 90. [2022-01-10 20:15:48,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 85 states have (on average 1.2352941176470589) internal successors, (105), 89 states have internal predecessors, (105), 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-01-10 20:15:48,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 105 transitions. [2022-01-10 20:15:48,880 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 105 transitions. Word has length 22 [2022-01-10 20:15:48,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:15:48,880 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 105 transitions. [2022-01-10 20:15:48,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.0) internal successors, (58), 29 states have internal predecessors, (58), 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-01-10 20:15:48,881 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 105 transitions. [2022-01-10 20:15:48,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 20:15:48,881 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:15:48,881 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:15:48,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-10 20:15:49,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-01-10 20:15:49,086 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-01-10 20:15:49,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:15:49,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1060960034, now seen corresponding path program 1 times [2022-01-10 20:15:49,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:15:49,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638431981] [2022-01-10 20:15:49,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:49,087 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:49,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:49,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:49,194 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:49,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638431981] [2022-01-10 20:15:49,194 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638431981] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 20:15:49,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557366923] [2022-01-10 20:15:49,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:49,194 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 20:15:49,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 20:15:49,195 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 20:15:49,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-10 20:15:49,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:49,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 31 conjunts are in the unsatisfiable core [2022-01-10 20:15:49,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 20:15:57,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:57,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 20:16:02,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:16:02,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557366923] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 20:16:02,354 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 20:16:02,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 29 [2022-01-10 20:16:02,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487432137] [2022-01-10 20:16:02,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 20:16:02,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-10 20:16:02,355 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:16:02,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-10 20:16:02,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=572, Unknown=0, NotChecked=0, Total=812 [2022-01-10 20:16:02,356 INFO L87 Difference]: Start difference. First operand 90 states and 105 transitions. Second operand has 29 states, 29 states have (on average 2.0) internal successors, (58), 29 states have internal predecessors, (58), 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)