/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_SUM.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 02:02:23,659 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 02:02:23,661 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 02:02:23,716 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 02:02:23,717 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 02:02:23,719 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 02:02:23,721 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 02:02:23,722 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 02:02:23,722 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 02:02:23,723 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 02:02:23,723 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 02:02:23,724 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 02:02:23,724 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 02:02:23,725 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 02:02:23,725 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 02:02:23,726 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 02:02:23,726 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 02:02:23,727 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 02:02:23,728 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 02:02:23,729 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 02:02:23,730 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 02:02:23,731 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 02:02:23,731 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 02:02:23,732 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 02:02:23,734 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 02:02:23,734 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 02:02:23,734 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 02:02:23,735 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 02:02:23,735 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 02:02:23,735 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 02:02:23,736 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 02:02:23,736 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 02:02:23,737 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 02:02:23,737 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 02:02:23,738 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 02:02:23,738 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 02:02:23,738 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 02:02:23,739 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 02:02:23,739 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 02:02:23,739 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 02:02:23,740 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 02:02:23,740 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf [2022-01-11 02:02:23,752 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 02:02:23,752 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 02:02:23,752 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 02:02:23,752 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 02:02:23,753 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 02:02:23,753 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 02:02:23,753 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 02:02:23,753 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 02:02:23,753 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 02:02:23,753 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 02:02:23,754 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 02:02:23,754 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 02:02:23,754 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 02:02:23,754 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 02:02:23,754 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 02:02:23,754 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 02:02:23,754 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 02:02:23,754 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 02:02:23,754 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 02:02:23,754 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 02:02:23,754 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 02:02:23,754 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 02:02:23,755 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 02:02:23,755 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 02:02:23,755 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 02:02:23,755 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 02:02:23,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 02:02:23,755 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 02:02:23,755 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 02:02:23,755 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 02:02:23,755 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 02:02:23,755 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 02:02:23,756 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 02:02:23,756 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_SUM 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-11 02:02:23,932 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 02:02:23,951 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 02:02:23,953 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 02:02:23,953 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 02:02:23,955 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 02:02:23,956 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.p+sep-reducer.c [2022-01-11 02:02:23,999 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/988004fbb/ad84a00004ad4551b8bfb923af846bc1/FLAG8d2a39aaa [2022-01-11 02:02:24,446 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 02:02:24,447 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c [2022-01-11 02:02:24,466 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/988004fbb/ad84a00004ad4551b8bfb923af846bc1/FLAG8d2a39aaa [2022-01-11 02:02:24,973 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/988004fbb/ad84a00004ad4551b8bfb923af846bc1 [2022-01-11 02:02:24,975 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 02:02:24,976 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 02:02:24,977 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 02:02:24,977 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 02:02:24,980 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 02:02:24,980 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 02:02:24" (1/1) ... [2022-01-11 02:02:24,981 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@345f6fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 02:02:24, skipping insertion in model container [2022-01-11 02:02:24,981 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 02:02:24" (1/1) ... [2022-01-11 02:02:24,986 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 02:02:25,069 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 02:02:25,207 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.p+sep-reducer.c[1000,1013] [2022-01-11 02:02:25,209 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.p+sep-reducer.c[1215,1228] [2022-01-11 02:02:25,475 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.p+sep-reducer.c[83573,83586] [2022-01-11 02:02:25,480 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.p+sep-reducer.c[83794,83807] [2022-01-11 02:02:25,491 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.p+sep-reducer.c[84257,84270] [2022-01-11 02:02:25,494 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.p+sep-reducer.c[84478,84491] [2022-01-11 02:02:25,498 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.p+sep-reducer.c[84801,84814] [2022-01-11 02:02:25,502 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.p+sep-reducer.c[85022,85035] [2022-01-11 02:02:25,506 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.p+sep-reducer.c[85521,85534] [2022-01-11 02:02:25,518 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.p+sep-reducer.c[85742,85755] [2022-01-11 02:02:25,522 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.p+sep-reducer.c[86050,86063] [2022-01-11 02:02:25,524 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.p+sep-reducer.c[86271,86284] [2022-01-11 02:02:25,527 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.p+sep-reducer.c[86594,86607] [2022-01-11 02:02:25,534 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.p+sep-reducer.c[86815,86828] [2022-01-11 02:02:25,539 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.p+sep-reducer.c[87258,87271] [2022-01-11 02:02:25,542 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.p+sep-reducer.c[87479,87492] [2022-01-11 02:02:25,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 02:02:25,564 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 02:02:25,573 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.p+sep-reducer.c[1000,1013] [2022-01-11 02:02:25,577 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.p+sep-reducer.c[1215,1228] [2022-01-11 02:02:25,760 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.p+sep-reducer.c[83573,83586] [2022-01-11 02:02:25,762 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.p+sep-reducer.c[83794,83807] [2022-01-11 02:02:25,765 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.p+sep-reducer.c[84257,84270] [2022-01-11 02:02:25,768 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.p+sep-reducer.c[84478,84491] [2022-01-11 02:02:25,770 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.p+sep-reducer.c[84801,84814] [2022-01-11 02:02:25,773 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.p+sep-reducer.c[85022,85035] [2022-01-11 02:02:25,776 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.p+sep-reducer.c[85521,85534] [2022-01-11 02:02:25,778 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.p+sep-reducer.c[85742,85755] [2022-01-11 02:02:25,781 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.p+sep-reducer.c[86050,86063] [2022-01-11 02:02:25,783 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.p+sep-reducer.c[86271,86284] [2022-01-11 02:02:25,785 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.p+sep-reducer.c[86594,86607] [2022-01-11 02:02:25,788 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.p+sep-reducer.c[86815,86828] [2022-01-11 02:02:25,791 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.p+sep-reducer.c[87258,87271] [2022-01-11 02:02:25,793 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.p+sep-reducer.c[87479,87492] [2022-01-11 02:02:25,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 02:02:25,807 INFO L208 MainTranslator]: Completed translation [2022-01-11 02:02:25,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 02:02:25 WrapperNode [2022-01-11 02:02:25,807 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 02:02:25,808 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 02:02:25,808 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 02:02:25,808 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 02:02:25,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 02:02:25" (1/1) ... [2022-01-11 02:02:25,855 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 02:02:25" (1/1) ... [2022-01-11 02:02:25,941 INFO L137 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2954 [2022-01-11 02:02:25,941 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 02:02:25,942 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 02:02:25,942 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 02:02:25,942 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 02:02:25,947 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 02:02:25" (1/1) ... [2022-01-11 02:02:25,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 02:02:25" (1/1) ... [2022-01-11 02:02:25,955 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 02:02:25" (1/1) ... [2022-01-11 02:02:25,955 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 02:02:25" (1/1) ... [2022-01-11 02:02:25,975 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 02:02:25" (1/1) ... [2022-01-11 02:02:25,995 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 02:02:25" (1/1) ... [2022-01-11 02:02:26,012 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 02:02:25" (1/1) ... [2022-01-11 02:02:26,021 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 02:02:26,022 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 02:02:26,022 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 02:02:26,022 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 02:02:26,030 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 02:02:25" (1/1) ... [2022-01-11 02:02:26,035 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 02:02:26,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 02:02:26,052 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-11 02:02:26,070 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-11 02:02:26,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 02:02:26,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 02:02:26,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 02:02:26,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 02:02:26,317 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 02:02:26,319 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 02:02:27,561 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 02:02:27,572 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 02:02:27,573 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-11 02:02:27,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 02:02:27 BoogieIcfgContainer [2022-01-11 02:02:27,575 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 02:02:27,575 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 02:02:27,575 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 02:02:27,577 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 02:02:27,578 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 02:02:27" (1/1) ... [2022-01-11 02:02:27,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 02:02:27 BasicIcfg [2022-01-11 02:02:27,934 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 02:02:27,936 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 02:02:27,936 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 02:02:27,938 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 02:02:27,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 02:02:24" (1/4) ... [2022-01-11 02:02:27,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b9b972a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 02:02:27, skipping insertion in model container [2022-01-11 02:02:27,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 02:02:25" (2/4) ... [2022-01-11 02:02:27,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b9b972a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 02:02:27, skipping insertion in model container [2022-01-11 02:02:27,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 02:02:27" (3/4) ... [2022-01-11 02:02:27,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b9b972a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 02:02:27, skipping insertion in model container [2022-01-11 02:02:27,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 02:02:27" (4/4) ... [2022-01-11 02:02:27,940 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+sep-reducer.cTransformedIcfg [2022-01-11 02:02:27,944 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 02:02:27,944 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-01-11 02:02:27,982 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 02:02:27,994 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-11 02:02:27,994 INFO L340 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-01-11 02:02:28,016 INFO L276 IsEmpty]: Start isEmpty. Operand has 475 states, 458 states have (on average 1.9672489082969433) internal successors, (901), 474 states have internal predecessors, (901), 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-11 02:02:28,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-01-11 02:02:28,019 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 02:02:28,019 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-01-11 02:02:28,020 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-11 02:02:28,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 02:02:28,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1357103806, now seen corresponding path program 1 times [2022-01-11 02:02:28,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 02:02:28,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17708732] [2022-01-11 02:02:28,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 02:02:28,030 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 02:02:28,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 02:02:28,232 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-11 02:02:28,233 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 02:02:28,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17708732] [2022-01-11 02:02:28,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17708732] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 02:02:28,234 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 02:02:28,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 02:02:28,235 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266893115] [2022-01-11 02:02:28,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 02:02:28,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 02:02:28,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 02:02:28,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 02:02:28,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 02:02:28,300 INFO L87 Difference]: Start difference. First operand has 475 states, 458 states have (on average 1.9672489082969433) internal successors, (901), 474 states have internal predecessors, (901), 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 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-11 02:02:29,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 02:02:29,036 INFO L93 Difference]: Finished difference Result 496 states and 920 transitions. [2022-01-11 02:02:29,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 02:02:29,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2022-01-11 02:02:29,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 02:02:29,051 INFO L225 Difference]: With dead ends: 496 [2022-01-11 02:02:29,051 INFO L226 Difference]: Without dead ends: 304 [2022-01-11 02:02:29,054 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 02:02:29,060 INFO L933 BasicCegarLoop]: 880 mSDtfsCounter, 30 mSDsluCounter, 1211 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 2091 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-11 02:02:29,068 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 2091 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-11 02:02:29,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-01-11 02:02:29,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 301. [2022-01-11 02:02:29,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 285 states have (on average 1.2771929824561403) internal successors, (364), 300 states have internal predecessors, (364), 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-11 02:02:29,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 364 transitions. [2022-01-11 02:02:29,119 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 364 transitions. Word has length 7 [2022-01-11 02:02:29,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 02:02:29,122 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 364 transitions. [2022-01-11 02:02:29,122 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-11 02:02:29,122 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 364 transitions. [2022-01-11 02:02:29,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-01-11 02:02:29,122 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 02:02:29,122 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 02:02:29,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 02:02:29,123 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-11 02:02:29,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 02:02:29,124 INFO L85 PathProgramCache]: Analyzing trace with hash -879451729, now seen corresponding path program 1 times [2022-01-11 02:02:29,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 02:02:29,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447163343] [2022-01-11 02:02:29,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 02:02:29,125 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 02:02:29,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 02:02:29,297 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-11 02:02:29,297 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 02:02:29,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447163343] [2022-01-11 02:02:29,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447163343] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 02:02:29,298 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 02:02:29,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 02:02:29,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239316602] [2022-01-11 02:02:29,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 02:02:29,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 02:02:29,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 02:02:29,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 02:02:29,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-11 02:02:29,300 INFO L87 Difference]: Start difference. First operand 301 states and 364 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 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-11 02:02:29,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 02:02:29,684 INFO L93 Difference]: Finished difference Result 304 states and 366 transitions. [2022-01-11 02:02:29,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 02:02:29,684 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 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-11 02:02:29,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 02:02:29,686 INFO L225 Difference]: With dead ends: 304 [2022-01-11 02:02:29,686 INFO L226 Difference]: Without dead ends: 299 [2022-01-11 02:02:29,687 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-01-11 02:02:29,687 INFO L933 BasicCegarLoop]: 355 mSDtfsCounter, 10 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-11 02:02:29,688 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 747 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-11 02:02:29,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-01-11 02:02:29,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2022-01-11 02:02:29,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 283 states have (on average 1.2756183745583038) internal successors, (361), 298 states have internal predecessors, (361), 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-11 02:02:29,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 361 transitions. [2022-01-11 02:02:29,696 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 361 transitions. Word has length 8 [2022-01-11 02:02:29,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 02:02:29,697 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 361 transitions. [2022-01-11 02:02:29,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 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-11 02:02:29,697 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 361 transitions. [2022-01-11 02:02:29,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-11 02:02:29,697 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 02:02:29,697 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 02:02:29,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 02:02:29,698 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-11 02:02:29,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 02:02:29,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1101661551, now seen corresponding path program 1 times [2022-01-11 02:02:29,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 02:02:29,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059479992] [2022-01-11 02:02:29,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 02:02:29,698 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 02:02:29,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 02:02:29,837 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-11 02:02:29,838 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 02:02:29,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059479992] [2022-01-11 02:02:29,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059479992] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 02:02:29,838 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 02:02:29,838 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-11 02:02:29,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579110658] [2022-01-11 02:02:29,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 02:02:29,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-11 02:02:29,839 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 02:02:29,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-11 02:02:29,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-11 02:02:29,840 INFO L87 Difference]: Start difference. First operand 299 states and 361 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-11 02:02:30,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 02:02:30,578 INFO L93 Difference]: Finished difference Result 306 states and 367 transitions. [2022-01-11 02:02:30,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 02:02:30,578 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-11 02:02:30,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 02:02:30,580 INFO L225 Difference]: With dead ends: 306 [2022-01-11 02:02:30,580 INFO L226 Difference]: Without dead ends: 304 [2022-01-11 02:02:30,580 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-01-11 02:02:30,581 INFO L933 BasicCegarLoop]: 350 mSDtfsCounter, 15 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 1293 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 1297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-11 02:02:30,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 852 Invalid, 1297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1293 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-11 02:02:30,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-01-11 02:02:30,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 301. [2022-01-11 02:02:30,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 285 states have (on average 1.2736842105263158) internal successors, (363), 300 states have internal predecessors, (363), 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-11 02:02:30,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 363 transitions. [2022-01-11 02:02:30,589 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 363 transitions. Word has length 11 [2022-01-11 02:02:30,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 02:02:30,589 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 363 transitions. [2022-01-11 02:02:30,589 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-11 02:02:30,589 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 363 transitions. [2022-01-11 02:02:30,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-11 02:02:30,590 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 02:02:30,590 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 02:02:30,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 02:02:30,590 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-11 02:02:30,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 02:02:30,590 INFO L85 PathProgramCache]: Analyzing trace with hash 208233532, now seen corresponding path program 1 times [2022-01-11 02:02:30,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 02:02:30,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006659905] [2022-01-11 02:02:30,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 02:02:30,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 02:02:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 02:02:30,759 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-11 02:02:30,759 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 02:02:30,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006659905] [2022-01-11 02:02:30,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006659905] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 02:02:30,760 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 02:02:30,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-11 02:02:30,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126282093] [2022-01-11 02:02:30,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 02:02:30,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-11 02:02:30,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 02:02:30,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-11 02:02:30,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-11 02:02:30,762 INFO L87 Difference]: Start difference. First operand 301 states and 363 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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-11 02:02:31,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 02:02:31,637 INFO L93 Difference]: Finished difference Result 301 states and 363 transitions. [2022-01-11 02:02:31,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 02:02:31,638 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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-11 02:02:31,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 02:02:31,639 INFO L225 Difference]: With dead ends: 301 [2022-01-11 02:02:31,639 INFO L226 Difference]: Without dead ends: 296 [2022-01-11 02:02:31,640 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-01-11 02:02:31,640 INFO L933 BasicCegarLoop]: 346 mSDtfsCounter, 23 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 1478 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 1542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-11 02:02:31,641 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 856 Invalid, 1542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1478 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-11 02:02:31,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-01-11 02:02:31,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-01-11 02:02:31,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 281 states have (on average 1.2704626334519573) internal successors, (357), 295 states have internal predecessors, (357), 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-11 02:02:31,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 357 transitions. [2022-01-11 02:02:31,646 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 357 transitions. Word has length 12 [2022-01-11 02:02:31,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 02:02:31,646 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 357 transitions. [2022-01-11 02:02:31,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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-11 02:02:31,646 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 357 transitions. [2022-01-11 02:02:31,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-11 02:02:31,647 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 02:02:31,647 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 02:02:31,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 02:02:31,647 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-11 02:02:31,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 02:02:31,648 INFO L85 PathProgramCache]: Analyzing trace with hash 894112894, now seen corresponding path program 1 times [2022-01-11 02:02:31,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 02:02:31,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769079804] [2022-01-11 02:02:31,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 02:02:31,648 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 02:02:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 02:02:31,794 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-11 02:02:31,794 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 02:02:31,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769079804] [2022-01-11 02:02:31,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769079804] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 02:02:31,795 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 02:02:31,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-11 02:02:31,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627076584] [2022-01-11 02:02:31,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 02:02:31,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-11 02:02:31,795 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 02:02:31,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-11 02:02:31,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-11 02:02:31,796 INFO L87 Difference]: Start difference. First operand 296 states and 357 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 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-11 02:02:32,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 02:02:32,687 INFO L93 Difference]: Finished difference Result 300 states and 360 transitions. [2022-01-11 02:02:32,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-11 02:02:32,687 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 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-11 02:02:32,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 02:02:32,688 INFO L225 Difference]: With dead ends: 300 [2022-01-11 02:02:32,688 INFO L226 Difference]: Without dead ends: 296 [2022-01-11 02:02:32,689 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-01-11 02:02:32,689 INFO L933 BasicCegarLoop]: 343 mSDtfsCounter, 7 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 1612 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 1614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-11 02:02:32,690 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 869 Invalid, 1614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1612 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-11 02:02:32,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-01-11 02:02:32,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-01-11 02:02:32,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 281 states have (on average 1.2669039145907472) internal successors, (356), 295 states have internal predecessors, (356), 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-11 02:02:32,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 356 transitions. [2022-01-11 02:02:32,694 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 356 transitions. Word has length 15 [2022-01-11 02:02:32,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 02:02:32,694 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 356 transitions. [2022-01-11 02:02:32,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 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-11 02:02:32,695 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 356 transitions. [2022-01-11 02:02:32,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-11 02:02:32,695 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 02:02:32,695 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-11 02:02:32,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 02:02:32,695 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-11 02:02:32,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 02:02:32,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1193088556, now seen corresponding path program 1 times [2022-01-11 02:02:32,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 02:02:32,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309278544] [2022-01-11 02:02:32,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 02:02:32,696 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 02:02:32,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 02:02:32,800 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-11 02:02:32,801 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 02:02:32,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309278544] [2022-01-11 02:02:32,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309278544] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 02:02:32,801 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 02:02:32,801 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-11 02:02:32,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719367408] [2022-01-11 02:02:32,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 02:02:32,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-11 02:02:32,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 02:02:32,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-11 02:02:32,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-11 02:02:32,805 INFO L87 Difference]: Start difference. First operand 296 states and 356 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 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-11 02:02:33,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 02:02:33,643 INFO L93 Difference]: Finished difference Result 300 states and 359 transitions. [2022-01-11 02:02:33,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-11 02:02:33,644 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 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-11 02:02:33,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 02:02:33,645 INFO L225 Difference]: With dead ends: 300 [2022-01-11 02:02:33,645 INFO L226 Difference]: Without dead ends: 296 [2022-01-11 02:02:33,645 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-01-11 02:02:33,645 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 298 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 1582 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 1648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-11 02:02:33,646 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [298 Valid, 188 Invalid, 1648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1582 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-11 02:02:33,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-01-11 02:02:33,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-01-11 02:02:33,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 281 states have (on average 1.2633451957295374) internal successors, (355), 295 states have internal predecessors, (355), 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-11 02:02:33,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 355 transitions. [2022-01-11 02:02:33,650 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 355 transitions. Word has length 19 [2022-01-11 02:02:33,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 02:02:33,650 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 355 transitions. [2022-01-11 02:02:33,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 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-11 02:02:33,650 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 355 transitions. [2022-01-11 02:02:33,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-11 02:02:33,651 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 02:02:33,651 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, 1, 1] [2022-01-11 02:02:33,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 02:02:33,651 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-11 02:02:33,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 02:02:33,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1358420542, now seen corresponding path program 1 times [2022-01-11 02:02:33,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 02:02:33,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212138768] [2022-01-11 02:02:33,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 02:02:33,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 02:02:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 02:02:33,851 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-11 02:02:33,851 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 02:02:33,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212138768] [2022-01-11 02:02:33,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212138768] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 02:02:33,851 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 02:02:33,851 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-11 02:02:33,851 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474368811] [2022-01-11 02:02:33,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 02:02:33,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-11 02:02:33,852 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 02:02:33,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-11 02:02:33,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-01-11 02:02:33,852 INFO L87 Difference]: Start difference. First operand 296 states and 355 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 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-11 02:02:35,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 02:02:35,349 INFO L93 Difference]: Finished difference Result 300 states and 358 transitions. [2022-01-11 02:02:35,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-11 02:02:35,350 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 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 23 [2022-01-11 02:02:35,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 02:02:35,351 INFO L225 Difference]: With dead ends: 300 [2022-01-11 02:02:35,351 INFO L226 Difference]: Without dead ends: 296 [2022-01-11 02:02:35,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-01-11 02:02:35,353 INFO L933 BasicCegarLoop]: 333 mSDtfsCounter, 42 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 2208 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 2222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-11 02:02:35,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 923 Invalid, 2222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2208 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-11 02:02:35,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-01-11 02:02:35,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-01-11 02:02:35,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 281 states have (on average 1.2597864768683273) internal successors, (354), 295 states have internal predecessors, (354), 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-11 02:02:35,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 354 transitions. [2022-01-11 02:02:35,360 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 354 transitions. Word has length 23 [2022-01-11 02:02:35,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 02:02:35,360 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 354 transitions. [2022-01-11 02:02:35,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 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-11 02:02:35,361 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 354 transitions. [2022-01-11 02:02:35,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-11 02:02:35,361 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 02:02:35,361 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, 1, 1, 1, 1, 1, 1] [2022-01-11 02:02:35,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 02:02:35,362 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-11 02:02:35,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 02:02:35,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1885697004, now seen corresponding path program 1 times [2022-01-11 02:02:35,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 02:02:35,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765141719] [2022-01-11 02:02:35,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 02:02:35,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 02:02:35,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 02:02:35,593 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-11 02:02:35,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 02:02:35,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765141719] [2022-01-11 02:02:35,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765141719] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 02:02:35,593 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 02:02:35,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-11 02:02:35,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346495418] [2022-01-11 02:02:35,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 02:02:35,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-11 02:02:35,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 02:02:35,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-11 02:02:35,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-01-11 02:02:35,595 INFO L87 Difference]: Start difference. First operand 296 states and 354 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 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-11 02:02:37,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 02:02:37,414 INFO L93 Difference]: Finished difference Result 300 states and 357 transitions. [2022-01-11 02:02:37,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-11 02:02:37,415 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 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 27 [2022-01-11 02:02:37,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 02:02:37,416 INFO L225 Difference]: With dead ends: 300 [2022-01-11 02:02:37,416 INFO L226 Difference]: Without dead ends: 296 [2022-01-11 02:02:37,416 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2022-01-11 02:02:37,416 INFO L933 BasicCegarLoop]: 328 mSDtfsCounter, 51 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 2510 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 2527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-11 02:02:37,417 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 950 Invalid, 2527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2510 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-11 02:02:37,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-01-11 02:02:37,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-01-11 02:02:37,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 281 states have (on average 1.2562277580071175) internal successors, (353), 295 states have internal predecessors, (353), 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-11 02:02:37,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 353 transitions. [2022-01-11 02:02:37,421 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 353 transitions. Word has length 27 [2022-01-11 02:02:37,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 02:02:37,421 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 353 transitions. [2022-01-11 02:02:37,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 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-11 02:02:37,421 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 353 transitions. [2022-01-11 02:02:37,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-11 02:02:37,422 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 02:02:37,422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 02:02:37,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 02:02:37,422 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-11 02:02:37,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 02:02:37,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1037090204, now seen corresponding path program 1 times [2022-01-11 02:02:37,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 02:02:37,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242064966] [2022-01-11 02:02:37,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 02:02:37,423 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 02:02:37,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 02:02:37,700 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-11 02:02:37,701 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 02:02:37,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242064966] [2022-01-11 02:02:37,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242064966] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 02:02:37,701 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 02:02:37,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-11 02:02:37,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806573758] [2022-01-11 02:02:37,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 02:02:37,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-11 02:02:37,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 02:02:37,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-11 02:02:37,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-01-11 02:02:37,702 INFO L87 Difference]: Start difference. First operand 296 states and 353 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 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-11 02:02:39,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 02:02:39,872 INFO L93 Difference]: Finished difference Result 300 states and 356 transitions. [2022-01-11 02:02:39,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-11 02:02:39,872 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 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 31 [2022-01-11 02:02:39,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 02:02:39,873 INFO L225 Difference]: With dead ends: 300 [2022-01-11 02:02:39,873 INFO L226 Difference]: Without dead ends: 296 [2022-01-11 02:02:39,873 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2022-01-11 02:02:39,874 INFO L933 BasicCegarLoop]: 323 mSDtfsCounter, 76 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 2809 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 2834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-01-11 02:02:39,874 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 977 Invalid, 2834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2809 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-01-11 02:02:39,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-01-11 02:02:39,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-01-11 02:02:39,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 281 states have (on average 1.2526690391459074) internal successors, (352), 295 states have internal predecessors, (352), 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-11 02:02:39,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 352 transitions. [2022-01-11 02:02:39,878 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 352 transitions. Word has length 31 [2022-01-11 02:02:39,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 02:02:39,878 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 352 transitions. [2022-01-11 02:02:39,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 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-11 02:02:39,878 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 352 transitions. [2022-01-11 02:02:39,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-11 02:02:39,880 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 02:02:39,881 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 02:02:39,881 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-11 02:02:39,881 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-11 02:02:39,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 02:02:39,881 INFO L85 PathProgramCache]: Analyzing trace with hash -873254882, now seen corresponding path program 1 times [2022-01-11 02:02:39,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 02:02:39,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850125979] [2022-01-11 02:02:39,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 02:02:39,882 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 02:02:39,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 02:02:40,007 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-11 02:02:40,007 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 02:02:40,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850125979] [2022-01-11 02:02:40,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850125979] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 02:02:40,007 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 02:02:40,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-11 02:02:40,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735276398] [2022-01-11 02:02:40,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 02:02:40,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-11 02:02:40,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 02:02:40,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-11 02:02:40,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-11 02:02:40,008 INFO L87 Difference]: Start difference. First operand 296 states and 352 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 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-11 02:02:40,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 02:02:40,866 INFO L93 Difference]: Finished difference Result 300 states and 355 transitions. [2022-01-11 02:02:40,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-11 02:02:40,867 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 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 35 [2022-01-11 02:02:40,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 02:02:40,868 INFO L225 Difference]: With dead ends: 300 [2022-01-11 02:02:40,868 INFO L226 Difference]: Without dead ends: 296 [2022-01-11 02:02:40,868 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-01-11 02:02:40,868 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 295 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 1560 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 1626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-11 02:02:40,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [295 Valid, 188 Invalid, 1626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1560 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-11 02:02:40,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-01-11 02:02:40,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-01-11 02:02:40,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 281 states have (on average 1.2491103202846976) internal successors, (351), 295 states have internal predecessors, (351), 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-11 02:02:40,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 351 transitions. [2022-01-11 02:02:40,872 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 351 transitions. Word has length 35 [2022-01-11 02:02:40,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 02:02:40,873 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 351 transitions. [2022-01-11 02:02:40,873 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 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-11 02:02:40,873 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 351 transitions. [2022-01-11 02:02:40,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-11 02:02:40,873 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 02:02:40,873 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 02:02:40,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 02:02:40,874 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-11 02:02:40,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 02:02:40,874 INFO L85 PathProgramCache]: Analyzing trace with hash -500617768, now seen corresponding path program 1 times [2022-01-11 02:02:40,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 02:02:40,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329293513] [2022-01-11 02:02:40,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 02:02:40,874 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 02:02:40,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 02:02:41,213 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-11 02:02:41,214 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 02:02:41,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329293513] [2022-01-11 02:02:41,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329293513] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 02:02:41,214 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 02:02:41,214 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-11 02:02:41,214 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175463972] [2022-01-11 02:02:41,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 02:02:41,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-11 02:02:41,214 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 02:02:41,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-11 02:02:41,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-01-11 02:02:41,215 INFO L87 Difference]: Start difference. First operand 296 states and 351 transitions. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 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-11 02:02:44,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 02:02:44,034 INFO L93 Difference]: Finished difference Result 300 states and 354 transitions. [2022-01-11 02:02:44,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-11 02:02:44,035 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 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 39 [2022-01-11 02:02:44,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 02:02:44,036 INFO L225 Difference]: With dead ends: 300 [2022-01-11 02:02:44,036 INFO L226 Difference]: Without dead ends: 296 [2022-01-11 02:02:44,036 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2022-01-11 02:02:44,036 INFO L933 BasicCegarLoop]: 313 mSDtfsCounter, 78 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 3404 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 3430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 3404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-01-11 02:02:44,037 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 1031 Invalid, 3430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 3404 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-01-11 02:02:44,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-01-11 02:02:44,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-01-11 02:02:44,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 281 states have (on average 1.2455516014234875) internal successors, (350), 295 states have internal predecessors, (350), 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-11 02:02:44,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 350 transitions. [2022-01-11 02:02:44,041 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 350 transitions. Word has length 39 [2022-01-11 02:02:44,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 02:02:44,041 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 350 transitions. [2022-01-11 02:02:44,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 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-11 02:02:44,041 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 350 transitions. [2022-01-11 02:02:44,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-11 02:02:44,042 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 02:02:44,042 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 02:02:44,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 02:02:44,042 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-11 02:02:44,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 02:02:44,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1565080466, now seen corresponding path program 1 times [2022-01-11 02:02:44,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 02:02:44,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949022558] [2022-01-11 02:02:44,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 02:02:44,043 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 02:02:44,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 02:02:44,216 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-11 02:02:44,216 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 02:02:44,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949022558] [2022-01-11 02:02:44,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949022558] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 02:02:44,216 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 02:02:44,216 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-11 02:02:44,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342210194] [2022-01-11 02:02:44,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 02:02:44,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-11 02:02:44,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 02:02:44,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-11 02:02:44,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-11 02:02:44,218 INFO L87 Difference]: Start difference. First operand 296 states and 350 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 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-11 02:02:44,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 02:02:44,929 INFO L93 Difference]: Finished difference Result 300 states and 353 transitions. [2022-01-11 02:02:44,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-11 02:02:44,930 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 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 43 [2022-01-11 02:02:44,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 02:02:44,943 INFO L225 Difference]: With dead ends: 300 [2022-01-11 02:02:44,944 INFO L226 Difference]: Without dead ends: 296 [2022-01-11 02:02:44,944 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-01-11 02:02:44,944 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 294 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 1310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-11 02:02:44,945 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [294 Valid, 151 Invalid, 1310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-11 02:02:44,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-01-11 02:02:44,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-01-11 02:02:44,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 281 states have (on average 1.2419928825622777) internal successors, (349), 295 states have internal predecessors, (349), 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-11 02:02:44,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 349 transitions. [2022-01-11 02:02:44,948 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 349 transitions. Word has length 43 [2022-01-11 02:02:44,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 02:02:44,949 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 349 transitions. [2022-01-11 02:02:44,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 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-11 02:02:44,949 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 349 transitions. [2022-01-11 02:02:44,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-11 02:02:44,949 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 02:02:44,950 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 02:02:44,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 02:02:44,950 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-11 02:02:44,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 02:02:44,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1714726580, now seen corresponding path program 1 times [2022-01-11 02:02:44,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 02:02:44,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198244176] [2022-01-11 02:02:44,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 02:02:44,950 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 02:02:45,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 02:02:45,403 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-11 02:02:45,404 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 02:02:45,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198244176] [2022-01-11 02:02:45,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198244176] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 02:02:45,404 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 02:02:45,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-01-11 02:02:45,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481680249] [2022-01-11 02:02:45,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 02:02:45,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-11 02:02:45,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 02:02:45,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-11 02:02:45,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2022-01-11 02:02:45,405 INFO L87 Difference]: Start difference. First operand 296 states and 349 transitions. Second operand has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 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-11 02:02:48,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 02:02:48,966 INFO L93 Difference]: Finished difference Result 300 states and 352 transitions. [2022-01-11 02:02:48,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-11 02:02:48,967 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 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 47 [2022-01-11 02:02:48,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 02:02:48,968 INFO L225 Difference]: With dead ends: 300 [2022-01-11 02:02:48,968 INFO L226 Difference]: Without dead ends: 296 [2022-01-11 02:02:48,968 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2022-01-11 02:02:48,969 INFO L933 BasicCegarLoop]: 303 mSDtfsCounter, 96 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 3990 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 4022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 3990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-01-11 02:02:48,969 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 1085 Invalid, 4022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 3990 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-01-11 02:02:48,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-01-11 02:02:48,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-01-11 02:02:48,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 281 states have (on average 1.2384341637010676) internal successors, (348), 295 states have internal predecessors, (348), 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-11 02:02:48,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 348 transitions. [2022-01-11 02:02:48,973 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 348 transitions. Word has length 47 [2022-01-11 02:02:48,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 02:02:48,973 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 348 transitions. [2022-01-11 02:02:48,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 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-11 02:02:48,973 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 348 transitions. [2022-01-11 02:02:48,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-11 02:02:48,974 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 02:02:48,974 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 02:02:48,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 02:02:48,974 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-11 02:02:48,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 02:02:48,974 INFO L85 PathProgramCache]: Analyzing trace with hash -131627258, now seen corresponding path program 1 times [2022-01-11 02:02:48,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 02:02:48,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321549955] [2022-01-11 02:02:48,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 02:02:48,975 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 02:02:49,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 02:02:49,449 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-11 02:02:49,449 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 02:02:49,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321549955] [2022-01-11 02:02:49,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321549955] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 02:02:49,449 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 02:02:49,449 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-11 02:02:49,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356255285] [2022-01-11 02:02:49,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 02:02:49,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-11 02:02:49,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 02:02:49,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-11 02:02:49,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2022-01-11 02:02:49,450 INFO L87 Difference]: Start difference. First operand 296 states and 348 transitions. Second operand has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 02:02:53,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 02:02:53,168 INFO L93 Difference]: Finished difference Result 300 states and 351 transitions. [2022-01-11 02:02:53,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-11 02:02:53,169 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-01-11 02:02:53,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 02:02:53,170 INFO L225 Difference]: With dead ends: 300 [2022-01-11 02:02:53,170 INFO L226 Difference]: Without dead ends: 296 [2022-01-11 02:02:53,170 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=141, Invalid=915, Unknown=0, NotChecked=0, Total=1056 [2022-01-11 02:02:53,172 INFO L933 BasicCegarLoop]: 298 mSDtfsCounter, 73 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 4323 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 4346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 4323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-01-11 02:02:53,172 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 1112 Invalid, 4346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 4323 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-01-11 02:02:53,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-01-11 02:02:53,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-01-11 02:02:53,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 281 states have (on average 1.2348754448398576) internal successors, (347), 295 states have internal predecessors, (347), 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-11 02:02:53,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 347 transitions. [2022-01-11 02:02:53,177 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 347 transitions. Word has length 51 [2022-01-11 02:02:53,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 02:02:53,177 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 347 transitions. [2022-01-11 02:02:53,177 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 02:02:53,177 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 347 transitions. [2022-01-11 02:02:53,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-11 02:02:53,178 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 02:02:53,178 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 02:02:53,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-11 02:02:53,179 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-11 02:02:53,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 02:02:53,179 INFO L85 PathProgramCache]: Analyzing trace with hash -589970240, now seen corresponding path program 1 times [2022-01-11 02:02:53,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 02:02:53,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189746894] [2022-01-11 02:02:53,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 02:02:53,180 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 02:02:53,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 02:02:53,368 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-11 02:02:53,368 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 02:02:53,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189746894] [2022-01-11 02:02:53,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189746894] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 02:02:53,369 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 02:02:53,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-11 02:02:53,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647974025] [2022-01-11 02:02:53,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 02:02:53,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-11 02:02:53,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 02:02:53,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-11 02:02:53,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-11 02:02:53,370 INFO L87 Difference]: Start difference. First operand 296 states and 347 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 02:02:54,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 02:02:54,002 INFO L93 Difference]: Finished difference Result 300 states and 350 transitions. [2022-01-11 02:02:54,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-11 02:02:54,004 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-01-11 02:02:54,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 02:02:54,005 INFO L225 Difference]: With dead ends: 300 [2022-01-11 02:02:54,005 INFO L226 Difference]: Without dead ends: 296 [2022-01-11 02:02:54,005 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-01-11 02:02:54,006 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 296 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 1232 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 1299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-11 02:02:54,006 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [296 Valid, 151 Invalid, 1299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1232 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-11 02:02:54,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-01-11 02:02:54,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-01-11 02:02:54,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 281 states have (on average 1.2313167259786477) internal successors, (346), 295 states have internal predecessors, (346), 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-11 02:02:54,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 346 transitions. [2022-01-11 02:02:54,009 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 346 transitions. Word has length 55 [2022-01-11 02:02:54,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 02:02:54,009 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 346 transitions. [2022-01-11 02:02:54,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 02:02:54,010 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 346 transitions. [2022-01-11 02:02:54,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-11 02:02:54,010 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 02:02:54,010 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 02:02:54,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-11 02:02:54,010 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-11 02:02:54,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 02:02:54,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1337060742, now seen corresponding path program 1 times [2022-01-11 02:02:54,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 02:02:54,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190384514] [2022-01-11 02:02:54,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 02:02:54,011 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 02:02:54,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 02:02:54,598 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-11 02:02:54,598 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 02:02:54,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190384514] [2022-01-11 02:02:54,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190384514] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 02:02:54,598 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 02:02:54,598 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-11 02:02:54,598 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321592696] [2022-01-11 02:02:54,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 02:02:54,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-11 02:02:54,599 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 02:02:54,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-11 02:02:54,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2022-01-11 02:02:54,599 INFO L87 Difference]: Start difference. First operand 296 states and 346 transitions. Second operand has 20 states, 20 states have (on average 2.95) internal successors, (59), 20 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 02:02:59,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 02:02:59,015 INFO L93 Difference]: Finished difference Result 300 states and 349 transitions. [2022-01-11 02:02:59,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-11 02:02:59,016 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.95) internal successors, (59), 20 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-01-11 02:02:59,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 02:02:59,027 INFO L225 Difference]: With dead ends: 300 [2022-01-11 02:02:59,027 INFO L226 Difference]: Without dead ends: 296 [2022-01-11 02:02:59,028 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=158, Invalid=1032, Unknown=0, NotChecked=0, Total=1190 [2022-01-11 02:02:59,032 INFO L933 BasicCegarLoop]: 288 mSDtfsCounter, 123 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 4854 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 4895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 4854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-01-11 02:02:59,032 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 1166 Invalid, 4895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 4854 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-01-11 02:02:59,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-01-11 02:02:59,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-01-11 02:02:59,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 281 states have (on average 1.2277580071174377) internal successors, (345), 295 states have internal predecessors, (345), 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-11 02:02:59,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 345 transitions. [2022-01-11 02:02:59,037 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 345 transitions. Word has length 59 [2022-01-11 02:02:59,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 02:02:59,037 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 345 transitions. [2022-01-11 02:02:59,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.95) internal successors, (59), 20 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 02:02:59,037 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 345 transitions. [2022-01-11 02:02:59,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-01-11 02:02:59,038 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 02:02:59,038 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 02:02:59,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-11 02:02:59,038 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-11 02:02:59,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 02:02:59,038 INFO L85 PathProgramCache]: Analyzing trace with hash -553095116, now seen corresponding path program 1 times [2022-01-11 02:02:59,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 02:02:59,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991108826] [2022-01-11 02:02:59,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 02:02:59,039 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 02:02:59,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 02:02:59,667 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-11 02:02:59,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 02:02:59,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991108826] [2022-01-11 02:02:59,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991108826] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 02:02:59,668 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 02:02:59,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-01-11 02:02:59,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554350313] [2022-01-11 02:02:59,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 02:02:59,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-11 02:02:59,668 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 02:02:59,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-11 02:02:59,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=378, Unknown=0, NotChecked=0, Total=420 [2022-01-11 02:02:59,669 INFO L87 Difference]: Start difference. First operand 296 states and 345 transitions. Second operand has 21 states, 21 states have (on average 3.0) internal successors, (63), 21 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 02:03:04,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 02:03:04,456 INFO L93 Difference]: Finished difference Result 300 states and 348 transitions. [2022-01-11 02:03:04,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-11 02:03:04,456 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0) internal successors, (63), 21 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-01-11 02:03:04,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 02:03:04,457 INFO L225 Difference]: With dead ends: 300 [2022-01-11 02:03:04,457 INFO L226 Difference]: Without dead ends: 296 [2022-01-11 02:03:04,458 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=168, Invalid=1164, Unknown=0, NotChecked=0, Total=1332 [2022-01-11 02:03:04,458 INFO L933 BasicCegarLoop]: 283 mSDtfsCounter, 132 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 5138 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 5182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 5138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-01-11 02:03:04,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 1193 Invalid, 5182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 5138 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-01-11 02:03:04,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-01-11 02:03:04,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-01-11 02:03:04,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 281 states have (on average 1.2241992882562278) internal successors, (344), 295 states have internal predecessors, (344), 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-11 02:03:04,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 344 transitions. [2022-01-11 02:03:04,461 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 344 transitions. Word has length 63 [2022-01-11 02:03:04,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 02:03:04,461 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 344 transitions. [2022-01-11 02:03:04,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.0) internal successors, (63), 21 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 02:03:04,462 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 344 transitions. [2022-01-11 02:03:04,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-11 02:03:04,462 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 02:03:04,462 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 02:03:04,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-11 02:03:04,462 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-11 02:03:04,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 02:03:04,462 INFO L85 PathProgramCache]: Analyzing trace with hash -646128146, now seen corresponding path program 1 times [2022-01-11 02:03:04,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 02:03:04,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683901415] [2022-01-11 02:03:04,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 02:03:04,463 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 02:03:04,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 02:03:05,154 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-11 02:03:05,155 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 02:03:05,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683901415] [2022-01-11 02:03:05,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683901415] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 02:03:05,155 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 02:03:05,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-01-11 02:03:05,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171231206] [2022-01-11 02:03:05,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 02:03:05,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-11 02:03:05,155 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 02:03:05,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-11 02:03:05,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=418, Unknown=0, NotChecked=0, Total=462 [2022-01-11 02:03:05,156 INFO L87 Difference]: Start difference. First operand 296 states and 344 transitions. Second operand has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 22 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 02:03:10,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 02:03:10,226 INFO L93 Difference]: Finished difference Result 300 states and 347 transitions. [2022-01-11 02:03:10,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-11 02:03:10,226 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 22 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-01-11 02:03:10,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 02:03:10,227 INFO L225 Difference]: With dead ends: 300 [2022-01-11 02:03:10,227 INFO L226 Difference]: Without dead ends: 296 [2022-01-11 02:03:10,228 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=178, Invalid=1304, Unknown=0, NotChecked=0, Total=1482 [2022-01-11 02:03:10,228 INFO L933 BasicCegarLoop]: 278 mSDtfsCounter, 184 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 5419 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 1220 SdHoareTripleChecker+Invalid, 5480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 5419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-01-11 02:03:10,228 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 1220 Invalid, 5480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 5419 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-01-11 02:03:10,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-01-11 02:03:10,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-01-11 02:03:10,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 281 states have (on average 1.2206405693950177) internal successors, (343), 295 states have internal predecessors, (343), 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-11 02:03:10,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 343 transitions. [2022-01-11 02:03:10,231 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 343 transitions. Word has length 67 [2022-01-11 02:03:10,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 02:03:10,231 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 343 transitions. [2022-01-11 02:03:10,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 22 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 02:03:10,232 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 343 transitions. [2022-01-11 02:03:10,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-01-11 02:03:10,232 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 02:03:10,232 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 02:03:10,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-11 02:03:10,232 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-11 02:03:10,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 02:03:10,232 INFO L85 PathProgramCache]: Analyzing trace with hash 337861544, now seen corresponding path program 1 times [2022-01-11 02:03:10,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 02:03:10,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906230642] [2022-01-11 02:03:10,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 02:03:10,233 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 02:03:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 02:03:10,955 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-11 02:03:10,955 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 02:03:10,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906230642] [2022-01-11 02:03:10,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906230642] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 02:03:10,956 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 02:03:10,956 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-01-11 02:03:10,956 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993027025] [2022-01-11 02:03:10,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 02:03:10,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-11 02:03:10,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 02:03:10,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-11 02:03:10,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=460, Unknown=0, NotChecked=0, Total=506 [2022-01-11 02:03:10,957 INFO L87 Difference]: Start difference. First operand 296 states and 343 transitions. Second operand has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 23 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-11 02:03:16,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 02:03:16,284 INFO L93 Difference]: Finished difference Result 300 states and 346 transitions. [2022-01-11 02:03:16,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-11 02:03:16,284 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 23 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) Word has length 71 [2022-01-11 02:03:16,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 02:03:16,285 INFO L225 Difference]: With dead ends: 300 [2022-01-11 02:03:16,285 INFO L226 Difference]: Without dead ends: 296 [2022-01-11 02:03:16,285 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=188, Invalid=1452, Unknown=0, NotChecked=0, Total=1640 [2022-01-11 02:03:16,286 INFO L933 BasicCegarLoop]: 273 mSDtfsCounter, 150 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 5940 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 5990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 5940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-01-11 02:03:16,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 1284 Invalid, 5990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 5940 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-01-11 02:03:16,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-01-11 02:03:16,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-01-11 02:03:16,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 281 states have (on average 1.217081850533808) internal successors, (342), 295 states have internal predecessors, (342), 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-11 02:03:16,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 342 transitions. [2022-01-11 02:03:16,289 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 342 transitions. Word has length 71 [2022-01-11 02:03:16,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 02:03:16,289 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 342 transitions. [2022-01-11 02:03:16,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 23 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-11 02:03:16,289 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 342 transitions. [2022-01-11 02:03:16,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-01-11 02:03:16,290 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 02:03:16,290 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 02:03:16,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-11 02:03:16,290 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-11 02:03:16,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 02:03:16,290 INFO L85 PathProgramCache]: Analyzing trace with hash 125036898, now seen corresponding path program 1 times [2022-01-11 02:03:16,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 02:03:16,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60997140] [2022-01-11 02:03:16,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 02:03:16,291 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 02:03:16,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 02:03:17,134 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-11 02:03:17,134 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 02:03:17,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60997140] [2022-01-11 02:03:17,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60997140] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 02:03:17,134 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 02:03:17,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-01-11 02:03:17,134 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376961170] [2022-01-11 02:03:17,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 02:03:17,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-11 02:03:17,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 02:03:17,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-11 02:03:17,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=504, Unknown=0, NotChecked=0, Total=552 [2022-01-11 02:03:17,135 INFO L87 Difference]: Start difference. First operand 296 states and 342 transitions. Second operand has 24 states, 24 states have (on average 3.125) internal successors, (75), 24 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-11 02:03:23,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 02:03:23,153 INFO L93 Difference]: Finished difference Result 300 states and 345 transitions. [2022-01-11 02:03:23,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-11 02:03:23,153 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.125) internal successors, (75), 24 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) Word has length 75 [2022-01-11 02:03:23,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 02:03:23,154 INFO L225 Difference]: With dead ends: 300 [2022-01-11 02:03:23,154 INFO L226 Difference]: Without dead ends: 296 [2022-01-11 02:03:23,154 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=198, Invalid=1608, Unknown=0, NotChecked=0, Total=1806 [2022-01-11 02:03:23,155 INFO L933 BasicCegarLoop]: 268 mSDtfsCounter, 208 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 5977 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 6046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 5977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-01-11 02:03:23,155 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 1274 Invalid, 6046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 5977 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-01-11 02:03:23,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-01-11 02:03:23,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-01-11 02:03:23,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 281 states have (on average 1.2135231316725978) internal successors, (341), 295 states have internal predecessors, (341), 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-11 02:03:23,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 341 transitions. [2022-01-11 02:03:23,158 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 341 transitions. Word has length 75 [2022-01-11 02:03:23,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 02:03:23,158 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 341 transitions. [2022-01-11 02:03:23,158 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.125) internal successors, (75), 24 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-11 02:03:23,158 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 341 transitions. [2022-01-11 02:03:23,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-01-11 02:03:23,159 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 02:03:23,159 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 02:03:23,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-11 02:03:23,159 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-11 02:03:23,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 02:03:23,159 INFO L85 PathProgramCache]: Analyzing trace with hash 803637020, now seen corresponding path program 1 times [2022-01-11 02:03:23,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 02:03:23,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422974398] [2022-01-11 02:03:23,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 02:03:23,159 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 02:03:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 02:03:23,301 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-11 02:03:23,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 02:03:23,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422974398] [2022-01-11 02:03:23,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422974398] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 02:03:23,302 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 02:03:23,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-11 02:03:23,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486220555] [2022-01-11 02:03:23,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 02:03:23,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-11 02:03:23,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 02:03:23,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-11 02:03:23,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-11 02:03:23,303 INFO L87 Difference]: Start difference. First operand 296 states and 341 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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-11 02:03:24,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 02:03:24,203 INFO L93 Difference]: Finished difference Result 300 states and 344 transitions. [2022-01-11 02:03:24,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-11 02:03:24,204 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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) Word has length 79 [2022-01-11 02:03:24,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 02:03:24,205 INFO L225 Difference]: With dead ends: 300 [2022-01-11 02:03:24,205 INFO L226 Difference]: Without dead ends: 296 [2022-01-11 02:03:24,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-01-11 02:03:24,205 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 289 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 1803 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 1870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-11 02:03:24,205 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [289 Valid, 224 Invalid, 1870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1803 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-11 02:03:24,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-01-11 02:03:24,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-01-11 02:03:24,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 281 states have (on average 1.209964412811388) internal successors, (340), 295 states have internal predecessors, (340), 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-11 02:03:24,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 340 transitions. [2022-01-11 02:03:24,209 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 340 transitions. Word has length 79 [2022-01-11 02:03:24,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 02:03:24,209 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 340 transitions. [2022-01-11 02:03:24,209 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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-11 02:03:24,209 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 340 transitions. [2022-01-11 02:03:24,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-01-11 02:03:24,209 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 02:03:24,209 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 02:03:24,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-11 02:03:24,210 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-11 02:03:24,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 02:03:24,210 INFO L85 PathProgramCache]: Analyzing trace with hash 234042582, now seen corresponding path program 1 times [2022-01-11 02:03:24,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 02:03:24,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138107751] [2022-01-11 02:03:24,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 02:03:24,210 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 02:03:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 02:03:24,382 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-11 02:03:24,382 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 02:03:24,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138107751] [2022-01-11 02:03:24,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138107751] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 02:03:24,382 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 02:03:24,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-11 02:03:24,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995668741] [2022-01-11 02:03:24,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 02:03:24,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-11 02:03:24,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 02:03:24,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-11 02:03:24,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-11 02:03:24,383 INFO L87 Difference]: Start difference. First operand 296 states and 340 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 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-11 02:03:25,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 02:03:25,268 INFO L93 Difference]: Finished difference Result 300 states and 343 transitions. [2022-01-11 02:03:25,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-11 02:03:25,269 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 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) Word has length 83 [2022-01-11 02:03:25,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 02:03:25,269 INFO L225 Difference]: With dead ends: 300 [2022-01-11 02:03:25,269 INFO L226 Difference]: Without dead ends: 296 [2022-01-11 02:03:25,270 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-01-11 02:03:25,270 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 288 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 1797 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 1864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-11 02:03:25,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [288 Valid, 224 Invalid, 1864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1797 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-11 02:03:25,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-01-11 02:03:25,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-01-11 02:03:25,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 281 states have (on average 1.206405693950178) internal successors, (339), 295 states have internal predecessors, (339), 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-11 02:03:25,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 339 transitions. [2022-01-11 02:03:25,273 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 339 transitions. Word has length 83 [2022-01-11 02:03:25,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 02:03:25,274 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 339 transitions. [2022-01-11 02:03:25,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 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-11 02:03:25,274 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 339 transitions. [2022-01-11 02:03:25,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-01-11 02:03:25,274 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 02:03:25,274 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 02:03:25,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-11 02:03:25,274 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-11 02:03:25,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 02:03:25,275 INFO L85 PathProgramCache]: Analyzing trace with hash 638710416, now seen corresponding path program 1 times [2022-01-11 02:03:25,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 02:03:25,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799902726] [2022-01-11 02:03:25,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 02:03:25,275 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 02:03:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 02:03:26,286 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-11 02:03:26,286 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 02:03:26,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799902726] [2022-01-11 02:03:26,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799902726] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 02:03:26,286 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 02:03:26,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-11 02:03:26,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104854083] [2022-01-11 02:03:26,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 02:03:26,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-11 02:03:26,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 02:03:26,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-11 02:03:26,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=648, Unknown=0, NotChecked=0, Total=702 [2022-01-11 02:03:26,287 INFO L87 Difference]: Start difference. First operand 296 states and 339 transitions. Second operand has 27 states, 27 states have (on average 3.2222222222222223) internal successors, (87), 27 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)