/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 20:14:50,710 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 20:14:50,712 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 20:14:50,767 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 20:14:50,768 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 20:14:50,769 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 20:14:50,770 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 20:14:50,779 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 20:14:50,781 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 20:14:50,785 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 20:14:50,786 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 20:14:50,787 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 20:14:50,788 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 20:14:50,789 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 20:14:50,791 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 20:14:50,793 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 20:14:50,794 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 20:14:50,794 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 20:14:50,800 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 20:14:50,804 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 20:14:50,806 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 20:14:50,806 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 20:14:50,808 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 20:14:50,809 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 20:14:50,814 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 20:14:50,816 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 20:14:50,817 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 20:14:50,817 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 20:14:50,818 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 20:14:50,818 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 20:14:50,819 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 20:14:50,819 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 20:14:50,820 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 20:14:50,820 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 20:14:50,821 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 20:14:50,821 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 20:14:50,822 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 20:14:50,822 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 20:14:50,822 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 20:14:50,823 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 20:14:50,823 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 20:14:50,826 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-10 20:14:50,856 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 20:14:50,857 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 20:14:50,857 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 20:14:50,857 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 20:14:50,858 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 20:14:50,858 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 20:14:50,858 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 20:14:50,859 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 20:14:50,859 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 20:14:50,859 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 20:14:50,859 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 20:14:50,860 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 20:14:50,860 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 20:14:50,860 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 20:14:50,860 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 20:14:50,860 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 20:14:50,860 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 20:14:50,860 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 20:14:50,860 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 20:14:50,861 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 20:14:50,861 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 20:14:50,861 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 20:14:50,861 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 20:14:50,861 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 20:14:50,861 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 20:14:50,861 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 20:14:50,861 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 20:14:50,862 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 20:14:50,862 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 20:14:50,862 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 20:14:50,862 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 20:14:50,862 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 20:14:50,863 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 20:14:50,863 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 20:14:51,054 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 20:14:51,072 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 20:14:51,074 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 20:14:51,075 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 20:14:51,077 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 20:14:51,078 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-10 20:14:51,144 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dddd5991/293dda7b5f6e4d18be0fa6b5ad367a0f/FLAGe057adc28 [2022-01-10 20:14:51,637 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 20:14:51,638 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c [2022-01-10 20:14:51,662 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dddd5991/293dda7b5f6e4d18be0fa6b5ad367a0f/FLAGe057adc28 [2022-01-10 20:14:52,109 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dddd5991/293dda7b5f6e4d18be0fa6b5ad367a0f [2022-01-10 20:14:52,111 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 20:14:52,112 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 20:14:52,113 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 20:14:52,113 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 20:14:52,115 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 20:14:52,115 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 08:14:52" (1/1) ... [2022-01-10 20:14:52,116 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43bf6c21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:14:52, skipping insertion in model container [2022-01-10 20:14:52,116 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 08:14:52" (1/1) ... [2022-01-10 20:14:52,123 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 20:14:52,220 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 20:14:52,399 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-10 20:14:52,403 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-10 20:14:52,777 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-10 20:14:52,786 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-10 20:14:52,792 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-10 20:14:52,795 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-10 20:14:52,800 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-10 20:14:52,803 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-10 20:14:52,807 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-10 20:14:52,810 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-10 20:14:52,820 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-10 20:14:52,823 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-10 20:14:52,826 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-10 20:14:52,829 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-10 20:14:52,833 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-10 20:14:52,836 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-10 20:14:52,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 20:14:52,863 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 20:14:52,874 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-10 20:14:52,879 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-10 20:14:53,103 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-10 20:14:53,107 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-10 20:14:53,111 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-10 20:14:53,114 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-10 20:14:53,117 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-10 20:14:53,121 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-10 20:14:53,125 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-10 20:14:53,128 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-10 20:14:53,132 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-10 20:14:53,135 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-10 20:14:53,139 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-10 20:14:53,143 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-10 20:14:53,148 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-10 20:14:53,151 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-10 20:14:53,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 20:14:53,171 INFO L208 MainTranslator]: Completed translation [2022-01-10 20:14:53,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:14:53 WrapperNode [2022-01-10 20:14:53,172 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 20:14:53,173 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 20:14:53,173 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 20:14:53,173 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 20:14:53,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:14:53" (1/1) ... [2022-01-10 20:14:53,232 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:14:53" (1/1) ... [2022-01-10 20:14:53,313 INFO L137 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2954 [2022-01-10 20:14:53,314 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 20:14:53,315 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 20:14:53,315 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 20:14:53,315 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 20:14:53,322 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:14:53" (1/1) ... [2022-01-10 20:14:53,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:14:53" (1/1) ... [2022-01-10 20:14:53,328 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:14:53" (1/1) ... [2022-01-10 20:14:53,329 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:14:53" (1/1) ... [2022-01-10 20:14:53,358 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:14:53" (1/1) ... [2022-01-10 20:14:53,371 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:14:53" (1/1) ... [2022-01-10 20:14:53,381 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:14:53" (1/1) ... [2022-01-10 20:14:53,404 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 20:14:53,405 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 20:14:53,405 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 20:14:53,405 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 20:14:53,407 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:14:53" (1/1) ... [2022-01-10 20:14:53,413 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 20:14:53,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 20:14:53,436 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 20:14:53,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 20:14:53,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 20:14:53,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 20:14:53,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 20:14:53,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 20:14:53,736 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 20:14:53,737 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 20:14:55,181 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 20:14:55,198 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 20:14:55,198 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-10 20:14:55,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:14:55 BoogieIcfgContainer [2022-01-10 20:14:55,201 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 20:14:55,201 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 20:14:55,201 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 20:14:55,203 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 20:14:55,205 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:14:55" (1/1) ... [2022-01-10 20:14:55,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 08:14:55 BasicIcfg [2022-01-10 20:14:55,687 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 20:14:55,689 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 20:14:55,689 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 20:14:55,691 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 20:14:55,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 08:14:52" (1/4) ... [2022-01-10 20:14:55,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6955a25a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 08:14:55, skipping insertion in model container [2022-01-10 20:14:55,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:14:53" (2/4) ... [2022-01-10 20:14:55,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6955a25a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 08:14:55, skipping insertion in model container [2022-01-10 20:14:55,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:14:55" (3/4) ... [2022-01-10 20:14:55,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6955a25a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 08:14:55, skipping insertion in model container [2022-01-10 20:14:55,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 08:14:55" (4/4) ... [2022-01-10 20:14:55,694 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+sep-reducer.cTransformedIcfg [2022-01-10 20:14:55,698 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 20:14:55,698 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-01-10 20:14:55,745 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 20:14:55,757 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 20:14:55,757 INFO L340 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-01-10 20:14:55,784 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-10 20:14:55,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-01-10 20:14:55,787 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:14:55,788 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:14:55,789 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-10 20:14:55,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:14:55,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1357103806, now seen corresponding path program 1 times [2022-01-10 20:14:55,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:14:55,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661963469] [2022-01-10 20:14:55,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:14:55,801 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:14:55,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:14:56,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:14:56,053 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:14:56,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661963469] [2022-01-10 20:14:56,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661963469] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:14:56,054 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:14:56,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 20:14:56,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075317037] [2022-01-10 20:14:56,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:14:56,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 20:14:56,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:14:56,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 20:14:56,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 20:14:56,081 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-10 20:14:56,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:14:56,896 INFO L93 Difference]: Finished difference Result 496 states and 920 transitions. [2022-01-10 20:14:56,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 20:14:56,898 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-10 20:14:56,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:14:56,907 INFO L225 Difference]: With dead ends: 496 [2022-01-10 20:14:56,907 INFO L226 Difference]: Without dead ends: 304 [2022-01-10 20:14:56,910 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-10 20:14:56,913 INFO L933 BasicCegarLoop]: 880 mSDtfsCounter, 30 mSDsluCounter, 1211 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.8s IncrementalHoareTripleChecker+Time [2022-01-10 20:14:56,914 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.8s Time] [2022-01-10 20:14:56,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-01-10 20:14:56,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 301. [2022-01-10 20:14:56,956 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-10 20:14:56,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 364 transitions. [2022-01-10 20:14:56,958 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 364 transitions. Word has length 7 [2022-01-10 20:14:56,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:14:56,958 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 364 transitions. [2022-01-10 20:14:56,959 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-10 20:14:56,959 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 364 transitions. [2022-01-10 20:14:56,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-01-10 20:14:56,959 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:14:56,959 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:14:56,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 20:14:56,960 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-10 20:14:56,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:14:56,960 INFO L85 PathProgramCache]: Analyzing trace with hash -879451729, now seen corresponding path program 1 times [2022-01-10 20:14:56,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:14:56,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190436550] [2022-01-10 20:14:56,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:14:56,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:14:56,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:14:57,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:14:57,071 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:14:57,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190436550] [2022-01-10 20:14:57,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190436550] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:14:57,071 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:14:57,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:14:57,072 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70144268] [2022-01-10 20:14:57,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:14:57,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:14:57,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:14:57,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:14:57,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:14:57,074 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-10 20:14:57,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:14:57,505 INFO L93 Difference]: Finished difference Result 304 states and 366 transitions. [2022-01-10 20:14:57,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 20:14:57,506 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-10 20:14:57,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:14:57,508 INFO L225 Difference]: With dead ends: 304 [2022-01-10 20:14:57,508 INFO L226 Difference]: Without dead ends: 299 [2022-01-10 20:14:57,508 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-10 20:14:57,509 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-10 20:14:57,510 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-10 20:14:57,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-01-10 20:14:57,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2022-01-10 20:14:57,519 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-10 20:14:57,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 361 transitions. [2022-01-10 20:14:57,520 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 361 transitions. Word has length 8 [2022-01-10 20:14:57,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:14:57,520 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 361 transitions. [2022-01-10 20:14:57,520 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-10 20:14:57,520 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 361 transitions. [2022-01-10 20:14:57,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-10 20:14:57,520 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:14:57,521 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:14:57,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 20:14:57,521 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-10 20:14:57,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:14:57,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1101661551, now seen corresponding path program 1 times [2022-01-10 20:14:57,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:14:57,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983536229] [2022-01-10 20:14:57,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:14:57,522 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:14:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:14:57,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:14:57,641 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:14:57,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983536229] [2022-01-10 20:14:57,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983536229] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:14:57,641 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:14:57,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 20:14:57,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599340474] [2022-01-10 20:14:57,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:14:57,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 20:14:57,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:14:57,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 20:14:57,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-10 20:14:57,643 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-10 20:14:58,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:14:58,651 INFO L93 Difference]: Finished difference Result 306 states and 367 transitions. [2022-01-10 20:14:58,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:14:58,655 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-01-10 20:14:58,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:14:58,657 INFO L225 Difference]: With dead ends: 306 [2022-01-10 20:14:58,657 INFO L226 Difference]: Without dead ends: 304 [2022-01-10 20:14:58,657 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-10 20:14:58,658 INFO L933 BasicCegarLoop]: 350 mSDtfsCounter, 15 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 1293 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 1.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:14:58,659 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 852 Invalid, 1297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1293 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-10 20:14:58,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-01-10 20:14:58,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 301. [2022-01-10 20:14:58,671 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-10 20:14:58,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 363 transitions. [2022-01-10 20:14:58,672 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 363 transitions. Word has length 11 [2022-01-10 20:14:58,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:14:58,673 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 363 transitions. [2022-01-10 20:14:58,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:14:58,673 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 363 transitions. [2022-01-10 20:14:58,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-10 20:14:58,673 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:14:58,673 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:14:58,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 20:14:58,674 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-10 20:14:58,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:14:58,674 INFO L85 PathProgramCache]: Analyzing trace with hash 208233532, now seen corresponding path program 1 times [2022-01-10 20:14:58,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:14:58,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467380750] [2022-01-10 20:14:58,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:14:58,675 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:14:58,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:14:58,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:14:58,906 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:14:58,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467380750] [2022-01-10 20:14:58,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467380750] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:14:58,907 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:14:58,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 20:14:58,907 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693327237] [2022-01-10 20:14:58,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:14:58,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 20:14:58,908 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:14:58,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 20:14:58,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-10 20:14:58,908 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-10 20:14:59,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:14:59,975 INFO L93 Difference]: Finished difference Result 301 states and 363 transitions. [2022-01-10 20:14:59,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:14:59,975 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-10 20:14:59,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:14:59,977 INFO L225 Difference]: With dead ends: 301 [2022-01-10 20:14:59,977 INFO L226 Difference]: Without dead ends: 296 [2022-01-10 20:14:59,977 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-10 20:14:59,978 INFO L933 BasicCegarLoop]: 346 mSDtfsCounter, 23 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 1478 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 1.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:14:59,978 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 856 Invalid, 1542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1478 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-10 20:14:59,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-01-10 20:14:59,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-01-10 20:14:59,984 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-10 20:14:59,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 357 transitions. [2022-01-10 20:14:59,985 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 357 transitions. Word has length 12 [2022-01-10 20:14:59,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:14:59,985 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 357 transitions. [2022-01-10 20:14:59,985 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-10 20:14:59,985 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 357 transitions. [2022-01-10 20:14:59,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 20:14:59,986 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:14:59,986 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:14:59,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 20:14:59,986 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-10 20:14:59,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:14:59,987 INFO L85 PathProgramCache]: Analyzing trace with hash 894112894, now seen corresponding path program 1 times [2022-01-10 20:14:59,987 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:14:59,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030672882] [2022-01-10 20:14:59,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:14:59,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:00,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:00,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:00,140 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:00,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030672882] [2022-01-10 20:15:00,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030672882] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:15:00,146 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:15:00,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 20:15:00,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40606494] [2022-01-10 20:15:00,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:15:00,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 20:15:00,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:15:00,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 20:15:00,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-10 20:15:00,147 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-10 20:15:01,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:15:01,286 INFO L93 Difference]: Finished difference Result 300 states and 360 transitions. [2022-01-10 20:15:01,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 20:15:01,287 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-10 20:15:01,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:15:01,288 INFO L225 Difference]: With dead ends: 300 [2022-01-10 20:15:01,288 INFO L226 Difference]: Without dead ends: 296 [2022-01-10 20:15:01,289 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-01-10 20:15:01,289 INFO L933 BasicCegarLoop]: 343 mSDtfsCounter, 7 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 1612 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 1.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:15:01,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 869 Invalid, 1614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1612 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-10 20:15:01,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-01-10 20:15:01,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-01-10 20:15:01,301 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-10 20:15:01,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 356 transitions. [2022-01-10 20:15:01,302 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 356 transitions. Word has length 15 [2022-01-10 20:15:01,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:15:01,302 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 356 transitions. [2022-01-10 20:15:01,302 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-10 20:15:01,303 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 356 transitions. [2022-01-10 20:15:01,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 20:15:01,303 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:15:01,303 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:15:01,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 20:15:01,304 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-10 20:15:01,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:15:01,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1193088556, now seen corresponding path program 1 times [2022-01-10 20:15:01,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:15:01,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438848953] [2022-01-10 20:15:01,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:01,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:01,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:01,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:01,431 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:01,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438848953] [2022-01-10 20:15:01,431 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438848953] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:15:01,431 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:15:01,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 20:15:01,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181424530] [2022-01-10 20:15:01,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:15:01,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 20:15:01,432 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:15:01,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 20:15:01,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-10 20:15:01,433 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-10 20:15:02,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:15:02,401 INFO L93 Difference]: Finished difference Result 300 states and 359 transitions. [2022-01-10 20:15:02,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 20:15:02,401 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-10 20:15:02,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:15:02,403 INFO L225 Difference]: With dead ends: 300 [2022-01-10 20:15:02,403 INFO L226 Difference]: Without dead ends: 296 [2022-01-10 20:15:02,403 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-10 20:15:02,404 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 298 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 1582 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.9s IncrementalHoareTripleChecker+Time [2022-01-10 20:15:02,404 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.9s Time] [2022-01-10 20:15:02,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-01-10 20:15:02,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-01-10 20:15:02,408 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-10 20:15:02,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 355 transitions. [2022-01-10 20:15:02,409 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 355 transitions. Word has length 19 [2022-01-10 20:15:02,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:15:02,410 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 355 transitions. [2022-01-10 20:15:02,410 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-10 20:15:02,410 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 355 transitions. [2022-01-10 20:15:02,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 20:15:02,410 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:15:02,410 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-10 20:15:02,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 20:15:02,411 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-10 20:15:02,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:15:02,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1358420542, now seen corresponding path program 1 times [2022-01-10 20:15:02,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:15:02,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933942341] [2022-01-10 20:15:02,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:02,412 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:02,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:02,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:02,643 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:02,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933942341] [2022-01-10 20:15:02,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933942341] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:15:02,643 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:15:02,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-10 20:15:02,644 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631803017] [2022-01-10 20:15:02,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:15:02,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-10 20:15:02,644 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:15:02,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-10 20:15:02,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-01-10 20:15:02,645 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-10 20:15:04,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:15:04,350 INFO L93 Difference]: Finished difference Result 300 states and 358 transitions. [2022-01-10 20:15:04,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 20:15:04,351 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-10 20:15:04,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:15:04,352 INFO L225 Difference]: With dead ends: 300 [2022-01-10 20:15:04,353 INFO L226 Difference]: Without dead ends: 296 [2022-01-10 20:15:04,353 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-01-10 20:15:04,354 INFO L933 BasicCegarLoop]: 333 mSDtfsCounter, 42 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 2208 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.5s IncrementalHoareTripleChecker+Time [2022-01-10 20:15:04,354 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.5s Time] [2022-01-10 20:15:04,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-01-10 20:15:04,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-01-10 20:15:04,358 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-10 20:15:04,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 354 transitions. [2022-01-10 20:15:04,359 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 354 transitions. Word has length 23 [2022-01-10 20:15:04,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:15:04,359 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 354 transitions. [2022-01-10 20:15:04,359 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-10 20:15:04,360 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 354 transitions. [2022-01-10 20:15:04,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-10 20:15:04,360 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:15:04,360 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-10 20:15:04,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 20:15:04,361 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-10 20:15:04,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:15:04,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1885697004, now seen corresponding path program 1 times [2022-01-10 20:15:04,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:15:04,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029864544] [2022-01-10 20:15:04,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:04,363 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:04,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:04,626 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:04,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029864544] [2022-01-10 20:15:04,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029864544] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:15:04,627 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:15:04,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-10 20:15:04,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495216472] [2022-01-10 20:15:04,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:15:04,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-10 20:15:04,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:15:04,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-10 20:15:04,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-01-10 20:15:04,628 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-10 20:15:06,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:15:06,524 INFO L93 Difference]: Finished difference Result 300 states and 357 transitions. [2022-01-10 20:15:06,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 20:15:06,525 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-10 20:15:06,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:15:06,526 INFO L225 Difference]: With dead ends: 300 [2022-01-10 20:15:06,526 INFO L226 Difference]: Without dead ends: 296 [2022-01-10 20:15:06,527 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-10 20:15:06,527 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.7s IncrementalHoareTripleChecker+Time [2022-01-10 20:15:06,527 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.7s Time] [2022-01-10 20:15:06,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-01-10 20:15:06,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-01-10 20:15:06,532 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-10 20:15:06,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 353 transitions. [2022-01-10 20:15:06,533 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 353 transitions. Word has length 27 [2022-01-10 20:15:06,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:15:06,533 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 353 transitions. [2022-01-10 20:15:06,533 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-10 20:15:06,533 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 353 transitions. [2022-01-10 20:15:06,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-10 20:15:06,534 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:15:06,534 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-10 20:15:06,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 20:15:06,534 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-10 20:15:06,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:15:06,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1037090204, now seen corresponding path program 1 times [2022-01-10 20:15:06,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:15:06,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573974010] [2022-01-10 20:15:06,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:06,535 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:06,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:06,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:06,891 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:06,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573974010] [2022-01-10 20:15:06,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573974010] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:15:06,891 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:15:06,892 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-10 20:15:06,892 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480429504] [2022-01-10 20:15:06,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:15:06,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-10 20:15:06,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:15:06,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-10 20:15:06,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-01-10 20:15:06,893 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-10 20:15:09,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:15:09,161 INFO L93 Difference]: Finished difference Result 300 states and 356 transitions. [2022-01-10 20:15:09,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 20:15:09,162 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-10 20:15:09,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:15:09,163 INFO L225 Difference]: With dead ends: 300 [2022-01-10 20:15:09,163 INFO L226 Difference]: Without dead ends: 296 [2022-01-10 20:15:09,163 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2022-01-10 20:15:09,164 INFO L933 BasicCegarLoop]: 323 mSDtfsCounter, 76 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 2809 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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-10 20:15:09,164 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-10 20:15:09,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-01-10 20:15:09,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-01-10 20:15:09,169 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-10 20:15:09,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 352 transitions. [2022-01-10 20:15:09,170 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 352 transitions. Word has length 31 [2022-01-10 20:15:09,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:15:09,170 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 352 transitions. [2022-01-10 20:15:09,170 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-10 20:15:09,170 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 352 transitions. [2022-01-10 20:15:09,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 20:15:09,171 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:15:09,171 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-10 20:15:09,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 20:15:09,171 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-10 20:15:09,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:15:09,172 INFO L85 PathProgramCache]: Analyzing trace with hash -873254882, now seen corresponding path program 1 times [2022-01-10 20:15:09,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:15:09,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856574172] [2022-01-10 20:15:09,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:09,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:09,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:09,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:09,321 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:09,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856574172] [2022-01-10 20:15:09,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856574172] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:15:09,321 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:15:09,321 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 20:15:09,321 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033863217] [2022-01-10 20:15:09,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:15:09,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 20:15:09,322 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:15:09,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 20:15:09,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-10 20:15:09,322 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-10 20:15:10,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:15:10,260 INFO L93 Difference]: Finished difference Result 300 states and 355 transitions. [2022-01-10 20:15:10,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 20:15:10,260 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-10 20:15:10,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:15:10,261 INFO L225 Difference]: With dead ends: 300 [2022-01-10 20:15:10,261 INFO L226 Difference]: Without dead ends: 296 [2022-01-10 20:15:10,262 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-10 20:15:10,262 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 295 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 1560 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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-10 20:15:10,262 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-10 20:15:10,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-01-10 20:15:10,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-01-10 20:15:10,266 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-10 20:15:10,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 351 transitions. [2022-01-10 20:15:10,267 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 351 transitions. Word has length 35 [2022-01-10 20:15:10,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:15:10,268 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 351 transitions. [2022-01-10 20:15:10,268 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-10 20:15:10,268 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 351 transitions. [2022-01-10 20:15:10,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-10 20:15:10,269 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:15:10,269 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-10 20:15:10,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 20:15:10,269 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-10 20:15:10,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:15:10,269 INFO L85 PathProgramCache]: Analyzing trace with hash -500617768, now seen corresponding path program 1 times [2022-01-10 20:15:10,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:15:10,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888079519] [2022-01-10 20:15:10,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:10,270 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:10,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:10,682 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:10,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888079519] [2022-01-10 20:15:10,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888079519] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:15:10,682 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:15:10,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-10 20:15:10,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89089775] [2022-01-10 20:15:10,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:15:10,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-10 20:15:10,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:15:10,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-10 20:15:10,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-01-10 20:15:10,684 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-10 20:15:13,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:15:13,432 INFO L93 Difference]: Finished difference Result 300 states and 354 transitions. [2022-01-10 20:15:13,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-10 20:15:13,432 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-10 20:15:13,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:15:13,434 INFO L225 Difference]: With dead ends: 300 [2022-01-10 20:15:13,434 INFO L226 Difference]: Without dead ends: 296 [2022-01-10 20:15:13,435 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2022-01-10 20:15:13,436 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.3s IncrementalHoareTripleChecker+Time [2022-01-10 20:15:13,436 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.3s Time] [2022-01-10 20:15:13,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-01-10 20:15:13,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-01-10 20:15:13,440 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-10 20:15:13,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 350 transitions. [2022-01-10 20:15:13,441 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 350 transitions. Word has length 39 [2022-01-10 20:15:13,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:15:13,441 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 350 transitions. [2022-01-10 20:15:13,441 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-10 20:15:13,441 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 350 transitions. [2022-01-10 20:15:13,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-10 20:15:13,442 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:15:13,442 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-10 20:15:13,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 20:15:13,443 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-10 20:15:13,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:15:13,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1565080466, now seen corresponding path program 1 times [2022-01-10 20:15:13,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:15:13,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792853630] [2022-01-10 20:15:13,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:13,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:13,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:13,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:13,621 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:13,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792853630] [2022-01-10 20:15:13,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792853630] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:15:13,621 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:15:13,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 20:15:13,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932800671] [2022-01-10 20:15:13,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:15:13,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 20:15:13,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:15:13,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 20:15:13,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-10 20:15:13,623 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-10 20:15:14,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:15:14,353 INFO L93 Difference]: Finished difference Result 300 states and 353 transitions. [2022-01-10 20:15:14,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 20:15:14,353 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-10 20:15:14,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:15:14,355 INFO L225 Difference]: With dead ends: 300 [2022-01-10 20:15:14,355 INFO L226 Difference]: Without dead ends: 296 [2022-01-10 20:15:14,355 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-10 20:15:14,356 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.7s IncrementalHoareTripleChecker+Time [2022-01-10 20:15:14,356 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.7s Time] [2022-01-10 20:15:14,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-01-10 20:15:14,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-01-10 20:15:14,360 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-10 20:15:14,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 349 transitions. [2022-01-10 20:15:14,361 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 349 transitions. Word has length 43 [2022-01-10 20:15:14,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:15:14,361 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 349 transitions. [2022-01-10 20:15:14,362 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-10 20:15:14,362 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 349 transitions. [2022-01-10 20:15:14,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-10 20:15:14,363 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:15:14,363 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-10 20:15:14,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 20:15:14,363 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-10 20:15:14,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:15:14,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1714726580, now seen corresponding path program 1 times [2022-01-10 20:15:14,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:15:14,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118252111] [2022-01-10 20:15:14,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:14,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:14,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:14,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:14,934 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:14,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118252111] [2022-01-10 20:15:14,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118252111] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:15:14,934 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:15:14,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-01-10 20:15:14,935 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144386691] [2022-01-10 20:15:14,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:15:14,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-10 20:15:14,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:15:14,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-10 20:15:14,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2022-01-10 20:15:14,936 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-10 20:15:18,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:15:18,499 INFO L93 Difference]: Finished difference Result 300 states and 352 transitions. [2022-01-10 20:15:18,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 20:15:18,500 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-10 20:15:18,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:15:18,501 INFO L225 Difference]: With dead ends: 300 [2022-01-10 20:15:18,501 INFO L226 Difference]: Without dead ends: 296 [2022-01-10 20:15:18,501 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2022-01-10 20:15:18,502 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-10 20:15:18,502 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-10 20:15:18,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-01-10 20:15:18,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-01-10 20:15:18,508 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-10 20:15:18,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 348 transitions. [2022-01-10 20:15:18,509 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 348 transitions. Word has length 47 [2022-01-10 20:15:18,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:15:18,509 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 348 transitions. [2022-01-10 20:15:18,509 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-10 20:15:18,509 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 348 transitions. [2022-01-10 20:15:18,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-10 20:15:18,510 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:15:18,510 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-10 20:15:18,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 20:15:18,510 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-10 20:15:18,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:15:18,511 INFO L85 PathProgramCache]: Analyzing trace with hash -131627258, now seen corresponding path program 1 times [2022-01-10 20:15:18,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:15:18,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436281296] [2022-01-10 20:15:18,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:18,511 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:18,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:19,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:19,226 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:19,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436281296] [2022-01-10 20:15:19,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436281296] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:15:19,226 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:15:19,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-10 20:15:19,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876124440] [2022-01-10 20:15:19,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:15:19,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-10 20:15:19,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:15:19,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-10 20:15:19,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2022-01-10 20:15:19,228 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-10 20:15:23,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:15:23,135 INFO L93 Difference]: Finished difference Result 300 states and 351 transitions. [2022-01-10 20:15:23,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-10 20:15:23,139 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-10 20:15:23,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:15:23,141 INFO L225 Difference]: With dead ends: 300 [2022-01-10 20:15:23,141 INFO L226 Difference]: Without dead ends: 296 [2022-01-10 20:15:23,141 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=141, Invalid=915, Unknown=0, NotChecked=0, Total=1056 [2022-01-10 20:15:23,142 INFO L933 BasicCegarLoop]: 298 mSDtfsCounter, 73 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 4323 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s 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.2s IncrementalHoareTripleChecker+Time [2022-01-10 20:15:23,142 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.2s Time] [2022-01-10 20:15:23,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-01-10 20:15:23,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-01-10 20:15:23,146 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-10 20:15:23,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 347 transitions. [2022-01-10 20:15:23,147 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 347 transitions. Word has length 51 [2022-01-10 20:15:23,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:15:23,147 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 347 transitions. [2022-01-10 20:15:23,148 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-10 20:15:23,148 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 347 transitions. [2022-01-10 20:15:23,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-10 20:15:23,148 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:15:23,148 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-10 20:15:23,148 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 20:15:23,149 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-10 20:15:23,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:15:23,149 INFO L85 PathProgramCache]: Analyzing trace with hash -589970240, now seen corresponding path program 1 times [2022-01-10 20:15:23,149 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:15:23,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771661103] [2022-01-10 20:15:23,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:23,149 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:23,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:23,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:23,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:23,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771661103] [2022-01-10 20:15:23,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771661103] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:15:23,322 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:15:23,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 20:15:23,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009831293] [2022-01-10 20:15:23,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:15:23,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 20:15:23,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:15:23,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 20:15:23,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-10 20:15:23,324 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-10 20:15:24,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:15:24,057 INFO L93 Difference]: Finished difference Result 300 states and 350 transitions. [2022-01-10 20:15:24,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 20:15:24,057 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-10 20:15:24,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:15:24,060 INFO L225 Difference]: With dead ends: 300 [2022-01-10 20:15:24,060 INFO L226 Difference]: Without dead ends: 296 [2022-01-10 20:15:24,062 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-10 20:15:24,063 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-10 20:15:24,063 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-10 20:15:24,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-01-10 20:15:24,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-01-10 20:15:24,068 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-10 20:15:24,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 346 transitions. [2022-01-10 20:15:24,069 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 346 transitions. Word has length 55 [2022-01-10 20:15:24,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:15:24,069 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 346 transitions. [2022-01-10 20:15:24,069 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-10 20:15:24,069 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 346 transitions. [2022-01-10 20:15:24,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-10 20:15:24,072 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:15:24,072 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-10 20:15:24,072 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 20:15:24,072 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-10 20:15:24,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:15:24,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1337060742, now seen corresponding path program 1 times [2022-01-10 20:15:24,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:15:24,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097934307] [2022-01-10 20:15:24,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:24,073 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:24,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:24,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:24,751 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:24,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097934307] [2022-01-10 20:15:24,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097934307] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:15:24,751 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:15:24,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-10 20:15:24,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015259632] [2022-01-10 20:15:24,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:15:24,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-10 20:15:24,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:15:24,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-10 20:15:24,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2022-01-10 20:15:24,753 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-10 20:15:29,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:15:29,223 INFO L93 Difference]: Finished difference Result 300 states and 349 transitions. [2022-01-10 20:15:29,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-10 20:15:29,225 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-10 20:15:29,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:15:29,226 INFO L225 Difference]: With dead ends: 300 [2022-01-10 20:15:29,226 INFO L226 Difference]: Without dead ends: 296 [2022-01-10 20:15:29,226 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=158, Invalid=1032, Unknown=0, NotChecked=0, Total=1190 [2022-01-10 20:15:29,227 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-10 20:15:29,227 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-10 20:15:29,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-01-10 20:15:29,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-01-10 20:15:29,231 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-10 20:15:29,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 345 transitions. [2022-01-10 20:15:29,232 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 345 transitions. Word has length 59 [2022-01-10 20:15:29,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:15:29,233 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 345 transitions. [2022-01-10 20:15:29,233 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-10 20:15:29,233 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 345 transitions. [2022-01-10 20:15:29,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-01-10 20:15:29,233 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:15:29,233 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-10 20:15:29,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 20:15:29,234 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-10 20:15:29,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:15:29,234 INFO L85 PathProgramCache]: Analyzing trace with hash -553095116, now seen corresponding path program 1 times [2022-01-10 20:15:29,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:15:29,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61346628] [2022-01-10 20:15:29,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:29,235 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:29,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:29,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:29,886 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:29,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61346628] [2022-01-10 20:15:29,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61346628] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:15:29,886 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:15:29,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-01-10 20:15:29,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042966804] [2022-01-10 20:15:29,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:15:29,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-10 20:15:29,887 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:15:29,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-10 20:15:29,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=378, Unknown=0, NotChecked=0, Total=420 [2022-01-10 20:15:29,888 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-10 20:15:34,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:15:34,664 INFO L93 Difference]: Finished difference Result 300 states and 348 transitions. [2022-01-10 20:15:34,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-10 20:15:34,664 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-10 20:15:34,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:15:34,665 INFO L225 Difference]: With dead ends: 300 [2022-01-10 20:15:34,665 INFO L226 Difference]: Without dead ends: 296 [2022-01-10 20:15:34,667 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-10 20:15:34,667 INFO L933 BasicCegarLoop]: 283 mSDtfsCounter, 132 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 5138 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s 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-10 20:15:34,668 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-10 20:15:34,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-01-10 20:15:34,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-01-10 20:15:34,672 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-10 20:15:34,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 344 transitions. [2022-01-10 20:15:34,673 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 344 transitions. Word has length 63 [2022-01-10 20:15:34,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:15:34,673 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 344 transitions. [2022-01-10 20:15:34,673 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-10 20:15:34,673 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 344 transitions. [2022-01-10 20:15:34,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-10 20:15:34,674 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:15:34,674 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-10 20:15:34,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 20:15:34,674 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-10 20:15:34,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:15:34,674 INFO L85 PathProgramCache]: Analyzing trace with hash -646128146, now seen corresponding path program 1 times [2022-01-10 20:15:34,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:15:34,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210084196] [2022-01-10 20:15:34,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:34,675 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:34,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:35,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:35,473 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:35,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210084196] [2022-01-10 20:15:35,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210084196] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:15:35,473 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:15:35,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-01-10 20:15:35,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918554545] [2022-01-10 20:15:35,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:15:35,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-10 20:15:35,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:15:35,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-10 20:15:35,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=418, Unknown=0, NotChecked=0, Total=462 [2022-01-10 20:15:35,475 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-10 20:15:40,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:15:40,574 INFO L93 Difference]: Finished difference Result 300 states and 347 transitions. [2022-01-10 20:15:40,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-10 20:15:40,575 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-10 20:15:40,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:15:40,576 INFO L225 Difference]: With dead ends: 300 [2022-01-10 20:15:40,576 INFO L226 Difference]: Without dead ends: 296 [2022-01-10 20:15:40,576 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=178, Invalid=1304, Unknown=0, NotChecked=0, Total=1482 [2022-01-10 20:15:40,576 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-10 20:15:40,578 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-10 20:15:40,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-01-10 20:15:40,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-01-10 20:15:40,581 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-10 20:15:40,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 343 transitions. [2022-01-10 20:15:40,582 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 343 transitions. Word has length 67 [2022-01-10 20:15:40,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:15:40,582 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 343 transitions. [2022-01-10 20:15:40,583 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-10 20:15:40,583 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 343 transitions. [2022-01-10 20:15:40,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-01-10 20:15:40,583 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:15:40,583 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-10 20:15:40,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 20:15:40,584 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-10 20:15:40,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:15:40,584 INFO L85 PathProgramCache]: Analyzing trace with hash 337861544, now seen corresponding path program 1 times [2022-01-10 20:15:40,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:15:40,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111525434] [2022-01-10 20:15:40,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:40,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:40,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:41,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:41,372 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:41,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111525434] [2022-01-10 20:15:41,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111525434] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:15:41,372 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:15:41,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-01-10 20:15:41,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367689259] [2022-01-10 20:15:41,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:15:41,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-10 20:15:41,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:15:41,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-10 20:15:41,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=460, Unknown=0, NotChecked=0, Total=506 [2022-01-10 20:15:41,373 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-10 20:15:46,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:15:46,716 INFO L93 Difference]: Finished difference Result 300 states and 346 transitions. [2022-01-10 20:15:46,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-10 20:15:46,716 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-10 20:15:46,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:15:46,717 INFO L225 Difference]: With dead ends: 300 [2022-01-10 20:15:46,717 INFO L226 Difference]: Without dead ends: 296 [2022-01-10 20:15:46,718 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-10 20:15:46,719 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-10 20:15:46,719 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-10 20:15:46,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-01-10 20:15:46,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-01-10 20:15:46,723 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-10 20:15:46,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 342 transitions. [2022-01-10 20:15:46,724 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 342 transitions. Word has length 71 [2022-01-10 20:15:46,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:15:46,724 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 342 transitions. [2022-01-10 20:15:46,724 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-10 20:15:46,724 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 342 transitions. [2022-01-10 20:15:46,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-01-10 20:15:46,725 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:15:46,725 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-10 20:15:46,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 20:15:46,725 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-10 20:15:46,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:15:46,726 INFO L85 PathProgramCache]: Analyzing trace with hash 125036898, now seen corresponding path program 1 times [2022-01-10 20:15:46,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:15:46,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238716474] [2022-01-10 20:15:46,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:15:46,726 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:15:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:15:47,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:15:47,582 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:15:47,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238716474] [2022-01-10 20:15:47,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238716474] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:15:47,583 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:15:47,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-01-10 20:15:47,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338522584] [2022-01-10 20:15:47,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:15:47,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-10 20:15:47,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:15:47,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-10 20:15:47,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=504, Unknown=0, NotChecked=0, Total=552 [2022-01-10 20:15:47,584 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)