/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_BITWISE.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.08.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 12:37:40,699 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 12:37:40,700 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 12:37:40,762 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 12:37:40,762 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 12:37:40,763 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 12:37:40,764 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 12:37:40,765 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 12:37:40,766 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 12:37:40,767 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 12:37:40,771 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 12:37:40,773 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 12:37:40,773 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 12:37:40,774 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 12:37:40,774 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 12:37:40,775 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 12:37:40,775 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 12:37:40,776 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 12:37:40,777 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 12:37:40,778 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 12:37:40,779 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 12:37:40,782 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 12:37:40,782 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 12:37:40,783 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 12:37:40,784 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 12:37:40,785 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 12:37:40,785 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 12:37:40,785 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 12:37:40,785 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 12:37:40,786 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 12:37:40,786 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 12:37:40,787 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 12:37:40,787 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 12:37:40,788 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 12:37:40,789 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 12:37:40,789 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 12:37:40,789 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 12:37:40,789 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 12:37:40,789 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 12:37:40,790 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 12:37:40,790 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 12:37:40,791 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf [2022-01-10 12:37:40,817 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 12:37:40,818 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 12:37:40,818 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 12:37:40,831 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 12:37:40,832 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 12:37:40,832 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 12:37:40,833 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 12:37:40,833 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 12:37:40,833 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 12:37:40,833 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 12:37:40,833 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 12:37:40,833 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 12:37:40,833 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 12:37:40,833 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 12:37:40,833 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 12:37:40,833 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 12:37:40,833 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 12:37:40,834 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 12:37:40,834 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 12:37:40,834 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 12:37:40,834 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 12:37:40,834 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 12:37:40,834 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 12:37:40,834 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 12:37:40,834 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 12:37:40,834 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 12:37:40,834 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 12:37:40,834 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 12:37:40,835 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 12:37:40,835 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 12:37:40,835 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 12:37:40,835 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 12:37:40,835 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 12:37:40,836 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_BITWISE 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 12:37:41,017 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 12:37:41,041 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 12:37:41,043 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 12:37:41,044 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 12:37:41,044 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 12:37:41,045 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.08.cil-1.c [2022-01-10 12:37:41,088 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4592ac04/dc642c142698434dbb6b865cbc31fa18/FLAG96892b80e [2022-01-10 12:37:41,480 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 12:37:41,480 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.08.cil-1.c [2022-01-10 12:37:41,488 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4592ac04/dc642c142698434dbb6b865cbc31fa18/FLAG96892b80e [2022-01-10 12:37:41,499 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4592ac04/dc642c142698434dbb6b865cbc31fa18 [2022-01-10 12:37:41,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 12:37:41,502 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 12:37:41,504 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 12:37:41,504 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 12:37:41,506 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 12:37:41,507 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:37:41" (1/1) ... [2022-01-10 12:37:41,508 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@955aee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:41, skipping insertion in model container [2022-01-10 12:37:41,508 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:37:41" (1/1) ... [2022-01-10 12:37:41,513 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 12:37:41,570 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 12:37:41,707 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.08.cil-1.c[671,684] [2022-01-10 12:37:41,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 12:37:41,790 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 12:37:41,797 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.08.cil-1.c[671,684] [2022-01-10 12:37:41,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 12:37:41,841 INFO L208 MainTranslator]: Completed translation [2022-01-10 12:37:41,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:41 WrapperNode [2022-01-10 12:37:41,842 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 12:37:41,843 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 12:37:41,843 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 12:37:41,843 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 12:37:41,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:41" (1/1) ... [2022-01-10 12:37:41,856 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:41" (1/1) ... [2022-01-10 12:37:41,894 INFO L137 Inliner]: procedures = 44, calls = 55, calls flagged for inlining = 50, calls inlined = 157, statements flattened = 2358 [2022-01-10 12:37:41,894 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 12:37:41,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 12:37:41,895 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 12:37:41,895 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 12:37:41,901 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:41" (1/1) ... [2022-01-10 12:37:41,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:41" (1/1) ... [2022-01-10 12:37:41,910 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:41" (1/1) ... [2022-01-10 12:37:41,910 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:41" (1/1) ... [2022-01-10 12:37:41,928 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:41" (1/1) ... [2022-01-10 12:37:41,944 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:41" (1/1) ... [2022-01-10 12:37:41,948 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:41" (1/1) ... [2022-01-10 12:37:41,955 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 12:37:41,956 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 12:37:41,956 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 12:37:41,956 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 12:37:41,957 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:41" (1/1) ... [2022-01-10 12:37:41,967 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 12:37:41,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 12:37:42,013 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 12:37:42,019 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 12:37:42,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 12:37:42,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 12:37:42,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 12:37:42,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 12:37:42,145 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 12:37:42,146 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 12:37:43,391 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 12:37:43,407 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 12:37:43,409 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-01-10 12:37:43,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:37:43 BoogieIcfgContainer [2022-01-10 12:37:43,413 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 12:37:43,414 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 12:37:43,414 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 12:37:43,415 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 12:37:43,417 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:37:43" (1/1) ... [2022-01-10 12:37:43,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 12:37:43 BasicIcfg [2022-01-10 12:37:43,618 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 12:37:43,620 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 12:37:43,620 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 12:37:43,622 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 12:37:43,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:37:41" (1/4) ... [2022-01-10 12:37:43,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@190a0b2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:37:43, skipping insertion in model container [2022-01-10 12:37:43,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:41" (2/4) ... [2022-01-10 12:37:43,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@190a0b2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:37:43, skipping insertion in model container [2022-01-10 12:37:43,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:37:43" (3/4) ... [2022-01-10 12:37:43,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@190a0b2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:37:43, skipping insertion in model container [2022-01-10 12:37:43,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 12:37:43" (4/4) ... [2022-01-10 12:37:43,624 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.08.cil-1.cTransformedIcfg [2022-01-10 12:37:43,630 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 12:37:43,630 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 12:37:43,664 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 12:37:43,669 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 12:37:43,669 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 12:37:43,691 INFO L276 IsEmpty]: Start isEmpty. Operand has 1000 states, 998 states have (on average 1.5150300601202404) internal successors, (1512), 999 states have internal predecessors, (1512), 0 states have call successors, (0), 0 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 12:37:43,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-01-10 12:37:43,699 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:37:43,700 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:37:43,701 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:37:43,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:37:43,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1736504725, now seen corresponding path program 1 times [2022-01-10 12:37:43,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:37:43,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386496868] [2022-01-10 12:37:43,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:37:43,760 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:37:43,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:37:44,010 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 12:37:44,010 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:37:44,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386496868] [2022-01-10 12:37:44,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386496868] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:37:44,011 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:37:44,011 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 12:37:44,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195952057] [2022-01-10 12:37:44,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:37:44,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:37:44,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:37:44,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:37:44,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:37:44,037 INFO L87 Difference]: Start difference. First operand has 1000 states, 998 states have (on average 1.5150300601202404) internal successors, (1512), 999 states have internal predecessors, (1512), 0 states have call successors, (0), 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 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:44,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:37:44,200 INFO L93 Difference]: Finished difference Result 2803 states and 4229 transitions. [2022-01-10 12:37:44,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:37:44,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2022-01-10 12:37:44,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:37:44,242 INFO L225 Difference]: With dead ends: 2803 [2022-01-10 12:37:44,242 INFO L226 Difference]: Without dead ends: 1810 [2022-01-10 12:37:44,250 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:37:44,252 INFO L933 BasicCegarLoop]: 1482 mSDtfsCounter, 1376 mSDsluCounter, 1294 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1376 SdHoareTripleChecker+Valid, 2776 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:37:44,253 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1376 Valid, 2776 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:37:44,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2022-01-10 12:37:44,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1808. [2022-01-10 12:37:44,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1808 states, 1807 states have (on average 1.484781405644715) internal successors, (2683), 1807 states have internal predecessors, (2683), 0 states have call successors, (0), 0 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 12:37:44,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2683 transitions. [2022-01-10 12:37:44,391 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2683 transitions. Word has length 120 [2022-01-10 12:37:44,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:37:44,392 INFO L470 AbstractCegarLoop]: Abstraction has 1808 states and 2683 transitions. [2022-01-10 12:37:44,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:44,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2683 transitions. [2022-01-10 12:37:44,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-01-10 12:37:44,400 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:37:44,400 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:37:44,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 12:37:44,400 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:37:44,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:37:44,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1388670645, now seen corresponding path program 1 times [2022-01-10 12:37:44,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:37:44,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387287588] [2022-01-10 12:37:44,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:37:44,404 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:37:44,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:37:44,490 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 12:37:44,491 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:37:44,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387287588] [2022-01-10 12:37:44,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387287588] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:37:44,491 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:37:44,491 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 12:37:44,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145725252] [2022-01-10 12:37:44,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:37:44,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:37:44,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:37:44,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:37:44,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:37:44,493 INFO L87 Difference]: Start difference. First operand 1808 states and 2683 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:44,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:37:44,594 INFO L93 Difference]: Finished difference Result 3600 states and 5340 transitions. [2022-01-10 12:37:44,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:37:44,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2022-01-10 12:37:44,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:37:44,602 INFO L225 Difference]: With dead ends: 3600 [2022-01-10 12:37:44,602 INFO L226 Difference]: Without dead ends: 1808 [2022-01-10 12:37:44,608 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:37:44,609 INFO L933 BasicCegarLoop]: 1472 mSDtfsCounter, 1462 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1462 SdHoareTripleChecker+Valid, 1472 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:37:44,610 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1462 Valid, 1472 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:37:44,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2022-01-10 12:37:44,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1808. [2022-01-10 12:37:44,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1808 states, 1807 states have (on average 1.4803541781959049) internal successors, (2675), 1807 states have internal predecessors, (2675), 0 states have call successors, (0), 0 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 12:37:44,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2675 transitions. [2022-01-10 12:37:44,661 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2675 transitions. Word has length 120 [2022-01-10 12:37:44,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:37:44,663 INFO L470 AbstractCegarLoop]: Abstraction has 1808 states and 2675 transitions. [2022-01-10 12:37:44,663 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:44,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2675 transitions. [2022-01-10 12:37:44,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-01-10 12:37:44,670 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:37:44,670 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:37:44,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 12:37:44,673 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:37:44,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:37:44,676 INFO L85 PathProgramCache]: Analyzing trace with hash -562212459, now seen corresponding path program 1 times [2022-01-10 12:37:44,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:37:44,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49255038] [2022-01-10 12:37:44,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:37:44,676 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:37:44,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:37:44,760 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 12:37:44,761 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:37:44,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49255038] [2022-01-10 12:37:44,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49255038] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:37:44,762 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:37:44,763 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 12:37:44,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403221043] [2022-01-10 12:37:44,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:37:44,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:37:44,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:37:44,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:37:44,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:37:44,765 INFO L87 Difference]: Start difference. First operand 1808 states and 2675 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:44,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:37:44,821 INFO L93 Difference]: Finished difference Result 3599 states and 5323 transitions. [2022-01-10 12:37:44,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:37:44,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2022-01-10 12:37:44,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:37:44,828 INFO L225 Difference]: With dead ends: 3599 [2022-01-10 12:37:44,828 INFO L226 Difference]: Without dead ends: 1808 [2022-01-10 12:37:44,832 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:37:44,835 INFO L933 BasicCegarLoop]: 1467 mSDtfsCounter, 1456 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1456 SdHoareTripleChecker+Valid, 1467 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:37:44,836 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1456 Valid, 1467 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:37:44,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2022-01-10 12:37:44,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1808. [2022-01-10 12:37:44,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1808 states, 1807 states have (on average 1.4759269507470947) internal successors, (2667), 1807 states have internal predecessors, (2667), 0 states have call successors, (0), 0 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 12:37:44,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2667 transitions. [2022-01-10 12:37:44,884 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2667 transitions. Word has length 120 [2022-01-10 12:37:44,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:37:44,885 INFO L470 AbstractCegarLoop]: Abstraction has 1808 states and 2667 transitions. [2022-01-10 12:37:44,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:44,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2667 transitions. [2022-01-10 12:37:44,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-01-10 12:37:44,887 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:37:44,887 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:37:44,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 12:37:44,887 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:37:44,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:37:44,888 INFO L85 PathProgramCache]: Analyzing trace with hash 483234485, now seen corresponding path program 1 times [2022-01-10 12:37:44,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:37:44,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030648213] [2022-01-10 12:37:44,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:37:44,888 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:37:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:37:44,992 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 12:37:44,993 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:37:44,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030648213] [2022-01-10 12:37:44,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030648213] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:37:44,993 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:37:44,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 12:37:44,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746382884] [2022-01-10 12:37:44,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:37:44,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:37:44,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:37:44,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:37:44,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:37:44,994 INFO L87 Difference]: Start difference. First operand 1808 states and 2667 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:45,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:37:45,089 INFO L93 Difference]: Finished difference Result 3598 states and 5306 transitions. [2022-01-10 12:37:45,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:37:45,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2022-01-10 12:37:45,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:37:45,109 INFO L225 Difference]: With dead ends: 3598 [2022-01-10 12:37:45,110 INFO L226 Difference]: Without dead ends: 1808 [2022-01-10 12:37:45,130 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:37:45,135 INFO L933 BasicCegarLoop]: 1462 mSDtfsCounter, 1450 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1450 SdHoareTripleChecker+Valid, 1462 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:37:45,136 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1450 Valid, 1462 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:37:45,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2022-01-10 12:37:45,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1808. [2022-01-10 12:37:45,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1808 states, 1807 states have (on average 1.4714997232982845) internal successors, (2659), 1807 states have internal predecessors, (2659), 0 states have call successors, (0), 0 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 12:37:45,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2659 transitions. [2022-01-10 12:37:45,190 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2659 transitions. Word has length 120 [2022-01-10 12:37:45,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:37:45,191 INFO L470 AbstractCegarLoop]: Abstraction has 1808 states and 2659 transitions. [2022-01-10 12:37:45,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:45,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2659 transitions. [2022-01-10 12:37:45,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-01-10 12:37:45,192 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:37:45,192 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:37:45,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 12:37:45,192 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:37:45,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:37:45,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1625337237, now seen corresponding path program 1 times [2022-01-10 12:37:45,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:37:45,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206209250] [2022-01-10 12:37:45,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:37:45,193 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:37:45,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:37:45,234 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 12:37:45,234 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:37:45,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206209250] [2022-01-10 12:37:45,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206209250] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:37:45,235 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:37:45,235 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 12:37:45,235 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073902164] [2022-01-10 12:37:45,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:37:45,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:37:45,236 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:37:45,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:37:45,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:37:45,236 INFO L87 Difference]: Start difference. First operand 1808 states and 2659 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:45,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:37:45,296 INFO L93 Difference]: Finished difference Result 3597 states and 5289 transitions. [2022-01-10 12:37:45,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:37:45,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2022-01-10 12:37:45,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:37:45,302 INFO L225 Difference]: With dead ends: 3597 [2022-01-10 12:37:45,302 INFO L226 Difference]: Without dead ends: 1808 [2022-01-10 12:37:45,304 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:37:45,305 INFO L933 BasicCegarLoop]: 1457 mSDtfsCounter, 1444 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1444 SdHoareTripleChecker+Valid, 1457 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:37:45,305 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1444 Valid, 1457 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:37:45,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2022-01-10 12:37:45,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1808. [2022-01-10 12:37:45,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1808 states, 1807 states have (on average 1.4670724958494743) internal successors, (2651), 1807 states have internal predecessors, (2651), 0 states have call successors, (0), 0 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 12:37:45,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2651 transitions. [2022-01-10 12:37:45,397 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2651 transitions. Word has length 120 [2022-01-10 12:37:45,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:37:45,398 INFO L470 AbstractCegarLoop]: Abstraction has 1808 states and 2651 transitions. [2022-01-10 12:37:45,401 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:45,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2651 transitions. [2022-01-10 12:37:45,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-01-10 12:37:45,404 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:37:45,404 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:37:45,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 12:37:45,404 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:37:45,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:37:45,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1385084597, now seen corresponding path program 1 times [2022-01-10 12:37:45,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:37:45,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175597390] [2022-01-10 12:37:45,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:37:45,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:37:45,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:37:45,446 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 12:37:45,446 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:37:45,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175597390] [2022-01-10 12:37:45,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175597390] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:37:45,447 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:37:45,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 12:37:45,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874935261] [2022-01-10 12:37:45,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:37:45,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:37:45,447 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:37:45,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:37:45,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:37:45,448 INFO L87 Difference]: Start difference. First operand 1808 states and 2651 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:45,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:37:45,529 INFO L93 Difference]: Finished difference Result 3595 states and 5270 transitions. [2022-01-10 12:37:45,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:37:45,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2022-01-10 12:37:45,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:37:45,535 INFO L225 Difference]: With dead ends: 3595 [2022-01-10 12:37:45,535 INFO L226 Difference]: Without dead ends: 1808 [2022-01-10 12:37:45,538 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:37:45,539 INFO L933 BasicCegarLoop]: 1452 mSDtfsCounter, 1437 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1437 SdHoareTripleChecker+Valid, 1452 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:37:45,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1437 Valid, 1452 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:37:45,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2022-01-10 12:37:45,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1808. [2022-01-10 12:37:45,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1808 states, 1807 states have (on average 1.4626452684006641) internal successors, (2643), 1807 states have internal predecessors, (2643), 0 states have call successors, (0), 0 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 12:37:45,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2643 transitions. [2022-01-10 12:37:45,614 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2643 transitions. Word has length 120 [2022-01-10 12:37:45,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:37:45,615 INFO L470 AbstractCegarLoop]: Abstraction has 1808 states and 2643 transitions. [2022-01-10 12:37:45,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:45,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2643 transitions. [2022-01-10 12:37:45,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-01-10 12:37:45,616 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:37:45,616 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:37:45,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 12:37:45,616 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:37:45,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:37:45,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1147963349, now seen corresponding path program 1 times [2022-01-10 12:37:45,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:37:45,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158194362] [2022-01-10 12:37:45,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:37:45,617 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:37:45,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:37:45,664 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 12:37:45,664 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:37:45,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158194362] [2022-01-10 12:37:45,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158194362] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:37:45,665 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:37:45,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 12:37:45,665 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491213372] [2022-01-10 12:37:45,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:37:45,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:37:45,666 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:37:45,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:37:45,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:37:45,666 INFO L87 Difference]: Start difference. First operand 1808 states and 2643 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:45,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:37:45,744 INFO L93 Difference]: Finished difference Result 3594 states and 5253 transitions. [2022-01-10 12:37:45,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:37:45,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2022-01-10 12:37:45,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:37:45,750 INFO L225 Difference]: With dead ends: 3594 [2022-01-10 12:37:45,750 INFO L226 Difference]: Without dead ends: 1808 [2022-01-10 12:37:45,752 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:37:45,753 INFO L933 BasicCegarLoop]: 1447 mSDtfsCounter, 1431 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1431 SdHoareTripleChecker+Valid, 1447 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:37:45,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1431 Valid, 1447 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:37:45,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2022-01-10 12:37:45,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1808. [2022-01-10 12:37:45,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1808 states, 1807 states have (on average 1.458218040951854) internal successors, (2635), 1807 states have internal predecessors, (2635), 0 states have call successors, (0), 0 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 12:37:45,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2635 transitions. [2022-01-10 12:37:45,813 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2635 transitions. Word has length 120 [2022-01-10 12:37:45,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:37:45,813 INFO L470 AbstractCegarLoop]: Abstraction has 1808 states and 2635 transitions. [2022-01-10 12:37:45,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:45,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2635 transitions. [2022-01-10 12:37:45,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-01-10 12:37:45,814 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:37:45,814 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:37:45,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 12:37:45,814 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:37:45,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:37:45,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1694503605, now seen corresponding path program 1 times [2022-01-10 12:37:45,815 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:37:45,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63273261] [2022-01-10 12:37:45,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:37:45,815 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:37:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:37:45,855 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 12:37:45,855 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:37:45,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63273261] [2022-01-10 12:37:45,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63273261] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:37:45,855 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:37:45,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 12:37:45,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517109207] [2022-01-10 12:37:45,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:37:45,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:37:45,856 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:37:45,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:37:45,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:37:45,856 INFO L87 Difference]: Start difference. First operand 1808 states and 2635 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:45,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:37:45,929 INFO L93 Difference]: Finished difference Result 3593 states and 5236 transitions. [2022-01-10 12:37:45,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:37:45,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2022-01-10 12:37:45,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:37:45,935 INFO L225 Difference]: With dead ends: 3593 [2022-01-10 12:37:45,935 INFO L226 Difference]: Without dead ends: 1808 [2022-01-10 12:37:45,937 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:37:45,937 INFO L933 BasicCegarLoop]: 1442 mSDtfsCounter, 1425 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1425 SdHoareTripleChecker+Valid, 1442 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:37:45,937 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1425 Valid, 1442 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:37:45,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2022-01-10 12:37:45,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1808. [2022-01-10 12:37:45,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1808 states, 1807 states have (on average 1.4537908135030437) internal successors, (2627), 1807 states have internal predecessors, (2627), 0 states have call successors, (0), 0 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 12:37:45,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2627 transitions. [2022-01-10 12:37:45,996 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2627 transitions. Word has length 120 [2022-01-10 12:37:45,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:37:45,997 INFO L470 AbstractCegarLoop]: Abstraction has 1808 states and 2627 transitions. [2022-01-10 12:37:45,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:45,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2627 transitions. [2022-01-10 12:37:45,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-01-10 12:37:45,998 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:37:45,998 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:37:45,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 12:37:45,998 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:37:45,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:37:45,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1335907371, now seen corresponding path program 1 times [2022-01-10 12:37:45,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:37:45,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995030056] [2022-01-10 12:37:45,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:37:45,999 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:37:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:37:46,031 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 12:37:46,031 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:37:46,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995030056] [2022-01-10 12:37:46,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995030056] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:37:46,031 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:37:46,031 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 12:37:46,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836884149] [2022-01-10 12:37:46,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:37:46,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:37:46,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:37:46,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:37:46,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:37:46,033 INFO L87 Difference]: Start difference. First operand 1808 states and 2627 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:46,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:37:46,118 INFO L93 Difference]: Finished difference Result 3592 states and 5219 transitions. [2022-01-10 12:37:46,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:37:46,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2022-01-10 12:37:46,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:37:46,125 INFO L225 Difference]: With dead ends: 3592 [2022-01-10 12:37:46,125 INFO L226 Difference]: Without dead ends: 1808 [2022-01-10 12:37:46,127 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:37:46,128 INFO L933 BasicCegarLoop]: 1415 mSDtfsCounter, 1316 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1316 SdHoareTripleChecker+Valid, 1503 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:37:46,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1316 Valid, 1503 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:37:46,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2022-01-10 12:37:46,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1808. [2022-01-10 12:37:46,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1808 states, 1807 states have (on average 1.438295517432208) internal successors, (2599), 1807 states have internal predecessors, (2599), 0 states have call successors, (0), 0 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 12:37:46,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2599 transitions. [2022-01-10 12:37:46,185 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2599 transitions. Word has length 120 [2022-01-10 12:37:46,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:37:46,185 INFO L470 AbstractCegarLoop]: Abstraction has 1808 states and 2599 transitions. [2022-01-10 12:37:46,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:46,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2599 transitions. [2022-01-10 12:37:46,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-01-10 12:37:46,186 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:37:46,186 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:37:46,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 12:37:46,187 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:37:46,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:37:46,187 INFO L85 PathProgramCache]: Analyzing trace with hash -706607820, now seen corresponding path program 1 times [2022-01-10 12:37:46,187 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:37:46,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855263841] [2022-01-10 12:37:46,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:37:46,188 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:37:46,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:37:46,221 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 12:37:46,221 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:37:46,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855263841] [2022-01-10 12:37:46,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855263841] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:37:46,221 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:37:46,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 12:37:46,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360208760] [2022-01-10 12:37:46,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:37:46,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:37:46,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:37:46,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:37:46,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:37:46,223 INFO L87 Difference]: Start difference. First operand 1808 states and 2599 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:46,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:37:46,343 INFO L93 Difference]: Finished difference Result 3591 states and 5162 transitions. [2022-01-10 12:37:46,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:37:46,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2022-01-10 12:37:46,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:37:46,348 INFO L225 Difference]: With dead ends: 3591 [2022-01-10 12:37:46,348 INFO L226 Difference]: Without dead ends: 1808 [2022-01-10 12:37:46,350 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:37:46,351 INFO L933 BasicCegarLoop]: 1399 mSDtfsCounter, 1300 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1300 SdHoareTripleChecker+Valid, 1486 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:37:46,352 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1300 Valid, 1486 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:37:46,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2022-01-10 12:37:46,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1808. [2022-01-10 12:37:46,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1808 states, 1807 states have (on average 1.4228002213613724) internal successors, (2571), 1807 states have internal predecessors, (2571), 0 states have call successors, (0), 0 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 12:37:46,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2571 transitions. [2022-01-10 12:37:46,413 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2571 transitions. Word has length 120 [2022-01-10 12:37:46,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:37:46,413 INFO L470 AbstractCegarLoop]: Abstraction has 1808 states and 2571 transitions. [2022-01-10 12:37:46,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:46,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2571 transitions. [2022-01-10 12:37:46,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-01-10 12:37:46,414 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:37:46,414 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:37:46,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 12:37:46,415 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:37:46,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:37:46,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1661630445, now seen corresponding path program 1 times [2022-01-10 12:37:46,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:37:46,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273568408] [2022-01-10 12:37:46,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:37:46,415 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:37:46,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:37:46,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 12:37:46,449 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:37:46,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273568408] [2022-01-10 12:37:46,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273568408] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:37:46,450 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:37:46,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 12:37:46,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924336708] [2022-01-10 12:37:46,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:37:46,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:37:46,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:37:46,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:37:46,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:37:46,451 INFO L87 Difference]: Start difference. First operand 1808 states and 2571 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:46,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:37:46,527 INFO L93 Difference]: Finished difference Result 3590 states and 5105 transitions. [2022-01-10 12:37:46,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:37:46,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2022-01-10 12:37:46,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:37:46,532 INFO L225 Difference]: With dead ends: 3590 [2022-01-10 12:37:46,532 INFO L226 Difference]: Without dead ends: 1808 [2022-01-10 12:37:46,534 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:37:46,534 INFO L933 BasicCegarLoop]: 1383 mSDtfsCounter, 1284 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1284 SdHoareTripleChecker+Valid, 1469 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:37:46,534 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1284 Valid, 1469 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:37:46,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2022-01-10 12:37:46,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1808. [2022-01-10 12:37:46,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1808 states, 1807 states have (on average 1.4073049252905367) internal successors, (2543), 1807 states have internal predecessors, (2543), 0 states have call successors, (0), 0 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 12:37:46,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2543 transitions. [2022-01-10 12:37:46,588 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2543 transitions. Word has length 120 [2022-01-10 12:37:46,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:37:46,588 INFO L470 AbstractCegarLoop]: Abstraction has 1808 states and 2543 transitions. [2022-01-10 12:37:46,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:46,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2543 transitions. [2022-01-10 12:37:46,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-01-10 12:37:46,589 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:37:46,589 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:37:46,589 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 12:37:46,589 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:37:46,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:37:46,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1269719054, now seen corresponding path program 1 times [2022-01-10 12:37:46,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:37:46,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297900347] [2022-01-10 12:37:46,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:37:46,590 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:37:46,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:37:46,624 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 12:37:46,624 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:37:46,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297900347] [2022-01-10 12:37:46,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297900347] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:37:46,624 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:37:46,624 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 12:37:46,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673092973] [2022-01-10 12:37:46,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:37:46,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:37:46,625 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:37:46,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:37:46,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:37:46,626 INFO L87 Difference]: Start difference. First operand 1808 states and 2543 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:46,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:37:46,731 INFO L93 Difference]: Finished difference Result 3589 states and 5048 transitions. [2022-01-10 12:37:46,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:37:46,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2022-01-10 12:37:46,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:37:46,737 INFO L225 Difference]: With dead ends: 3589 [2022-01-10 12:37:46,737 INFO L226 Difference]: Without dead ends: 1808 [2022-01-10 12:37:46,739 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:37:46,739 INFO L933 BasicCegarLoop]: 1367 mSDtfsCounter, 1268 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1268 SdHoareTripleChecker+Valid, 1452 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:37:46,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1268 Valid, 1452 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:37:46,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2022-01-10 12:37:46,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1808. [2022-01-10 12:37:46,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1808 states, 1807 states have (on average 1.391809629219701) internal successors, (2515), 1807 states have internal predecessors, (2515), 0 states have call successors, (0), 0 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 12:37:46,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2515 transitions. [2022-01-10 12:37:46,810 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2515 transitions. Word has length 120 [2022-01-10 12:37:46,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:37:46,811 INFO L470 AbstractCegarLoop]: Abstraction has 1808 states and 2515 transitions. [2022-01-10 12:37:46,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:46,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2515 transitions. [2022-01-10 12:37:46,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-01-10 12:37:46,812 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:37:46,812 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:37:46,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 12:37:46,812 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:37:46,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:37:46,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1160228527, now seen corresponding path program 1 times [2022-01-10 12:37:46,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:37:46,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240084290] [2022-01-10 12:37:46,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:37:46,813 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:37:46,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:37:46,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 12:37:46,843 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:37:46,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240084290] [2022-01-10 12:37:46,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240084290] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:37:46,843 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:37:46,844 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 12:37:46,844 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340303499] [2022-01-10 12:37:46,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:37:46,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:37:46,844 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:37:46,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:37:46,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:37:46,845 INFO L87 Difference]: Start difference. First operand 1808 states and 2515 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:46,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:37:46,923 INFO L93 Difference]: Finished difference Result 3587 states and 4989 transitions. [2022-01-10 12:37:46,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:37:46,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2022-01-10 12:37:46,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:37:46,928 INFO L225 Difference]: With dead ends: 3587 [2022-01-10 12:37:46,928 INFO L226 Difference]: Without dead ends: 1808 [2022-01-10 12:37:46,931 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:37:46,932 INFO L933 BasicCegarLoop]: 1351 mSDtfsCounter, 1251 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1251 SdHoareTripleChecker+Valid, 1435 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:37:46,932 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1251 Valid, 1435 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:37:46,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2022-01-10 12:37:46,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1808. [2022-01-10 12:37:46,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1808 states, 1807 states have (on average 1.3763143331488654) internal successors, (2487), 1807 states have internal predecessors, (2487), 0 states have call successors, (0), 0 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 12:37:47,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2487 transitions. [2022-01-10 12:37:47,000 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2487 transitions. Word has length 120 [2022-01-10 12:37:47,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:37:47,001 INFO L470 AbstractCegarLoop]: Abstraction has 1808 states and 2487 transitions. [2022-01-10 12:37:47,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:47,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2487 transitions. [2022-01-10 12:37:47,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-01-10 12:37:47,002 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:37:47,002 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:37:47,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 12:37:47,002 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:37:47,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:37:47,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1347817168, now seen corresponding path program 1 times [2022-01-10 12:37:47,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:37:47,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329034923] [2022-01-10 12:37:47,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:37:47,003 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:37:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:37:47,048 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 12:37:47,048 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:37:47,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329034923] [2022-01-10 12:37:47,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329034923] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:37:47,048 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:37:47,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 12:37:47,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372039660] [2022-01-10 12:37:47,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:37:47,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:37:47,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:37:47,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:37:47,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:37:47,050 INFO L87 Difference]: Start difference. First operand 1808 states and 2487 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:47,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:37:47,157 INFO L93 Difference]: Finished difference Result 3586 states and 4932 transitions. [2022-01-10 12:37:47,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:37:47,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2022-01-10 12:37:47,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:37:47,177 INFO L225 Difference]: With dead ends: 3586 [2022-01-10 12:37:47,177 INFO L226 Difference]: Without dead ends: 1808 [2022-01-10 12:37:47,180 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:37:47,180 INFO L933 BasicCegarLoop]: 1335 mSDtfsCounter, 1235 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1235 SdHoareTripleChecker+Valid, 1418 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:37:47,181 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1235 Valid, 1418 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:37:47,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2022-01-10 12:37:47,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1808. [2022-01-10 12:37:47,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1808 states, 1807 states have (on average 1.36081903707803) internal successors, (2459), 1807 states have internal predecessors, (2459), 0 states have call successors, (0), 0 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 12:37:47,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2459 transitions. [2022-01-10 12:37:47,248 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2459 transitions. Word has length 120 [2022-01-10 12:37:47,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:37:47,248 INFO L470 AbstractCegarLoop]: Abstraction has 1808 states and 2459 transitions. [2022-01-10 12:37:47,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:47,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2459 transitions. [2022-01-10 12:37:47,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-01-10 12:37:47,249 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:37:47,249 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:37:47,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 12:37:47,249 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:37:47,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:37:47,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1631897103, now seen corresponding path program 1 times [2022-01-10 12:37:47,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:37:47,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177779525] [2022-01-10 12:37:47,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:37:47,250 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:37:47,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:37:47,281 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 12:37:47,281 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:37:47,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177779525] [2022-01-10 12:37:47,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177779525] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:37:47,281 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:37:47,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 12:37:47,282 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081104761] [2022-01-10 12:37:47,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:37:47,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:37:47,282 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:37:47,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:37:47,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:37:47,283 INFO L87 Difference]: Start difference. First operand 1808 states and 2459 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:47,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:37:47,371 INFO L93 Difference]: Finished difference Result 3585 states and 4875 transitions. [2022-01-10 12:37:47,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:37:47,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2022-01-10 12:37:47,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:37:47,374 INFO L225 Difference]: With dead ends: 3585 [2022-01-10 12:37:47,374 INFO L226 Difference]: Without dead ends: 1808 [2022-01-10 12:37:47,378 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:37:47,379 INFO L933 BasicCegarLoop]: 1319 mSDtfsCounter, 1219 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1219 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:37:47,379 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1219 Valid, 1401 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:37:47,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2022-01-10 12:37:47,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1808. [2022-01-10 12:37:47,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1808 states, 1807 states have (on average 1.3453237410071943) internal successors, (2431), 1807 states have internal predecessors, (2431), 0 states have call successors, (0), 0 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 12:37:47,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2431 transitions. [2022-01-10 12:37:47,444 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2431 transitions. Word has length 120 [2022-01-10 12:37:47,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:37:47,444 INFO L470 AbstractCegarLoop]: Abstraction has 1808 states and 2431 transitions. [2022-01-10 12:37:47,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:47,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2431 transitions. [2022-01-10 12:37:47,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-01-10 12:37:47,445 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:37:47,445 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:37:47,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 12:37:47,446 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:37:47,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:37:47,446 INFO L85 PathProgramCache]: Analyzing trace with hash 173610094, now seen corresponding path program 1 times [2022-01-10 12:37:47,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:37:47,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745751395] [2022-01-10 12:37:47,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:37:47,446 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:37:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:37:47,492 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 12:37:47,492 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:37:47,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745751395] [2022-01-10 12:37:47,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745751395] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:37:47,494 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:37:47,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 12:37:47,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081124909] [2022-01-10 12:37:47,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:37:47,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:37:47,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:37:47,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:37:47,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:37:47,495 INFO L87 Difference]: Start difference. First operand 1808 states and 2431 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:47,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:37:47,579 INFO L93 Difference]: Finished difference Result 3584 states and 4818 transitions. [2022-01-10 12:37:47,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:37:47,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2022-01-10 12:37:47,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:37:47,582 INFO L225 Difference]: With dead ends: 3584 [2022-01-10 12:37:47,582 INFO L226 Difference]: Without dead ends: 1808 [2022-01-10 12:37:47,584 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:37:47,584 INFO L933 BasicCegarLoop]: 1303 mSDtfsCounter, 1203 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1203 SdHoareTripleChecker+Valid, 1384 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:37:47,584 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1203 Valid, 1384 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:37:47,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2022-01-10 12:37:47,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1808. [2022-01-10 12:37:47,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1808 states, 1807 states have (on average 1.3298284449363587) internal successors, (2403), 1807 states have internal predecessors, (2403), 0 states have call successors, (0), 0 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 12:37:47,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2403 transitions. [2022-01-10 12:37:47,649 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2403 transitions. Word has length 120 [2022-01-10 12:37:47,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:37:47,649 INFO L470 AbstractCegarLoop]: Abstraction has 1808 states and 2403 transitions. [2022-01-10 12:37:47,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:47,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2403 transitions. [2022-01-10 12:37:47,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-01-10 12:37:47,650 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:37:47,650 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:37:47,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 12:37:47,650 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:37:47,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:37:47,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1620633549, now seen corresponding path program 1 times [2022-01-10 12:37:47,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:37:47,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297526192] [2022-01-10 12:37:47,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:37:47,651 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:37:47,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:37:47,702 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 12:37:47,702 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:37:47,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297526192] [2022-01-10 12:37:47,702 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297526192] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:37:47,703 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:37:47,703 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 12:37:47,703 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825672524] [2022-01-10 12:37:47,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:37:47,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 12:37:47,703 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:37:47,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 12:37:47,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 12:37:47,704 INFO L87 Difference]: Start difference. First operand 1808 states and 2403 transitions. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:47,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:37:47,913 INFO L93 Difference]: Finished difference Result 4352 states and 5827 transitions. [2022-01-10 12:37:47,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 12:37:47,913 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2022-01-10 12:37:47,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:37:47,916 INFO L225 Difference]: With dead ends: 4352 [2022-01-10 12:37:47,916 INFO L226 Difference]: Without dead ends: 2590 [2022-01-10 12:37:47,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 12:37:47,919 INFO L933 BasicCegarLoop]: 1409 mSDtfsCounter, 3592 mSDsluCounter, 1668 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3592 SdHoareTripleChecker+Valid, 3077 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 12:37:47,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3592 Valid, 3077 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 12:37:47,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2590 states. [2022-01-10 12:37:48,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2590 to 1814. [2022-01-10 12:37:48,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1814 states, 1813 states have (on average 1.3177054605626035) internal successors, (2389), 1813 states have internal predecessors, (2389), 0 states have call successors, (0), 0 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 12:37:48,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1814 states to 1814 states and 2389 transitions. [2022-01-10 12:37:48,028 INFO L78 Accepts]: Start accepts. Automaton has 1814 states and 2389 transitions. Word has length 120 [2022-01-10 12:37:48,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:37:48,028 INFO L470 AbstractCegarLoop]: Abstraction has 1814 states and 2389 transitions. [2022-01-10 12:37:48,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:48,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1814 states and 2389 transitions. [2022-01-10 12:37:48,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-01-10 12:37:48,030 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:37:48,030 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:37:48,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 12:37:48,030 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:37:48,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:37:48,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1634166350, now seen corresponding path program 1 times [2022-01-10 12:37:48,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:37:48,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806724936] [2022-01-10 12:37:48,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:37:48,031 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:37:48,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:37:48,063 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 12:37:48,063 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:37:48,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806724936] [2022-01-10 12:37:48,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806724936] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:37:48,063 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:37:48,063 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 12:37:48,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577502871] [2022-01-10 12:37:48,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:37:48,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:37:48,064 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:37:48,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:37:48,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:37:48,065 INFO L87 Difference]: Start difference. First operand 1814 states and 2389 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:48,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:37:48,237 INFO L93 Difference]: Finished difference Result 5111 states and 6726 transitions. [2022-01-10 12:37:48,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:37:48,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2022-01-10 12:37:48,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:37:48,243 INFO L225 Difference]: With dead ends: 5111 [2022-01-10 12:37:48,243 INFO L226 Difference]: Without dead ends: 3359 [2022-01-10 12:37:48,245 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:37:48,246 INFO L933 BasicCegarLoop]: 1293 mSDtfsCounter, 1129 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1129 SdHoareTripleChecker+Valid, 2428 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:37:48,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1129 Valid, 2428 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:37:48,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3359 states. [2022-01-10 12:37:48,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3359 to 3353. [2022-01-10 12:37:48,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3353 states, 3352 states have (on average 1.3099642004773269) internal successors, (4391), 3352 states have internal predecessors, (4391), 0 states have call successors, (0), 0 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 12:37:48,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3353 states to 3353 states and 4391 transitions. [2022-01-10 12:37:48,431 INFO L78 Accepts]: Start accepts. Automaton has 3353 states and 4391 transitions. Word has length 120 [2022-01-10 12:37:48,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:37:48,431 INFO L470 AbstractCegarLoop]: Abstraction has 3353 states and 4391 transitions. [2022-01-10 12:37:48,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:48,431 INFO L276 IsEmpty]: Start isEmpty. Operand 3353 states and 4391 transitions. [2022-01-10 12:37:48,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-01-10 12:37:48,432 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:37:48,432 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:37:48,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 12:37:48,432 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:37:48,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:37:48,433 INFO L85 PathProgramCache]: Analyzing trace with hash 2104740301, now seen corresponding path program 1 times [2022-01-10 12:37:48,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:37:48,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792011657] [2022-01-10 12:37:48,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:37:48,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:37:48,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:37:48,475 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 12:37:48,475 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:37:48,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792011657] [2022-01-10 12:37:48,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792011657] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:37:48,475 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:37:48,475 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 12:37:48,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539999670] [2022-01-10 12:37:48,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:37:48,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 12:37:48,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:37:48,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 12:37:48,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 12:37:48,477 INFO L87 Difference]: Start difference. First operand 3353 states and 4391 transitions. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:48,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:37:48,936 INFO L93 Difference]: Finished difference Result 9188 states and 12105 transitions. [2022-01-10 12:37:48,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 12:37:48,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2022-01-10 12:37:48,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:37:48,945 INFO L225 Difference]: With dead ends: 9188 [2022-01-10 12:37:48,945 INFO L226 Difference]: Without dead ends: 5915 [2022-01-10 12:37:48,950 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 12:37:48,951 INFO L933 BasicCegarLoop]: 1301 mSDtfsCounter, 2924 mSDsluCounter, 2969 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2924 SdHoareTripleChecker+Valid, 4270 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 12:37:48,951 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2924 Valid, 4270 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 12:37:48,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5915 states. [2022-01-10 12:37:49,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5915 to 3365. [2022-01-10 12:37:49,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3365 states, 3364 states have (on average 1.297859690844233) internal successors, (4366), 3364 states have internal predecessors, (4366), 0 states have call successors, (0), 0 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 12:37:49,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3365 states to 3365 states and 4366 transitions. [2022-01-10 12:37:49,130 INFO L78 Accepts]: Start accepts. Automaton has 3365 states and 4366 transitions. Word has length 120 [2022-01-10 12:37:49,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:37:49,130 INFO L470 AbstractCegarLoop]: Abstraction has 3365 states and 4366 transitions. [2022-01-10 12:37:49,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:49,130 INFO L276 IsEmpty]: Start isEmpty. Operand 3365 states and 4366 transitions. [2022-01-10 12:37:49,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-01-10 12:37:49,131 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:37:49,131 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:37:49,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 12:37:49,131 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:37:49,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:37:49,132 INFO L85 PathProgramCache]: Analyzing trace with hash -219287538, now seen corresponding path program 1 times [2022-01-10 12:37:49,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:37:49,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248655643] [2022-01-10 12:37:49,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:37:49,132 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:37:49,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:37:49,166 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 12:37:49,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:37:49,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248655643] [2022-01-10 12:37:49,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248655643] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:37:49,166 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:37:49,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 12:37:49,167 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007016810] [2022-01-10 12:37:49,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:37:49,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:37:49,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:37:49,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:37:49,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:37:49,167 INFO L87 Difference]: Start difference. First operand 3365 states and 4366 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:49,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:37:49,361 INFO L93 Difference]: Finished difference Result 6710 states and 8702 transitions. [2022-01-10 12:37:49,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:37:49,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2022-01-10 12:37:49,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:37:49,371 INFO L225 Difference]: With dead ends: 6710 [2022-01-10 12:37:49,371 INFO L226 Difference]: Without dead ends: 3365 [2022-01-10 12:37:49,378 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:37:49,380 INFO L933 BasicCegarLoop]: 1284 mSDtfsCounter, 1197 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1197 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:37:49,380 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1197 Valid, 1284 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:37:49,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3365 states. [2022-01-10 12:37:49,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3365 to 3365. [2022-01-10 12:37:49,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3365 states, 3364 states have (on average 1.2936979785969085) internal successors, (4352), 3364 states have internal predecessors, (4352), 0 states have call successors, (0), 0 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 12:37:49,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3365 states to 3365 states and 4352 transitions. [2022-01-10 12:37:49,549 INFO L78 Accepts]: Start accepts. Automaton has 3365 states and 4352 transitions. Word has length 120 [2022-01-10 12:37:49,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:37:49,549 INFO L470 AbstractCegarLoop]: Abstraction has 3365 states and 4352 transitions. [2022-01-10 12:37:49,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:49,549 INFO L276 IsEmpty]: Start isEmpty. Operand 3365 states and 4352 transitions. [2022-01-10 12:37:49,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-01-10 12:37:49,550 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:37:49,550 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:37:49,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 12:37:49,550 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:37:49,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:37:49,551 INFO L85 PathProgramCache]: Analyzing trace with hash -474024083, now seen corresponding path program 1 times [2022-01-10 12:37:49,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:37:49,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604239496] [2022-01-10 12:37:49,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:37:49,551 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:37:49,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:37:49,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 12:37:49,582 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:37:49,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604239496] [2022-01-10 12:37:49,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604239496] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:37:49,582 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:37:49,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 12:37:49,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199011807] [2022-01-10 12:37:49,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:37:49,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:37:49,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:37:49,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:37:49,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:37:49,583 INFO L87 Difference]: Start difference. First operand 3365 states and 4352 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:49,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:37:49,789 INFO L93 Difference]: Finished difference Result 6702 states and 8666 transitions. [2022-01-10 12:37:49,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:37:49,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2022-01-10 12:37:49,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:37:49,795 INFO L225 Difference]: With dead ends: 6702 [2022-01-10 12:37:49,795 INFO L226 Difference]: Without dead ends: 3365 [2022-01-10 12:37:49,798 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:37:49,799 INFO L933 BasicCegarLoop]: 1259 mSDtfsCounter, 1092 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1092 SdHoareTripleChecker+Valid, 1337 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:37:49,799 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1092 Valid, 1337 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:37:49,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3365 states. [2022-01-10 12:37:49,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3365 to 3365. [2022-01-10 12:37:49,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3365 states, 3364 states have (on average 1.2838882282996433) internal successors, (4319), 3364 states have internal predecessors, (4319), 0 states have call successors, (0), 0 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 12:37:49,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3365 states to 3365 states and 4319 transitions. [2022-01-10 12:37:49,949 INFO L78 Accepts]: Start accepts. Automaton has 3365 states and 4319 transitions. Word has length 120 [2022-01-10 12:37:49,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:37:49,949 INFO L470 AbstractCegarLoop]: Abstraction has 3365 states and 4319 transitions. [2022-01-10 12:37:49,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:49,949 INFO L276 IsEmpty]: Start isEmpty. Operand 3365 states and 4319 transitions. [2022-01-10 12:37:49,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-01-10 12:37:49,950 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:37:49,950 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:37:49,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-10 12:37:49,950 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:37:49,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:37:49,951 INFO L85 PathProgramCache]: Analyzing trace with hash -882848308, now seen corresponding path program 1 times [2022-01-10 12:37:49,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:37:49,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159487807] [2022-01-10 12:37:49,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:37:49,951 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:37:49,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:37:49,991 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 12:37:49,991 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:37:49,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159487807] [2022-01-10 12:37:49,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159487807] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:37:49,991 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:37:49,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 12:37:49,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602556219] [2022-01-10 12:37:49,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:37:49,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:37:49,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:37:49,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:37:49,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:37:49,992 INFO L87 Difference]: Start difference. First operand 3365 states and 4319 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:50,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:37:50,384 INFO L93 Difference]: Finished difference Result 9892 states and 12709 transitions. [2022-01-10 12:37:50,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:37:50,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2022-01-10 12:37:50,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:37:50,394 INFO L225 Difference]: With dead ends: 9892 [2022-01-10 12:37:50,395 INFO L226 Difference]: Without dead ends: 6561 [2022-01-10 12:37:50,400 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:37:50,401 INFO L933 BasicCegarLoop]: 1259 mSDtfsCounter, 1125 mSDsluCounter, 1109 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1125 SdHoareTripleChecker+Valid, 2368 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 12:37:50,401 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1125 Valid, 2368 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 12:37:50,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6561 states. [2022-01-10 12:37:50,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6561 to 6303. [2022-01-10 12:37:50,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6303 states, 6302 states have (on average 1.279752459536655) internal successors, (8065), 6302 states have internal predecessors, (8065), 0 states have call successors, (0), 0 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 12:37:50,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6303 states to 6303 states and 8065 transitions. [2022-01-10 12:37:50,794 INFO L78 Accepts]: Start accepts. Automaton has 6303 states and 8065 transitions. Word has length 120 [2022-01-10 12:37:50,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:37:50,794 INFO L470 AbstractCegarLoop]: Abstraction has 6303 states and 8065 transitions. [2022-01-10 12:37:50,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:50,795 INFO L276 IsEmpty]: Start isEmpty. Operand 6303 states and 8065 transitions. [2022-01-10 12:37:50,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-01-10 12:37:50,798 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:37:50,798 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:37:50,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-10 12:37:50,798 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:37:50,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:37:50,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1906936990, now seen corresponding path program 1 times [2022-01-10 12:37:50,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:37:50,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139521545] [2022-01-10 12:37:50,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:37:50,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:37:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:37:50,863 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 12:37:50,864 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:37:50,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139521545] [2022-01-10 12:37:50,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139521545] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:37:50,864 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:37:50,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:37:50,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610881342] [2022-01-10 12:37:50,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:37:50,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:37:50,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:37:50,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:37:50,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:37:50,866 INFO L87 Difference]: Start difference. First operand 6303 states and 8065 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 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 12:37:51,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:37:51,540 INFO L93 Difference]: Finished difference Result 18591 states and 23815 transitions. [2022-01-10 12:37:51,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:37:51,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 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 195 [2022-01-10 12:37:51,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:37:51,560 INFO L225 Difference]: With dead ends: 18591 [2022-01-10 12:37:51,560 INFO L226 Difference]: Without dead ends: 12328 [2022-01-10 12:37:51,569 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:37:51,569 INFO L933 BasicCegarLoop]: 1256 mSDtfsCounter, 1145 mSDsluCounter, 1109 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1145 SdHoareTripleChecker+Valid, 2365 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:37:51,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1145 Valid, 2365 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:37:51,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12328 states. [2022-01-10 12:37:52,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12328 to 11874. [2022-01-10 12:37:52,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11874 states, 11873 states have (on average 1.2770993009348943) internal successors, (15163), 11873 states have internal predecessors, (15163), 0 states have call successors, (0), 0 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 12:37:52,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11874 states to 11874 states and 15163 transitions. [2022-01-10 12:37:52,171 INFO L78 Accepts]: Start accepts. Automaton has 11874 states and 15163 transitions. Word has length 195 [2022-01-10 12:37:52,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:37:52,171 INFO L470 AbstractCegarLoop]: Abstraction has 11874 states and 15163 transitions. [2022-01-10 12:37:52,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 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 12:37:52,172 INFO L276 IsEmpty]: Start isEmpty. Operand 11874 states and 15163 transitions. [2022-01-10 12:37:52,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-01-10 12:37:52,177 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:37:52,177 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:37:52,177 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-10 12:37:52,177 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:37:52,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:37:52,178 INFO L85 PathProgramCache]: Analyzing trace with hash 336165666, now seen corresponding path program 1 times [2022-01-10 12:37:52,178 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:37:52,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080282889] [2022-01-10 12:37:52,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:37:52,178 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:37:52,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:37:52,224 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 12:37:52,224 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:37:52,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080282889] [2022-01-10 12:37:52,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080282889] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:37:52,225 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:37:52,225 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:37:52,225 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663574156] [2022-01-10 12:37:52,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:37:52,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:37:52,225 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:37:52,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:37:52,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:37:52,226 INFO L87 Difference]: Start difference. First operand 11874 states and 15163 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 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 12:37:53,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:37:53,400 INFO L93 Difference]: Finished difference Result 34584 states and 43923 transitions. [2022-01-10 12:37:53,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:37:53,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 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 195 [2022-01-10 12:37:53,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:37:53,440 INFO L225 Difference]: With dead ends: 34584 [2022-01-10 12:37:53,440 INFO L226 Difference]: Without dead ends: 22822 [2022-01-10 12:37:53,454 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:37:53,455 INFO L933 BasicCegarLoop]: 1944 mSDtfsCounter, 961 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 961 SdHoareTripleChecker+Valid, 3194 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:37:53,455 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [961 Valid, 3194 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:37:53,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22822 states. [2022-01-10 12:37:54,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22822 to 22820. [2022-01-10 12:37:54,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22820 states, 22819 states have (on average 1.2633770103860817) internal successors, (28829), 22819 states have internal predecessors, (28829), 0 states have call successors, (0), 0 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 12:37:54,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22820 states to 22820 states and 28829 transitions. [2022-01-10 12:37:54,780 INFO L78 Accepts]: Start accepts. Automaton has 22820 states and 28829 transitions. Word has length 195 [2022-01-10 12:37:54,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:37:54,782 INFO L470 AbstractCegarLoop]: Abstraction has 22820 states and 28829 transitions. [2022-01-10 12:37:54,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 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 12:37:54,783 INFO L276 IsEmpty]: Start isEmpty. Operand 22820 states and 28829 transitions. [2022-01-10 12:37:54,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-01-10 12:37:54,792 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:37:54,792 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:37:54,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-10 12:37:54,792 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:37:54,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:37:54,793 INFO L85 PathProgramCache]: Analyzing trace with hash 99547841, now seen corresponding path program 1 times [2022-01-10 12:37:54,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:37:54,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090016147] [2022-01-10 12:37:54,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:37:54,794 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:37:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:37:54,820 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 12:37:54,820 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:37:54,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090016147] [2022-01-10 12:37:54,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090016147] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:37:54,820 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:37:54,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:37:54,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661143502] [2022-01-10 12:37:54,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:37:54,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:37:54,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:37:54,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:37:54,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:37:54,821 INFO L87 Difference]: Start difference. First operand 22820 states and 28829 transitions. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 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 12:37:55,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:37:55,887 INFO L93 Difference]: Finished difference Result 45422 states and 57398 transitions. [2022-01-10 12:37:55,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:37:55,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 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 195 [2022-01-10 12:37:55,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:37:55,928 INFO L225 Difference]: With dead ends: 45422 [2022-01-10 12:37:55,928 INFO L226 Difference]: Without dead ends: 22714 [2022-01-10 12:37:55,953 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:37:55,953 INFO L933 BasicCegarLoop]: 1268 mSDtfsCounter, 1264 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1264 SdHoareTripleChecker+Valid, 1268 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:37:55,954 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1264 Valid, 1268 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:37:55,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22714 states. [2022-01-10 12:37:57,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22714 to 22714. [2022-01-10 12:37:57,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22714 states, 22713 states have (on average 1.263681592039801) internal successors, (28702), 22713 states have internal predecessors, (28702), 0 states have call successors, (0), 0 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 12:37:57,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22714 states to 22714 states and 28702 transitions. [2022-01-10 12:37:57,150 INFO L78 Accepts]: Start accepts. Automaton has 22714 states and 28702 transitions. Word has length 195 [2022-01-10 12:37:57,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:37:57,150 INFO L470 AbstractCegarLoop]: Abstraction has 22714 states and 28702 transitions. [2022-01-10 12:37:57,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 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 12:37:57,150 INFO L276 IsEmpty]: Start isEmpty. Operand 22714 states and 28702 transitions. [2022-01-10 12:37:57,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-01-10 12:37:57,176 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:37:57,176 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:37:57,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-10 12:37:57,176 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:37:57,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:37:57,176 INFO L85 PathProgramCache]: Analyzing trace with hash -383675826, now seen corresponding path program 1 times [2022-01-10 12:37:57,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:37:57,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29329887] [2022-01-10 12:37:57,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:37:57,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:37:57,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:37:57,236 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 12:37:57,237 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:37:57,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29329887] [2022-01-10 12:37:57,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29329887] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:37:57,237 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:37:57,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:37:57,237 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677420025] [2022-01-10 12:37:57,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:37:57,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:37:57,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:37:57,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:37:57,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:37:57,238 INFO L87 Difference]: Start difference. First operand 22714 states and 28702 transitions. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 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 12:37:59,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:37:59,604 INFO L93 Difference]: Finished difference Result 66967 states and 84396 transitions. [2022-01-10 12:37:59,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:37:59,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 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 196 [2022-01-10 12:37:59,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:37:59,662 INFO L225 Difference]: With dead ends: 66967 [2022-01-10 12:37:59,662 INFO L226 Difference]: Without dead ends: 44365 [2022-01-10 12:37:59,686 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:37:59,688 INFO L933 BasicCegarLoop]: 1593 mSDtfsCounter, 1140 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1140 SdHoareTripleChecker+Valid, 2830 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:37:59,689 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1140 Valid, 2830 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:37:59,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44365 states. [2022-01-10 12:38:01,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44365 to 42907. [2022-01-10 12:38:01,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42907 states, 42906 states have (on average 1.2567473080688016) internal successors, (53922), 42906 states have internal predecessors, (53922), 0 states have call successors, (0), 0 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 12:38:01,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42907 states to 42907 states and 53922 transitions. [2022-01-10 12:38:01,849 INFO L78 Accepts]: Start accepts. Automaton has 42907 states and 53922 transitions. Word has length 196 [2022-01-10 12:38:01,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:38:01,850 INFO L470 AbstractCegarLoop]: Abstraction has 42907 states and 53922 transitions. [2022-01-10 12:38:01,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 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 12:38:01,850 INFO L276 IsEmpty]: Start isEmpty. Operand 42907 states and 53922 transitions. [2022-01-10 12:38:01,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-01-10 12:38:01,864 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:38:01,865 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:38:01,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-10 12:38:01,865 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:38:01,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:38:01,865 INFO L85 PathProgramCache]: Analyzing trace with hash -821427153, now seen corresponding path program 1 times [2022-01-10 12:38:01,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:38:01,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838748077] [2022-01-10 12:38:01,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:38:01,866 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:38:01,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:38:01,895 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 12:38:01,895 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:38:01,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838748077] [2022-01-10 12:38:01,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838748077] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:38:01,895 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:38:01,896 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:38:01,896 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137956854] [2022-01-10 12:38:01,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:38:01,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:38:01,896 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:38:01,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:38:01,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:38:01,897 INFO L87 Difference]: Start difference. First operand 42907 states and 53922 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 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 12:38:04,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:38:04,533 INFO L93 Difference]: Finished difference Result 85658 states and 107658 transitions. [2022-01-10 12:38:04,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:38:04,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 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 196 [2022-01-10 12:38:04,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:38:04,586 INFO L225 Difference]: With dead ends: 85658 [2022-01-10 12:38:04,586 INFO L226 Difference]: Without dead ends: 42802 [2022-01-10 12:38:04,619 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:38:04,619 INFO L933 BasicCegarLoop]: 1267 mSDtfsCounter, 1262 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1262 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:38:04,619 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1262 Valid, 1267 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:38:04,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42802 states. [2022-01-10 12:38:06,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42802 to 42802. [2022-01-10 12:38:06,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42802 states, 42801 states have (on average 1.256909885283054) internal successors, (53797), 42801 states have internal predecessors, (53797), 0 states have call successors, (0), 0 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 12:38:07,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42802 states to 42802 states and 53797 transitions. [2022-01-10 12:38:07,050 INFO L78 Accepts]: Start accepts. Automaton has 42802 states and 53797 transitions. Word has length 196 [2022-01-10 12:38:07,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:38:07,050 INFO L470 AbstractCegarLoop]: Abstraction has 42802 states and 53797 transitions. [2022-01-10 12:38:07,051 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 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 12:38:07,051 INFO L276 IsEmpty]: Start isEmpty. Operand 42802 states and 53797 transitions. [2022-01-10 12:38:07,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-01-10 12:38:07,064 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:38:07,064 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:38:07,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-10 12:38:07,064 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:38:07,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:38:07,065 INFO L85 PathProgramCache]: Analyzing trace with hash 485368655, now seen corresponding path program 1 times [2022-01-10 12:38:07,065 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:38:07,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91158138] [2022-01-10 12:38:07,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:38:07,065 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:38:07,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:38:07,106 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 12:38:07,106 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:38:07,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91158138] [2022-01-10 12:38:07,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91158138] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:38:07,106 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:38:07,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:38:07,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556574013] [2022-01-10 12:38:07,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:38:07,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:38:07,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:38:07,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:38:07,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:38:07,107 INFO L87 Difference]: Start difference. First operand 42802 states and 53797 transitions. Second operand has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 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 12:38:11,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:38:11,456 INFO L93 Difference]: Finished difference Result 126062 states and 158209 transitions. [2022-01-10 12:38:11,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:38:11,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 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 197 [2022-01-10 12:38:11,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:38:11,584 INFO L225 Difference]: With dead ends: 126062 [2022-01-10 12:38:11,584 INFO L226 Difference]: Without dead ends: 83372 [2022-01-10 12:38:11,629 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:38:11,630 INFO L933 BasicCegarLoop]: 1556 mSDtfsCounter, 1140 mSDsluCounter, 1235 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1140 SdHoareTripleChecker+Valid, 2791 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:38:11,630 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1140 Valid, 2791 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:38:11,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83372 states. [2022-01-10 12:38:16,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83372 to 80906. [2022-01-10 12:38:16,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80906 states, 80905 states have (on average 1.2532105555898894) internal successors, (101391), 80905 states have internal predecessors, (101391), 0 states have call successors, (0), 0 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 12:38:16,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80906 states to 80906 states and 101391 transitions. [2022-01-10 12:38:16,357 INFO L78 Accepts]: Start accepts. Automaton has 80906 states and 101391 transitions. Word has length 197 [2022-01-10 12:38:16,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:38:16,357 INFO L470 AbstractCegarLoop]: Abstraction has 80906 states and 101391 transitions. [2022-01-10 12:38:16,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 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 12:38:16,358 INFO L276 IsEmpty]: Start isEmpty. Operand 80906 states and 101391 transitions. [2022-01-10 12:38:16,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-01-10 12:38:16,384 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:38:16,385 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:38:16,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-10 12:38:16,386 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:38:16,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:38:16,395 INFO L85 PathProgramCache]: Analyzing trace with hash 269088205, now seen corresponding path program 1 times [2022-01-10 12:38:16,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:38:16,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362997306] [2022-01-10 12:38:16,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:38:16,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:38:16,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:38:16,436 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 12:38:16,436 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:38:16,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362997306] [2022-01-10 12:38:16,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362997306] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:38:16,437 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:38:16,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:38:16,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121209445] [2022-01-10 12:38:16,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:38:16,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:38:16,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:38:16,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:38:16,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:38:16,438 INFO L87 Difference]: Start difference. First operand 80906 states and 101391 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 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 12:38:21,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:38:21,335 INFO L93 Difference]: Finished difference Result 161650 states and 202590 transitions. [2022-01-10 12:38:21,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:38:21,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 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 197 [2022-01-10 12:38:21,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:38:21,454 INFO L225 Difference]: With dead ends: 161650 [2022-01-10 12:38:21,454 INFO L226 Difference]: Without dead ends: 80802 [2022-01-10 12:38:21,520 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:38:21,521 INFO L933 BasicCegarLoop]: 1266 mSDtfsCounter, 1260 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1260 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:38:21,521 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1260 Valid, 1266 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:38:21,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80802 states. [2022-01-10 12:38:26,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80802 to 80802. [2022-01-10 12:38:26,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80802 states, 80801 states have (on average 1.2533013205282113) internal successors, (101268), 80801 states have internal predecessors, (101268), 0 states have call successors, (0), 0 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 12:38:26,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80802 states to 80802 states and 101268 transitions. [2022-01-10 12:38:26,541 INFO L78 Accepts]: Start accepts. Automaton has 80802 states and 101268 transitions. Word has length 197 [2022-01-10 12:38:26,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:38:26,541 INFO L470 AbstractCegarLoop]: Abstraction has 80802 states and 101268 transitions. [2022-01-10 12:38:26,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 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 12:38:26,542 INFO L276 IsEmpty]: Start isEmpty. Operand 80802 states and 101268 transitions. [2022-01-10 12:38:26,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-01-10 12:38:26,569 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:38:26,569 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:38:26,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-10 12:38:26,569 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:38:26,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:38:26,570 INFO L85 PathProgramCache]: Analyzing trace with hash 632286877, now seen corresponding path program 1 times [2022-01-10 12:38:26,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:38:26,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568412451] [2022-01-10 12:38:26,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:38:26,570 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:38:26,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:38:26,650 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 12:38:26,651 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:38:26,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568412451] [2022-01-10 12:38:26,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568412451] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:38:26,651 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:38:26,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:38:26,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108800849] [2022-01-10 12:38:26,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:38:26,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:38:26,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:38:26,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:38:26,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:38:26,652 INFO L87 Difference]: Start difference. First operand 80802 states and 101268 transitions. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 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 12:38:35,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:38:35,464 INFO L93 Difference]: Finished difference Result 239533 states and 299950 transitions. [2022-01-10 12:38:35,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:38:35,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 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 198 [2022-01-10 12:38:35,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:38:35,738 INFO L225 Difference]: With dead ends: 239533 [2022-01-10 12:38:35,738 INFO L226 Difference]: Without dead ends: 158843 [2022-01-10 12:38:36,008 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:38:36,008 INFO L933 BasicCegarLoop]: 1604 mSDtfsCounter, 1140 mSDsluCounter, 1233 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1140 SdHoareTripleChecker+Valid, 2837 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:38:36,008 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1140 Valid, 2837 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:38:36,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158843 states. [2022-01-10 12:38:45,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158843 to 156793. [2022-01-10 12:38:45,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156793 states, 156792 states have (on average 1.2505484973723149) internal successors, (196076), 156792 states have internal predecessors, (196076), 0 states have call successors, (0), 0 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 12:38:45,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156793 states to 156793 states and 196076 transitions. [2022-01-10 12:38:45,865 INFO L78 Accepts]: Start accepts. Automaton has 156793 states and 196076 transitions. Word has length 198 [2022-01-10 12:38:45,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:38:45,865 INFO L470 AbstractCegarLoop]: Abstraction has 156793 states and 196076 transitions. [2022-01-10 12:38:45,865 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 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 12:38:45,865 INFO L276 IsEmpty]: Start isEmpty. Operand 156793 states and 196076 transitions. [2022-01-10 12:38:45,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-01-10 12:38:45,936 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:38:45,937 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:38:45,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-10 12:38:45,937 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:38:45,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:38:45,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1563683582, now seen corresponding path program 1 times [2022-01-10 12:38:45,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:38:45,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394588110] [2022-01-10 12:38:45,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:38:45,938 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:38:45,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:38:45,994 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 12:38:45,995 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:38:45,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394588110] [2022-01-10 12:38:45,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394588110] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:38:45,995 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:38:45,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:38:45,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116953008] [2022-01-10 12:38:45,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:38:45,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:38:45,996 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:38:45,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:38:45,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:38:45,997 INFO L87 Difference]: Start difference. First operand 156793 states and 196076 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)