/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/locks/test_locks_15-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 10:03:05,934 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 10:03:05,935 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 10:03:05,955 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 10:03:05,955 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 10:03:05,956 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 10:03:05,957 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 10:03:05,958 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 10:03:05,959 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 10:03:05,960 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 10:03:05,960 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 10:03:05,961 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 10:03:05,961 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 10:03:05,962 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 10:03:05,962 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 10:03:05,963 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 10:03:05,964 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 10:03:05,964 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 10:03:05,966 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 10:03:05,967 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 10:03:05,968 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 10:03:05,968 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 10:03:05,969 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 10:03:05,969 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 10:03:05,971 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 10:03:05,971 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 10:03:05,971 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 10:03:05,972 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 10:03:05,972 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 10:03:05,973 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 10:03:05,973 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 10:03:05,973 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 10:03:05,974 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 10:03:05,974 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 10:03:05,975 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 10:03:05,975 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 10:03:05,975 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 10:03:05,975 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 10:03:05,975 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 10:03:05,976 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 10:03:05,976 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 10:03:05,977 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 10:03:05,990 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 10:03:05,991 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 10:03:05,991 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 10:03:05,991 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 10:03:05,992 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 10:03:05,992 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 10:03:05,992 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 10:03:05,992 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 10:03:05,992 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 10:03:05,992 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 10:03:05,992 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 10:03:05,992 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 10:03:05,992 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 10:03:05,993 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 10:03:05,993 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 10:03:05,993 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 10:03:05,993 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 10:03:05,993 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 10:03:05,993 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 10:03:05,993 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 10:03:05,993 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 10:03:05,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 10:03:05,994 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 10:03:05,994 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 10:03:05,994 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 10:03:05,994 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 10:03:05,994 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 10:03:05,994 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 10:03:05,994 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 10:03:05,994 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 10:03:05,994 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 10:03:05,994 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 10:03:05,995 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 10:03:05,995 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 10:03:06,153 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 10:03:06,177 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 10:03:06,179 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 10:03:06,179 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 10:03:06,180 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 10:03:06,181 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_15-2.c [2022-01-10 10:03:06,231 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6984b2988/afcd69e43c1743ce96d4f7c40bfdf2f0/FLAG6ac289be6 [2022-01-10 10:03:06,584 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 10:03:06,585 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_15-2.c [2022-01-10 10:03:06,593 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6984b2988/afcd69e43c1743ce96d4f7c40bfdf2f0/FLAG6ac289be6 [2022-01-10 10:03:06,612 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6984b2988/afcd69e43c1743ce96d4f7c40bfdf2f0 [2022-01-10 10:03:06,613 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 10:03:06,614 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 10:03:06,618 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 10:03:06,618 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 10:03:06,621 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 10:03:06,621 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 10:03:06" (1/1) ... [2022-01-10 10:03:06,622 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63a4d603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:03:06, skipping insertion in model container [2022-01-10 10:03:06,622 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 10:03:06" (1/1) ... [2022-01-10 10:03:06,626 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 10:03:06,652 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 10:03:06,794 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_15-2.c[5628,5641] [2022-01-10 10:03:06,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 10:03:06,806 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 10:03:06,829 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_15-2.c[5628,5641] [2022-01-10 10:03:06,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 10:03:06,839 INFO L208 MainTranslator]: Completed translation [2022-01-10 10:03:06,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:03:06 WrapperNode [2022-01-10 10:03:06,840 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 10:03:06,841 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 10:03:06,841 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 10:03:06,841 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 10:03:06,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:03:06" (1/1) ... [2022-01-10 10:03:06,850 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:03:06" (1/1) ... [2022-01-10 10:03:06,871 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 177 [2022-01-10 10:03:06,872 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 10:03:06,872 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 10:03:06,872 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 10:03:06,872 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 10:03:06,877 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:03:06" (1/1) ... [2022-01-10 10:03:06,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:03:06" (1/1) ... [2022-01-10 10:03:06,879 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:03:06" (1/1) ... [2022-01-10 10:03:06,879 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:03:06" (1/1) ... [2022-01-10 10:03:06,882 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:03:06" (1/1) ... [2022-01-10 10:03:06,885 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:03:06" (1/1) ... [2022-01-10 10:03:06,886 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:03:06" (1/1) ... [2022-01-10 10:03:06,888 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 10:03:06,891 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 10:03:06,891 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 10:03:06,892 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 10:03:06,892 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:03:06" (1/1) ... [2022-01-10 10:03:06,896 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 10:03:06,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 10:03:06,915 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 10:03:06,923 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 10:03:06,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 10:03:06,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 10:03:06,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 10:03:06,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 10:03:06,993 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 10:03:06,994 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 10:03:07,142 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 10:03:07,146 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 10:03:07,146 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 10:03:07,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 10:03:07 BoogieIcfgContainer [2022-01-10 10:03:07,148 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 10:03:07,149 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 10:03:07,149 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 10:03:07,150 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 10:03:07,152 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 10:03:07" (1/1) ... [2022-01-10 10:03:07,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 10:03:07 BasicIcfg [2022-01-10 10:03:07,268 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 10:03:07,270 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 10:03:07,270 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 10:03:07,272 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 10:03:07,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 10:03:06" (1/4) ... [2022-01-10 10:03:07,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b75b7e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 10:03:07, skipping insertion in model container [2022-01-10 10:03:07,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:03:06" (2/4) ... [2022-01-10 10:03:07,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b75b7e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 10:03:07, skipping insertion in model container [2022-01-10 10:03:07,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 10:03:07" (3/4) ... [2022-01-10 10:03:07,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b75b7e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 10:03:07, skipping insertion in model container [2022-01-10 10:03:07,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 10:03:07" (4/4) ... [2022-01-10 10:03:07,274 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_15-2.cTransformedIcfg [2022-01-10 10:03:07,277 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 10:03:07,278 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 10:03:07,307 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 10:03:07,313 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 10:03:07,313 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 10:03:07,322 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 53 states have (on average 1.9245283018867925) internal successors, (102), 54 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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 10:03:07,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 10:03:07,325 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:07,326 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] [2022-01-10 10:03:07,326 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:07,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:07,330 INFO L85 PathProgramCache]: Analyzing trace with hash 568750458, now seen corresponding path program 1 times [2022-01-10 10:03:07,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:07,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447808691] [2022-01-10 10:03:07,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:07,336 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:07,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:07,498 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 10:03:07,499 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:07,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447808691] [2022-01-10 10:03:07,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447808691] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:07,500 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:07,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:07,501 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136351292] [2022-01-10 10:03:07,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:07,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:07,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:07,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:07,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:07,533 INFO L87 Difference]: Start difference. First operand has 55 states, 53 states have (on average 1.9245283018867925) internal successors, (102), 54 states have internal predecessors, (102), 0 states have call successors, (0), 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 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states 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 10:03:07,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:07,588 INFO L93 Difference]: Finished difference Result 113 states and 205 transitions. [2022-01-10 10:03:07,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:07,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-01-10 10:03:07,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:07,599 INFO L225 Difference]: With dead ends: 113 [2022-01-10 10:03:07,599 INFO L226 Difference]: Without dead ends: 99 [2022-01-10 10:03:07,601 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 10:03:07,604 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 77 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:07,605 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 199 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:07,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-01-10 10:03:07,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 67. [2022-01-10 10:03:07,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.9090909090909092) internal successors, (126), 66 states have internal predecessors, (126), 0 states have call successors, (0), 0 states 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 10:03:07,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 126 transitions. [2022-01-10 10:03:07,641 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 126 transitions. Word has length 22 [2022-01-10 10:03:07,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:07,641 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 126 transitions. [2022-01-10 10:03:07,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states 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 10:03:07,642 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 126 transitions. [2022-01-10 10:03:07,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 10:03:07,643 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:07,643 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] [2022-01-10 10:03:07,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 10:03:07,643 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:07,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:07,645 INFO L85 PathProgramCache]: Analyzing trace with hash -428321895, now seen corresponding path program 1 times [2022-01-10 10:03:07,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:07,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845975841] [2022-01-10 10:03:07,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:07,646 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:07,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:07,762 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 10:03:07,763 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:07,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845975841] [2022-01-10 10:03:07,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845975841] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:07,763 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:07,763 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:07,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756118844] [2022-01-10 10:03:07,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:07,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:07,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:07,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:07,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:07,765 INFO L87 Difference]: Start difference. First operand 67 states and 126 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states 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 10:03:07,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:07,788 INFO L93 Difference]: Finished difference Result 164 states and 309 transitions. [2022-01-10 10:03:07,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:07,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-01-10 10:03:07,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:07,792 INFO L225 Difference]: With dead ends: 164 [2022-01-10 10:03:07,792 INFO L226 Difference]: Without dead ends: 99 [2022-01-10 10:03:07,795 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 10:03:07,796 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 73 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:07,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 213 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:07,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-01-10 10:03:07,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2022-01-10 10:03:07,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.8958333333333333) internal successors, (182), 96 states have internal predecessors, (182), 0 states have call successors, (0), 0 states 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 10:03:07,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 182 transitions. [2022-01-10 10:03:07,803 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 182 transitions. Word has length 22 [2022-01-10 10:03:07,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:07,804 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 182 transitions. [2022-01-10 10:03:07,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states 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 10:03:07,804 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 182 transitions. [2022-01-10 10:03:07,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 10:03:07,804 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:07,804 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:03:07,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 10:03:07,807 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:07,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:07,811 INFO L85 PathProgramCache]: Analyzing trace with hash 451427117, now seen corresponding path program 1 times [2022-01-10 10:03:07,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:07,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517140463] [2022-01-10 10:03:07,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:07,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:07,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:07,893 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 10:03:07,894 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:07,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517140463] [2022-01-10 10:03:07,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517140463] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:07,895 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:07,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:07,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011476269] [2022-01-10 10:03:07,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:07,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:07,896 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:07,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:07,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:07,897 INFO L87 Difference]: Start difference. First operand 97 states and 182 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:07,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:07,921 INFO L93 Difference]: Finished difference Result 150 states and 276 transitions. [2022-01-10 10:03:07,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:07,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-01-10 10:03:07,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:07,923 INFO L225 Difference]: With dead ends: 150 [2022-01-10 10:03:07,923 INFO L226 Difference]: Without dead ends: 102 [2022-01-10 10:03:07,925 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 10:03:07,928 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 75 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:07,928 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 240 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:07,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-01-10 10:03:07,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2022-01-10 10:03:07,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.8585858585858586) internal successors, (184), 99 states have internal predecessors, (184), 0 states have call successors, (0), 0 states 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 10:03:07,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 184 transitions. [2022-01-10 10:03:07,934 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 184 transitions. Word has length 23 [2022-01-10 10:03:07,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:07,935 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 184 transitions. [2022-01-10 10:03:07,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:07,935 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 184 transitions. [2022-01-10 10:03:07,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 10:03:07,935 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:07,935 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:03:07,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 10:03:07,936 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:07,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:07,936 INFO L85 PathProgramCache]: Analyzing trace with hash -393044754, now seen corresponding path program 1 times [2022-01-10 10:03:07,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:07,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100968396] [2022-01-10 10:03:07,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:07,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:07,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:08,012 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 10:03:08,013 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:08,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100968396] [2022-01-10 10:03:08,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100968396] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:08,013 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:08,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:08,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705744822] [2022-01-10 10:03:08,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:08,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:08,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:08,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:08,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:08,015 INFO L87 Difference]: Start difference. First operand 100 states and 184 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:08,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:08,034 INFO L93 Difference]: Finished difference Result 193 states and 357 transitions. [2022-01-10 10:03:08,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:08,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-01-10 10:03:08,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:08,037 INFO L225 Difference]: With dead ends: 193 [2022-01-10 10:03:08,037 INFO L226 Difference]: Without dead ends: 191 [2022-01-10 10:03:08,037 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 10:03:08,042 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 70 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:08,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 185 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:08,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-01-10 10:03:08,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 133. [2022-01-10 10:03:08,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.856060606060606) internal successors, (245), 132 states have internal predecessors, (245), 0 states have call successors, (0), 0 states 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 10:03:08,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 245 transitions. [2022-01-10 10:03:08,060 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 245 transitions. Word has length 23 [2022-01-10 10:03:08,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:08,060 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 245 transitions. [2022-01-10 10:03:08,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:08,060 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 245 transitions. [2022-01-10 10:03:08,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 10:03:08,061 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:08,061 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:03:08,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 10:03:08,061 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:08,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:08,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1390117107, now seen corresponding path program 1 times [2022-01-10 10:03:08,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:08,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43602699] [2022-01-10 10:03:08,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:08,062 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:08,111 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 10:03:08,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:08,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43602699] [2022-01-10 10:03:08,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43602699] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:08,113 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:08,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:08,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012356462] [2022-01-10 10:03:08,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:08,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:08,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:08,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:08,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:08,114 INFO L87 Difference]: Start difference. First operand 133 states and 245 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:08,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:08,128 INFO L93 Difference]: Finished difference Result 321 states and 595 transitions. [2022-01-10 10:03:08,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:08,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-01-10 10:03:08,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:08,129 INFO L225 Difference]: With dead ends: 321 [2022-01-10 10:03:08,129 INFO L226 Difference]: Without dead ends: 193 [2022-01-10 10:03:08,132 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 10:03:08,132 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 72 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:08,132 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 214 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:08,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-01-10 10:03:08,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 191. [2022-01-10 10:03:08,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 190 states have (on average 1.8473684210526315) internal successors, (351), 190 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:08,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 351 transitions. [2022-01-10 10:03:08,151 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 351 transitions. Word has length 23 [2022-01-10 10:03:08,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:08,152 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 351 transitions. [2022-01-10 10:03:08,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:08,154 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 351 transitions. [2022-01-10 10:03:08,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 10:03:08,155 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:08,156 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] [2022-01-10 10:03:08,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 10:03:08,156 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:08,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:08,157 INFO L85 PathProgramCache]: Analyzing trace with hash 700546741, now seen corresponding path program 1 times [2022-01-10 10:03:08,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:08,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939083358] [2022-01-10 10:03:08,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:08,157 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:08,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:08,196 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 10:03:08,197 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:08,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939083358] [2022-01-10 10:03:08,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939083358] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:08,197 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:08,197 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:08,197 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644696913] [2022-01-10 10:03:08,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:08,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:08,197 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:08,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:08,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:08,198 INFO L87 Difference]: Start difference. First operand 191 states and 351 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states 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 10:03:08,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:08,208 INFO L93 Difference]: Finished difference Result 288 states and 526 transitions. [2022-01-10 10:03:08,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:08,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-01-10 10:03:08,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:08,209 INFO L225 Difference]: With dead ends: 288 [2022-01-10 10:03:08,209 INFO L226 Difference]: Without dead ends: 195 [2022-01-10 10:03:08,210 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 10:03:08,211 INFO L933 BasicCegarLoop]: 149 mSDtfsCounter, 74 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:08,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 236 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:08,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-01-10 10:03:08,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 193. [2022-01-10 10:03:08,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 1.828125) internal successors, (351), 192 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:08,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 351 transitions. [2022-01-10 10:03:08,217 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 351 transitions. Word has length 24 [2022-01-10 10:03:08,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:08,218 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 351 transitions. [2022-01-10 10:03:08,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states 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 10:03:08,218 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 351 transitions. [2022-01-10 10:03:08,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 10:03:08,220 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:08,221 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] [2022-01-10 10:03:08,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 10:03:08,221 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:08,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:08,222 INFO L85 PathProgramCache]: Analyzing trace with hash -143925130, now seen corresponding path program 1 times [2022-01-10 10:03:08,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:08,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836260558] [2022-01-10 10:03:08,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:08,222 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:08,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:08,256 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 10:03:08,256 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:08,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836260558] [2022-01-10 10:03:08,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836260558] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:08,257 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:08,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:08,257 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160316691] [2022-01-10 10:03:08,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:08,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:08,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:08,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:08,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:08,258 INFO L87 Difference]: Start difference. First operand 193 states and 351 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states 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 10:03:08,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:08,271 INFO L93 Difference]: Finished difference Result 369 states and 677 transitions. [2022-01-10 10:03:08,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:08,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-01-10 10:03:08,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:08,273 INFO L225 Difference]: With dead ends: 369 [2022-01-10 10:03:08,273 INFO L226 Difference]: Without dead ends: 367 [2022-01-10 10:03:08,273 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 10:03:08,274 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 67 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:08,274 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 183 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:08,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2022-01-10 10:03:08,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 261. [2022-01-10 10:03:08,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 260 states have (on average 1.8115384615384615) internal successors, (471), 260 states have internal predecessors, (471), 0 states have call successors, (0), 0 states 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 10:03:08,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 471 transitions. [2022-01-10 10:03:08,279 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 471 transitions. Word has length 24 [2022-01-10 10:03:08,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:08,280 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 471 transitions. [2022-01-10 10:03:08,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states 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 10:03:08,280 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 471 transitions. [2022-01-10 10:03:08,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 10:03:08,283 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:08,283 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] [2022-01-10 10:03:08,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 10:03:08,283 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:08,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:08,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1140997483, now seen corresponding path program 1 times [2022-01-10 10:03:08,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:08,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606124376] [2022-01-10 10:03:08,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:08,284 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:08,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:08,316 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 10:03:08,317 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:08,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606124376] [2022-01-10 10:03:08,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606124376] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:08,317 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:08,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:08,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836270075] [2022-01-10 10:03:08,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:08,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:08,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:08,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:08,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:08,318 INFO L87 Difference]: Start difference. First operand 261 states and 471 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states 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 10:03:08,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:08,332 INFO L93 Difference]: Finished difference Result 629 states and 1141 transitions. [2022-01-10 10:03:08,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:08,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-01-10 10:03:08,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:08,335 INFO L225 Difference]: With dead ends: 629 [2022-01-10 10:03:08,336 INFO L226 Difference]: Without dead ends: 375 [2022-01-10 10:03:08,337 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 10:03:08,337 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 71 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:08,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 215 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:08,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-01-10 10:03:08,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 373. [2022-01-10 10:03:08,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 372 states have (on average 1.803763440860215) internal successors, (671), 372 states have internal predecessors, (671), 0 states have call successors, (0), 0 states 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 10:03:08,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 671 transitions. [2022-01-10 10:03:08,369 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 671 transitions. Word has length 24 [2022-01-10 10:03:08,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:08,369 INFO L470 AbstractCegarLoop]: Abstraction has 373 states and 671 transitions. [2022-01-10 10:03:08,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states 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 10:03:08,370 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 671 transitions. [2022-01-10 10:03:08,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-10 10:03:08,370 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:08,370 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] [2022-01-10 10:03:08,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 10:03:08,370 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:08,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:08,371 INFO L85 PathProgramCache]: Analyzing trace with hash -166679383, now seen corresponding path program 1 times [2022-01-10 10:03:08,371 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:08,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047203228] [2022-01-10 10:03:08,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:08,371 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:08,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:08,402 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 10:03:08,402 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:08,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047203228] [2022-01-10 10:03:08,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047203228] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:08,402 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:08,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:08,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108107556] [2022-01-10 10:03:08,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:08,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:08,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:08,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:08,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:08,404 INFO L87 Difference]: Start difference. First operand 373 states and 671 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states 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 10:03:08,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:08,417 INFO L93 Difference]: Finished difference Result 561 states and 1005 transitions. [2022-01-10 10:03:08,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:08,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-01-10 10:03:08,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:08,419 INFO L225 Difference]: With dead ends: 561 [2022-01-10 10:03:08,419 INFO L226 Difference]: Without dead ends: 379 [2022-01-10 10:03:08,419 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 10:03:08,420 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 73 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:08,421 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 232 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:08,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-01-10 10:03:08,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 377. [2022-01-10 10:03:08,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 376 states have (on average 1.7845744680851063) internal successors, (671), 376 states have internal predecessors, (671), 0 states have call successors, (0), 0 states 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 10:03:08,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 671 transitions. [2022-01-10 10:03:08,428 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 671 transitions. Word has length 25 [2022-01-10 10:03:08,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:08,429 INFO L470 AbstractCegarLoop]: Abstraction has 377 states and 671 transitions. [2022-01-10 10:03:08,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states 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 10:03:08,430 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 671 transitions. [2022-01-10 10:03:08,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-10 10:03:08,430 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:08,430 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] [2022-01-10 10:03:08,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 10:03:08,431 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:08,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:08,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1011151254, now seen corresponding path program 1 times [2022-01-10 10:03:08,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:08,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087521503] [2022-01-10 10:03:08,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:08,432 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:08,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:08,458 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 10:03:08,458 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:08,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087521503] [2022-01-10 10:03:08,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087521503] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:08,458 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:08,458 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:08,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542813879] [2022-01-10 10:03:08,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:08,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:08,459 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:08,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:08,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:08,460 INFO L87 Difference]: Start difference. First operand 377 states and 671 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states 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 10:03:08,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:08,472 INFO L93 Difference]: Finished difference Result 713 states and 1285 transitions. [2022-01-10 10:03:08,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:08,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-01-10 10:03:08,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:08,474 INFO L225 Difference]: With dead ends: 713 [2022-01-10 10:03:08,474 INFO L226 Difference]: Without dead ends: 711 [2022-01-10 10:03:08,475 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 10:03:08,475 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 64 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:08,476 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 181 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:08,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2022-01-10 10:03:08,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 517. [2022-01-10 10:03:08,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 516 states have (on average 1.7577519379844961) internal successors, (907), 516 states have internal predecessors, (907), 0 states have call successors, (0), 0 states 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 10:03:08,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 907 transitions. [2022-01-10 10:03:08,486 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 907 transitions. Word has length 25 [2022-01-10 10:03:08,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:08,486 INFO L470 AbstractCegarLoop]: Abstraction has 517 states and 907 transitions. [2022-01-10 10:03:08,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states 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 10:03:08,486 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 907 transitions. [2022-01-10 10:03:08,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-10 10:03:08,487 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:08,487 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] [2022-01-10 10:03:08,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 10:03:08,488 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:08,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:08,488 INFO L85 PathProgramCache]: Analyzing trace with hash -2008223607, now seen corresponding path program 1 times [2022-01-10 10:03:08,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:08,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124676986] [2022-01-10 10:03:08,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:08,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:08,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:08,531 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 10:03:08,531 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:08,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124676986] [2022-01-10 10:03:08,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124676986] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:08,531 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:08,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:08,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781625698] [2022-01-10 10:03:08,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:08,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:08,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:08,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:08,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:08,533 INFO L87 Difference]: Start difference. First operand 517 states and 907 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states 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 10:03:08,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:08,547 INFO L93 Difference]: Finished difference Result 1241 states and 2189 transitions. [2022-01-10 10:03:08,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:08,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-01-10 10:03:08,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:08,550 INFO L225 Difference]: With dead ends: 1241 [2022-01-10 10:03:08,551 INFO L226 Difference]: Without dead ends: 735 [2022-01-10 10:03:08,551 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 10:03:08,552 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 70 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:08,552 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 216 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:08,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2022-01-10 10:03:08,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 733. [2022-01-10 10:03:08,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 732 states have (on average 1.7527322404371584) internal successors, (1283), 732 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states 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 10:03:08,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1283 transitions. [2022-01-10 10:03:08,565 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1283 transitions. Word has length 25 [2022-01-10 10:03:08,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:08,565 INFO L470 AbstractCegarLoop]: Abstraction has 733 states and 1283 transitions. [2022-01-10 10:03:08,565 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states 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 10:03:08,565 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1283 transitions. [2022-01-10 10:03:08,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-10 10:03:08,566 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:08,566 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] [2022-01-10 10:03:08,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 10:03:08,567 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:08,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:08,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1280885327, now seen corresponding path program 1 times [2022-01-10 10:03:08,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:08,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628738805] [2022-01-10 10:03:08,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:08,567 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:08,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:08,595 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 10:03:08,595 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:08,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628738805] [2022-01-10 10:03:08,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628738805] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:08,595 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:08,596 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:08,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045005693] [2022-01-10 10:03:08,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:08,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:08,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:08,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:08,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:08,597 INFO L87 Difference]: Start difference. First operand 733 states and 1283 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states 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 10:03:08,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:08,609 INFO L93 Difference]: Finished difference Result 1101 states and 1921 transitions. [2022-01-10 10:03:08,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:08,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-01-10 10:03:08,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:08,612 INFO L225 Difference]: With dead ends: 1101 [2022-01-10 10:03:08,612 INFO L226 Difference]: Without dead ends: 743 [2022-01-10 10:03:08,613 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 10:03:08,614 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 72 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:08,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 228 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:08,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2022-01-10 10:03:08,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 741. [2022-01-10 10:03:08,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 740 states have (on average 1.7337837837837837) internal successors, (1283), 740 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states 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 10:03:08,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1283 transitions. [2022-01-10 10:03:08,630 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1283 transitions. Word has length 26 [2022-01-10 10:03:08,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:08,631 INFO L470 AbstractCegarLoop]: Abstraction has 741 states and 1283 transitions. [2022-01-10 10:03:08,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states 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 10:03:08,631 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1283 transitions. [2022-01-10 10:03:08,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-10 10:03:08,632 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:08,632 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] [2022-01-10 10:03:08,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 10:03:08,632 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:08,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:08,632 INFO L85 PathProgramCache]: Analyzing trace with hash -2125357198, now seen corresponding path program 1 times [2022-01-10 10:03:08,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:08,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897487559] [2022-01-10 10:03:08,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:08,633 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:08,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:08,657 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 10:03:08,658 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:08,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897487559] [2022-01-10 10:03:08,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897487559] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:08,658 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:08,658 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:08,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015879911] [2022-01-10 10:03:08,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:08,658 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:08,658 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:08,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:08,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:08,659 INFO L87 Difference]: Start difference. First operand 741 states and 1283 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states 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 10:03:08,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:08,676 INFO L93 Difference]: Finished difference Result 1385 states and 2437 transitions. [2022-01-10 10:03:08,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:08,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-01-10 10:03:08,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:08,680 INFO L225 Difference]: With dead ends: 1385 [2022-01-10 10:03:08,680 INFO L226 Difference]: Without dead ends: 1383 [2022-01-10 10:03:08,681 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 10:03:08,681 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 61 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:08,681 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 179 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:08,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2022-01-10 10:03:08,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1029. [2022-01-10 10:03:08,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 1028 states have (on average 1.6994163424124513) internal successors, (1747), 1028 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states 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 10:03:08,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1747 transitions. [2022-01-10 10:03:08,700 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1747 transitions. Word has length 26 [2022-01-10 10:03:08,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:08,700 INFO L470 AbstractCegarLoop]: Abstraction has 1029 states and 1747 transitions. [2022-01-10 10:03:08,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states 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 10:03:08,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1747 transitions. [2022-01-10 10:03:08,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-10 10:03:08,701 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:08,701 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] [2022-01-10 10:03:08,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 10:03:08,701 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:08,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:08,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1172537745, now seen corresponding path program 1 times [2022-01-10 10:03:08,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:08,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615636070] [2022-01-10 10:03:08,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:08,702 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:08,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:08,721 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 10:03:08,721 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:08,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615636070] [2022-01-10 10:03:08,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615636070] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:08,721 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:08,721 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:08,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118913617] [2022-01-10 10:03:08,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:08,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:08,722 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:08,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:08,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:08,722 INFO L87 Difference]: Start difference. First operand 1029 states and 1747 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states 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 10:03:08,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:08,742 INFO L93 Difference]: Finished difference Result 2457 states and 4197 transitions. [2022-01-10 10:03:08,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:08,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-01-10 10:03:08,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:08,747 INFO L225 Difference]: With dead ends: 2457 [2022-01-10 10:03:08,747 INFO L226 Difference]: Without dead ends: 1447 [2022-01-10 10:03:08,748 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 10:03:08,749 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 69 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:08,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 217 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:08,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2022-01-10 10:03:08,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1445. [2022-01-10 10:03:08,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1444 states have (on average 1.6973684210526316) internal successors, (2451), 1444 states have internal predecessors, (2451), 0 states have call successors, (0), 0 states 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 10:03:08,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 2451 transitions. [2022-01-10 10:03:08,772 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 2451 transitions. Word has length 26 [2022-01-10 10:03:08,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:08,773 INFO L470 AbstractCegarLoop]: Abstraction has 1445 states and 2451 transitions. [2022-01-10 10:03:08,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states 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 10:03:08,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 2451 transitions. [2022-01-10 10:03:08,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-10 10:03:08,774 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:08,774 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:03:08,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 10:03:08,774 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:08,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:08,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1461531099, now seen corresponding path program 1 times [2022-01-10 10:03:08,775 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:08,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698830789] [2022-01-10 10:03:08,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:08,775 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:08,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:08,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 10:03:08,794 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:08,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698830789] [2022-01-10 10:03:08,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698830789] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:08,794 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:08,794 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:08,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594439769] [2022-01-10 10:03:08,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:08,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:08,795 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:08,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:08,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:08,795 INFO L87 Difference]: Start difference. First operand 1445 states and 2451 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:08,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:08,813 INFO L93 Difference]: Finished difference Result 2169 states and 3669 transitions. [2022-01-10 10:03:08,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:08,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-01-10 10:03:08,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:08,818 INFO L225 Difference]: With dead ends: 2169 [2022-01-10 10:03:08,818 INFO L226 Difference]: Without dead ends: 1463 [2022-01-10 10:03:08,820 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 10:03:08,820 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 71 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:08,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 224 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:08,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2022-01-10 10:03:08,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 1461. [2022-01-10 10:03:08,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1461 states, 1460 states have (on average 1.6787671232876713) internal successors, (2451), 1460 states have internal predecessors, (2451), 0 states have call successors, (0), 0 states 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 10:03:08,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1461 states and 2451 transitions. [2022-01-10 10:03:08,852 INFO L78 Accepts]: Start accepts. Automaton has 1461 states and 2451 transitions. Word has length 27 [2022-01-10 10:03:08,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:08,852 INFO L470 AbstractCegarLoop]: Abstraction has 1461 states and 2451 transitions. [2022-01-10 10:03:08,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:08,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 2451 transitions. [2022-01-10 10:03:08,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-10 10:03:08,853 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:08,854 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:03:08,854 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 10:03:08,854 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:08,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:08,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1988964326, now seen corresponding path program 1 times [2022-01-10 10:03:08,854 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:08,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752842266] [2022-01-10 10:03:08,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:08,855 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:08,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:08,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 10:03:08,906 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:08,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752842266] [2022-01-10 10:03:08,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752842266] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:08,908 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:08,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:08,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711218269] [2022-01-10 10:03:08,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:08,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:08,908 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:08,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:08,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:08,909 INFO L87 Difference]: Start difference. First operand 1461 states and 2451 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:08,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:08,934 INFO L93 Difference]: Finished difference Result 2697 states and 4613 transitions. [2022-01-10 10:03:08,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:08,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-01-10 10:03:08,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:08,942 INFO L225 Difference]: With dead ends: 2697 [2022-01-10 10:03:08,942 INFO L226 Difference]: Without dead ends: 2695 [2022-01-10 10:03:08,946 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 10:03:08,947 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 58 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:08,948 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 177 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:08,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2695 states. [2022-01-10 10:03:08,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2695 to 2053. [2022-01-10 10:03:08,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2053 states, 2052 states have (on average 1.6388888888888888) internal successors, (3363), 2052 states have internal predecessors, (3363), 0 states have call successors, (0), 0 states 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 10:03:08,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 3363 transitions. [2022-01-10 10:03:08,990 INFO L78 Accepts]: Start accepts. Automaton has 2053 states and 3363 transitions. Word has length 27 [2022-01-10 10:03:08,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:08,990 INFO L470 AbstractCegarLoop]: Abstraction has 2053 states and 3363 transitions. [2022-01-10 10:03:08,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:08,990 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 3363 transitions. [2022-01-10 10:03:08,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-10 10:03:08,992 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:08,992 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:03:08,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 10:03:08,992 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:08,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:08,993 INFO L85 PathProgramCache]: Analyzing trace with hash 991891973, now seen corresponding path program 1 times [2022-01-10 10:03:08,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:08,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472388191] [2022-01-10 10:03:08,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:08,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:09,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:09,012 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 10:03:09,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:09,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472388191] [2022-01-10 10:03:09,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472388191] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:09,012 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:09,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:09,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146284329] [2022-01-10 10:03:09,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:09,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:09,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:09,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:09,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:09,013 INFO L87 Difference]: Start difference. First operand 2053 states and 3363 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:09,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:09,047 INFO L93 Difference]: Finished difference Result 4873 states and 8037 transitions. [2022-01-10 10:03:09,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:09,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-01-10 10:03:09,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:09,055 INFO L225 Difference]: With dead ends: 4873 [2022-01-10 10:03:09,055 INFO L226 Difference]: Without dead ends: 2855 [2022-01-10 10:03:09,057 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 10:03:09,057 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 68 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:09,058 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 218 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:09,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2855 states. [2022-01-10 10:03:09,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2855 to 2853. [2022-01-10 10:03:09,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2853 states, 2852 states have (on average 1.6392005610098177) internal successors, (4675), 2852 states have internal predecessors, (4675), 0 states have call successors, (0), 0 states 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 10:03:09,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2853 states to 2853 states and 4675 transitions. [2022-01-10 10:03:09,108 INFO L78 Accepts]: Start accepts. Automaton has 2853 states and 4675 transitions. Word has length 27 [2022-01-10 10:03:09,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:09,108 INFO L470 AbstractCegarLoop]: Abstraction has 2853 states and 4675 transitions. [2022-01-10 10:03:09,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:09,109 INFO L276 IsEmpty]: Start isEmpty. Operand 2853 states and 4675 transitions. [2022-01-10 10:03:09,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-10 10:03:09,110 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:09,110 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] [2022-01-10 10:03:09,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 10:03:09,111 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:09,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:09,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1528384685, now seen corresponding path program 1 times [2022-01-10 10:03:09,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:09,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650655705] [2022-01-10 10:03:09,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:09,111 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:09,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:09,140 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 10:03:09,140 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:09,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650655705] [2022-01-10 10:03:09,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650655705] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:09,140 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:09,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:09,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634054186] [2022-01-10 10:03:09,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:09,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:09,141 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:09,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:09,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:09,141 INFO L87 Difference]: Start difference. First operand 2853 states and 4675 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states 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 10:03:09,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:09,169 INFO L93 Difference]: Finished difference Result 4281 states and 6997 transitions. [2022-01-10 10:03:09,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:09,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-01-10 10:03:09,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:09,177 INFO L225 Difference]: With dead ends: 4281 [2022-01-10 10:03:09,177 INFO L226 Difference]: Without dead ends: 2887 [2022-01-10 10:03:09,179 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 10:03:09,179 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 70 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:09,179 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 220 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:09,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2887 states. [2022-01-10 10:03:09,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2887 to 2885. [2022-01-10 10:03:09,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2885 states, 2884 states have (on average 1.6210124826629682) internal successors, (4675), 2884 states have internal predecessors, (4675), 0 states have call successors, (0), 0 states 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 10:03:09,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2885 states to 2885 states and 4675 transitions. [2022-01-10 10:03:09,236 INFO L78 Accepts]: Start accepts. Automaton has 2885 states and 4675 transitions. Word has length 28 [2022-01-10 10:03:09,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:09,236 INFO L470 AbstractCegarLoop]: Abstraction has 2885 states and 4675 transitions. [2022-01-10 10:03:09,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states 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 10:03:09,236 INFO L276 IsEmpty]: Start isEmpty. Operand 2885 states and 4675 transitions. [2022-01-10 10:03:09,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-10 10:03:09,238 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:09,238 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] [2022-01-10 10:03:09,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 10:03:09,238 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:09,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:09,239 INFO L85 PathProgramCache]: Analyzing trace with hash 683912814, now seen corresponding path program 1 times [2022-01-10 10:03:09,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:09,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293397172] [2022-01-10 10:03:09,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:09,239 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:09,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:09,256 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 10:03:09,256 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:09,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293397172] [2022-01-10 10:03:09,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293397172] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:09,256 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:09,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:09,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817847543] [2022-01-10 10:03:09,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:09,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:09,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:09,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:09,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:09,258 INFO L87 Difference]: Start difference. First operand 2885 states and 4675 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states 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 10:03:09,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:09,321 INFO L93 Difference]: Finished difference Result 5257 states and 8709 transitions. [2022-01-10 10:03:09,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:09,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-01-10 10:03:09,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:09,342 INFO L225 Difference]: With dead ends: 5257 [2022-01-10 10:03:09,342 INFO L226 Difference]: Without dead ends: 5255 [2022-01-10 10:03:09,344 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 10:03:09,344 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 55 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:09,344 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 175 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:09,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5255 states. [2022-01-10 10:03:09,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5255 to 4101. [2022-01-10 10:03:09,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4101 states, 4100 states have (on average 1.5773170731707318) internal successors, (6467), 4100 states have internal predecessors, (6467), 0 states have call successors, (0), 0 states 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 10:03:09,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4101 states to 4101 states and 6467 transitions. [2022-01-10 10:03:09,423 INFO L78 Accepts]: Start accepts. Automaton has 4101 states and 6467 transitions. Word has length 28 [2022-01-10 10:03:09,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:09,423 INFO L470 AbstractCegarLoop]: Abstraction has 4101 states and 6467 transitions. [2022-01-10 10:03:09,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states 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 10:03:09,423 INFO L276 IsEmpty]: Start isEmpty. Operand 4101 states and 6467 transitions. [2022-01-10 10:03:09,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-10 10:03:09,428 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:09,428 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] [2022-01-10 10:03:09,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 10:03:09,428 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:09,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:09,429 INFO L85 PathProgramCache]: Analyzing trace with hash -313159539, now seen corresponding path program 1 times [2022-01-10 10:03:09,429 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:09,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892063490] [2022-01-10 10:03:09,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:09,429 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:09,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:09,447 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 10:03:09,447 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:09,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892063490] [2022-01-10 10:03:09,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892063490] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:09,447 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:09,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:09,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454146804] [2022-01-10 10:03:09,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:09,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:09,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:09,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:09,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:09,448 INFO L87 Difference]: Start difference. First operand 4101 states and 6467 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states 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 10:03:09,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:09,504 INFO L93 Difference]: Finished difference Result 9673 states and 15365 transitions. [2022-01-10 10:03:09,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:09,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-01-10 10:03:09,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:09,527 INFO L225 Difference]: With dead ends: 9673 [2022-01-10 10:03:09,527 INFO L226 Difference]: Without dead ends: 5639 [2022-01-10 10:03:09,531 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 10:03:09,533 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 67 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:09,533 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 219 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:09,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5639 states. [2022-01-10 10:03:09,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5639 to 5637. [2022-01-10 10:03:09,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5637 states, 5636 states have (on average 1.578956706884315) internal successors, (8899), 5636 states have internal predecessors, (8899), 0 states have call successors, (0), 0 states 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 10:03:09,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5637 states to 5637 states and 8899 transitions. [2022-01-10 10:03:09,656 INFO L78 Accepts]: Start accepts. Automaton has 5637 states and 8899 transitions. Word has length 28 [2022-01-10 10:03:09,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:09,656 INFO L470 AbstractCegarLoop]: Abstraction has 5637 states and 8899 transitions. [2022-01-10 10:03:09,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states 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 10:03:09,657 INFO L276 IsEmpty]: Start isEmpty. Operand 5637 states and 8899 transitions. [2022-01-10 10:03:09,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-10 10:03:09,660 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:09,660 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] [2022-01-10 10:03:09,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 10:03:09,661 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:09,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:09,661 INFO L85 PathProgramCache]: Analyzing trace with hash -273506399, now seen corresponding path program 1 times [2022-01-10 10:03:09,661 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:09,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85537896] [2022-01-10 10:03:09,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:09,661 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:09,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:09,715 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 10:03:09,715 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:09,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85537896] [2022-01-10 10:03:09,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85537896] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:09,716 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:09,716 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:09,716 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402366200] [2022-01-10 10:03:09,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:09,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:09,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:09,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:09,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:09,717 INFO L87 Difference]: Start difference. First operand 5637 states and 8899 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states 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 10:03:09,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:09,773 INFO L93 Difference]: Finished difference Result 8457 states and 13317 transitions. [2022-01-10 10:03:09,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:09,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-01-10 10:03:09,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:09,782 INFO L225 Difference]: With dead ends: 8457 [2022-01-10 10:03:09,782 INFO L226 Difference]: Without dead ends: 5703 [2022-01-10 10:03:09,786 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 10:03:09,787 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 69 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:09,787 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 216 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:09,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5703 states. [2022-01-10 10:03:09,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5703 to 5701. [2022-01-10 10:03:09,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5701 states, 5700 states have (on average 1.5612280701754386) internal successors, (8899), 5700 states have internal predecessors, (8899), 0 states have call successors, (0), 0 states 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 10:03:09,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5701 states to 5701 states and 8899 transitions. [2022-01-10 10:03:09,878 INFO L78 Accepts]: Start accepts. Automaton has 5701 states and 8899 transitions. Word has length 29 [2022-01-10 10:03:09,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:09,878 INFO L470 AbstractCegarLoop]: Abstraction has 5701 states and 8899 transitions. [2022-01-10 10:03:09,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states 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 10:03:09,878 INFO L276 IsEmpty]: Start isEmpty. Operand 5701 states and 8899 transitions. [2022-01-10 10:03:09,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-10 10:03:09,882 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:09,882 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] [2022-01-10 10:03:09,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-10 10:03:09,882 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:09,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:09,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1117978270, now seen corresponding path program 1 times [2022-01-10 10:03:09,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:09,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717631911] [2022-01-10 10:03:09,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:09,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:09,915 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 10:03:09,915 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:09,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717631911] [2022-01-10 10:03:09,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717631911] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:09,915 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:09,916 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:09,916 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921943820] [2022-01-10 10:03:09,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:09,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:09,916 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:09,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:09,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:09,917 INFO L87 Difference]: Start difference. First operand 5701 states and 8899 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states 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 10:03:09,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:09,990 INFO L93 Difference]: Finished difference Result 10249 states and 16389 transitions. [2022-01-10 10:03:09,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:09,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-01-10 10:03:09,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:10,008 INFO L225 Difference]: With dead ends: 10249 [2022-01-10 10:03:10,008 INFO L226 Difference]: Without dead ends: 10247 [2022-01-10 10:03:10,014 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 10:03:10,015 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 52 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:10,015 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 173 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:10,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10247 states. [2022-01-10 10:03:10,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10247 to 8197. [2022-01-10 10:03:10,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8197 states, 8196 states have (on average 1.5152513421181064) internal successors, (12419), 8196 states have internal predecessors, (12419), 0 states have call successors, (0), 0 states 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 10:03:10,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8197 states to 8197 states and 12419 transitions. [2022-01-10 10:03:10,196 INFO L78 Accepts]: Start accepts. Automaton has 8197 states and 12419 transitions. Word has length 29 [2022-01-10 10:03:10,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:10,197 INFO L470 AbstractCegarLoop]: Abstraction has 8197 states and 12419 transitions. [2022-01-10 10:03:10,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states 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 10:03:10,197 INFO L276 IsEmpty]: Start isEmpty. Operand 8197 states and 12419 transitions. [2022-01-10 10:03:10,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-10 10:03:10,204 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:10,204 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] [2022-01-10 10:03:10,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-10 10:03:10,205 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:10,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:10,205 INFO L85 PathProgramCache]: Analyzing trace with hash -2115050623, now seen corresponding path program 1 times [2022-01-10 10:03:10,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:10,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448372064] [2022-01-10 10:03:10,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:10,205 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:10,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:10,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 10:03:10,222 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:10,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448372064] [2022-01-10 10:03:10,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448372064] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:10,222 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:10,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:10,223 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218553330] [2022-01-10 10:03:10,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:10,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:10,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:10,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:10,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:10,224 INFO L87 Difference]: Start difference. First operand 8197 states and 12419 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states 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 10:03:10,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:10,323 INFO L93 Difference]: Finished difference Result 19209 states and 29317 transitions. [2022-01-10 10:03:10,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:10,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-01-10 10:03:10,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:10,339 INFO L225 Difference]: With dead ends: 19209 [2022-01-10 10:03:10,339 INFO L226 Difference]: Without dead ends: 11143 [2022-01-10 10:03:10,350 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 10:03:10,351 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 66 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:10,351 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 220 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:10,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11143 states. [2022-01-10 10:03:10,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11143 to 11141. [2022-01-10 10:03:10,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11141 states, 11140 states have (on average 1.5169658886894075) internal successors, (16899), 11140 states have internal predecessors, (16899), 0 states have call successors, (0), 0 states 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 10:03:10,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11141 states to 11141 states and 16899 transitions. [2022-01-10 10:03:10,567 INFO L78 Accepts]: Start accepts. Automaton has 11141 states and 16899 transitions. Word has length 29 [2022-01-10 10:03:10,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:10,568 INFO L470 AbstractCegarLoop]: Abstraction has 11141 states and 16899 transitions. [2022-01-10 10:03:10,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states 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 10:03:10,568 INFO L276 IsEmpty]: Start isEmpty. Operand 11141 states and 16899 transitions. [2022-01-10 10:03:10,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-10 10:03:10,575 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:10,575 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] [2022-01-10 10:03:10,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-10 10:03:10,575 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:10,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:10,575 INFO L85 PathProgramCache]: Analyzing trace with hash -297555031, now seen corresponding path program 1 times [2022-01-10 10:03:10,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:10,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225767325] [2022-01-10 10:03:10,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:10,576 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:10,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:10,590 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 10:03:10,590 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:10,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225767325] [2022-01-10 10:03:10,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225767325] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:10,592 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:10,592 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:10,592 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331767450] [2022-01-10 10:03:10,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:10,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:10,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:10,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:10,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:10,593 INFO L87 Difference]: Start difference. First operand 11141 states and 16899 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states 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 10:03:10,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:10,674 INFO L93 Difference]: Finished difference Result 16713 states and 25285 transitions. [2022-01-10 10:03:10,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:10,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-01-10 10:03:10,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:10,692 INFO L225 Difference]: With dead ends: 16713 [2022-01-10 10:03:10,692 INFO L226 Difference]: Without dead ends: 11271 [2022-01-10 10:03:10,701 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 10:03:10,702 INFO L933 BasicCegarLoop]: 131 mSDtfsCounter, 68 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:10,702 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 212 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:10,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11271 states. [2022-01-10 10:03:10,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11271 to 11269. [2022-01-10 10:03:10,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11269 states, 11268 states have (on average 1.499733759318424) internal successors, (16899), 11268 states have internal predecessors, (16899), 0 states have call successors, (0), 0 states 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 10:03:11,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11269 states to 11269 states and 16899 transitions. [2022-01-10 10:03:11,015 INFO L78 Accepts]: Start accepts. Automaton has 11269 states and 16899 transitions. Word has length 30 [2022-01-10 10:03:11,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:11,015 INFO L470 AbstractCegarLoop]: Abstraction has 11269 states and 16899 transitions. [2022-01-10 10:03:11,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states 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 10:03:11,015 INFO L276 IsEmpty]: Start isEmpty. Operand 11269 states and 16899 transitions. [2022-01-10 10:03:11,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-10 10:03:11,022 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:11,022 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] [2022-01-10 10:03:11,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-10 10:03:11,022 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:11,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:11,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1142026902, now seen corresponding path program 1 times [2022-01-10 10:03:11,023 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:11,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467560051] [2022-01-10 10:03:11,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:11,023 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:11,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:11,038 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 10:03:11,038 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:11,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467560051] [2022-01-10 10:03:11,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467560051] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:11,038 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:11,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:11,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008214463] [2022-01-10 10:03:11,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:11,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:11,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:11,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:11,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:11,039 INFO L87 Difference]: Start difference. First operand 11269 states and 16899 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states 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 10:03:11,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:11,163 INFO L93 Difference]: Finished difference Result 19977 states and 30725 transitions. [2022-01-10 10:03:11,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:11,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-01-10 10:03:11,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:11,197 INFO L225 Difference]: With dead ends: 19977 [2022-01-10 10:03:11,197 INFO L226 Difference]: Without dead ends: 19975 [2022-01-10 10:03:11,207 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 10:03:11,207 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 49 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:11,210 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 171 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:11,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19975 states. [2022-01-10 10:03:11,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19975 to 16389. [2022-01-10 10:03:11,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16389 states, 16388 states have (on average 1.4529533805223334) internal successors, (23811), 16388 states have internal predecessors, (23811), 0 states have call successors, (0), 0 states 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 10:03:11,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16389 states to 16389 states and 23811 transitions. [2022-01-10 10:03:11,500 INFO L78 Accepts]: Start accepts. Automaton has 16389 states and 23811 transitions. Word has length 30 [2022-01-10 10:03:11,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:11,500 INFO L470 AbstractCegarLoop]: Abstraction has 16389 states and 23811 transitions. [2022-01-10 10:03:11,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states 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 10:03:11,500 INFO L276 IsEmpty]: Start isEmpty. Operand 16389 states and 23811 transitions. [2022-01-10 10:03:11,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-10 10:03:11,513 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:11,513 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] [2022-01-10 10:03:11,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-10 10:03:11,513 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:11,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:11,514 INFO L85 PathProgramCache]: Analyzing trace with hash -2139099255, now seen corresponding path program 1 times [2022-01-10 10:03:11,514 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:11,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213455371] [2022-01-10 10:03:11,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:11,514 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:11,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:11,534 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 10:03:11,534 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:11,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213455371] [2022-01-10 10:03:11,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213455371] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:11,534 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:11,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:11,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162195450] [2022-01-10 10:03:11,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:11,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:11,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:11,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:11,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:11,535 INFO L87 Difference]: Start difference. First operand 16389 states and 23811 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states 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 10:03:11,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:11,778 INFO L93 Difference]: Finished difference Result 38153 states and 55813 transitions. [2022-01-10 10:03:11,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:11,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-01-10 10:03:11,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:11,814 INFO L225 Difference]: With dead ends: 38153 [2022-01-10 10:03:11,814 INFO L226 Difference]: Without dead ends: 22023 [2022-01-10 10:03:11,830 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 10:03:11,830 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 65 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:11,830 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 221 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:11,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22023 states. [2022-01-10 10:03:12,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22023 to 22021. [2022-01-10 10:03:12,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22021 states, 22020 states have (on average 1.4533605812897366) internal successors, (32003), 22020 states have internal predecessors, (32003), 0 states have call successors, (0), 0 states 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 10:03:12,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22021 states to 22021 states and 32003 transitions. [2022-01-10 10:03:12,236 INFO L78 Accepts]: Start accepts. Automaton has 22021 states and 32003 transitions. Word has length 30 [2022-01-10 10:03:12,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:12,236 INFO L470 AbstractCegarLoop]: Abstraction has 22021 states and 32003 transitions. [2022-01-10 10:03:12,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states 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 10:03:12,236 INFO L276 IsEmpty]: Start isEmpty. Operand 22021 states and 32003 transitions. [2022-01-10 10:03:12,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-10 10:03:12,248 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:12,248 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:03:12,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-10 10:03:12,249 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:12,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:12,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1043062499, now seen corresponding path program 1 times [2022-01-10 10:03:12,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:12,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110490569] [2022-01-10 10:03:12,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:12,250 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:12,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:12,265 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 10:03:12,265 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:12,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110490569] [2022-01-10 10:03:12,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110490569] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:12,265 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:12,265 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:12,265 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316629434] [2022-01-10 10:03:12,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:12,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:12,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:12,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:12,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:12,266 INFO L87 Difference]: Start difference. First operand 22021 states and 32003 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:12,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:12,412 INFO L93 Difference]: Finished difference Result 33033 states and 47877 transitions. [2022-01-10 10:03:12,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:12,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-01-10 10:03:12,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:12,449 INFO L225 Difference]: With dead ends: 33033 [2022-01-10 10:03:12,449 INFO L226 Difference]: Without dead ends: 22279 [2022-01-10 10:03:12,461 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 10:03:12,462 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 67 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:12,463 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 208 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:12,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22279 states. [2022-01-10 10:03:12,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22279 to 22277. [2022-01-10 10:03:12,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22277 states, 22276 states have (on average 1.4366582869455917) internal successors, (32003), 22276 states have internal predecessors, (32003), 0 states have call successors, (0), 0 states 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 10:03:12,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22277 states to 22277 states and 32003 transitions. [2022-01-10 10:03:12,831 INFO L78 Accepts]: Start accepts. Automaton has 22277 states and 32003 transitions. Word has length 31 [2022-01-10 10:03:12,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:12,831 INFO L470 AbstractCegarLoop]: Abstraction has 22277 states and 32003 transitions. [2022-01-10 10:03:12,831 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:12,831 INFO L276 IsEmpty]: Start isEmpty. Operand 22277 states and 32003 transitions. [2022-01-10 10:03:12,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-10 10:03:12,850 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:12,850 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:03:12,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-10 10:03:12,850 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:12,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:12,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1887534370, now seen corresponding path program 1 times [2022-01-10 10:03:12,851 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:12,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729212772] [2022-01-10 10:03:12,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:12,851 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:12,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:12,868 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 10:03:12,869 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:12,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729212772] [2022-01-10 10:03:12,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729212772] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:12,870 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:12,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:12,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568224727] [2022-01-10 10:03:12,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:12,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:12,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:12,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:12,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:12,871 INFO L87 Difference]: Start difference. First operand 22277 states and 32003 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:13,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:13,162 INFO L93 Difference]: Finished difference Result 38921 states and 57349 transitions. [2022-01-10 10:03:13,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:13,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-01-10 10:03:13,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:13,206 INFO L225 Difference]: With dead ends: 38921 [2022-01-10 10:03:13,206 INFO L226 Difference]: Without dead ends: 38919 [2022-01-10 10:03:13,211 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 10:03:13,212 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 46 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:13,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 169 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:13,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38919 states. [2022-01-10 10:03:13,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38919 to 32773. [2022-01-10 10:03:13,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32773 states, 32772 states have (on average 1.390546808250946) internal successors, (45571), 32772 states have internal predecessors, (45571), 0 states have call successors, (0), 0 states 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 10:03:13,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32773 states to 32773 states and 45571 transitions. [2022-01-10 10:03:13,745 INFO L78 Accepts]: Start accepts. Automaton has 32773 states and 45571 transitions. Word has length 31 [2022-01-10 10:03:13,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:13,746 INFO L470 AbstractCegarLoop]: Abstraction has 32773 states and 45571 transitions. [2022-01-10 10:03:13,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:13,746 INFO L276 IsEmpty]: Start isEmpty. Operand 32773 states and 45571 transitions. [2022-01-10 10:03:13,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-10 10:03:13,766 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:13,766 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:03:13,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-10 10:03:13,766 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:13,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:13,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1410360573, now seen corresponding path program 1 times [2022-01-10 10:03:13,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:13,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790379298] [2022-01-10 10:03:13,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:13,767 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:13,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:13,781 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 10:03:13,781 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:13,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790379298] [2022-01-10 10:03:13,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790379298] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:13,781 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:13,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:13,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687978965] [2022-01-10 10:03:13,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:13,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:13,782 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:13,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:13,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:13,782 INFO L87 Difference]: Start difference. First operand 32773 states and 45571 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:14,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:14,313 INFO L93 Difference]: Finished difference Result 75785 states and 105989 transitions. [2022-01-10 10:03:14,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:14,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-01-10 10:03:14,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:14,360 INFO L225 Difference]: With dead ends: 75785 [2022-01-10 10:03:14,360 INFO L226 Difference]: Without dead ends: 43527 [2022-01-10 10:03:14,371 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 10:03:14,371 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 64 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:14,371 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 222 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:14,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43527 states. [2022-01-10 10:03:14,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43527 to 43525. [2022-01-10 10:03:14,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43525 states, 43524 states have (on average 1.3881766381766383) internal successors, (60419), 43524 states have internal predecessors, (60419), 0 states have call successors, (0), 0 states 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 10:03:15,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43525 states to 43525 states and 60419 transitions. [2022-01-10 10:03:15,023 INFO L78 Accepts]: Start accepts. Automaton has 43525 states and 60419 transitions. Word has length 31 [2022-01-10 10:03:15,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:15,023 INFO L470 AbstractCegarLoop]: Abstraction has 43525 states and 60419 transitions. [2022-01-10 10:03:15,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:15,023 INFO L276 IsEmpty]: Start isEmpty. Operand 43525 states and 60419 transitions. [2022-01-10 10:03:15,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-10 10:03:15,045 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:15,045 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] [2022-01-10 10:03:15,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-10 10:03:15,045 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:15,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:15,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1616009893, now seen corresponding path program 1 times [2022-01-10 10:03:15,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:15,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435225857] [2022-01-10 10:03:15,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:15,047 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:15,069 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 10:03:15,069 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:15,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435225857] [2022-01-10 10:03:15,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435225857] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:15,069 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:15,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:15,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076433874] [2022-01-10 10:03:15,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:15,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:15,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:15,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:15,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:15,070 INFO L87 Difference]: Start difference. First operand 43525 states and 60419 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states 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 10:03:15,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:15,461 INFO L93 Difference]: Finished difference Result 65289 states and 90373 transitions. [2022-01-10 10:03:15,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:15,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2022-01-10 10:03:15,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:15,509 INFO L225 Difference]: With dead ends: 65289 [2022-01-10 10:03:15,509 INFO L226 Difference]: Without dead ends: 44039 [2022-01-10 10:03:15,525 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 10:03:15,525 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 66 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:15,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 204 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:15,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44039 states. [2022-01-10 10:03:16,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44039 to 44037. [2022-01-10 10:03:16,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44037 states, 44036 states have (on average 1.3720365155781633) internal successors, (60419), 44036 states have internal predecessors, (60419), 0 states have call successors, (0), 0 states 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 10:03:16,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44037 states to 44037 states and 60419 transitions. [2022-01-10 10:03:16,224 INFO L78 Accepts]: Start accepts. Automaton has 44037 states and 60419 transitions. Word has length 32 [2022-01-10 10:03:16,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:16,224 INFO L470 AbstractCegarLoop]: Abstraction has 44037 states and 60419 transitions. [2022-01-10 10:03:16,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states 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 10:03:16,225 INFO L276 IsEmpty]: Start isEmpty. Operand 44037 states and 60419 transitions. [2022-01-10 10:03:16,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-10 10:03:16,244 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:16,244 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] [2022-01-10 10:03:16,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-10 10:03:16,245 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:16,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:16,245 INFO L85 PathProgramCache]: Analyzing trace with hash 771538022, now seen corresponding path program 1 times [2022-01-10 10:03:16,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:16,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833958737] [2022-01-10 10:03:16,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:16,246 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:16,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:16,261 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 10:03:16,261 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:16,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833958737] [2022-01-10 10:03:16,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833958737] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:16,261 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:16,261 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:16,261 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183443097] [2022-01-10 10:03:16,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:16,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:16,262 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:16,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:16,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:16,262 INFO L87 Difference]: Start difference. First operand 44037 states and 60419 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states 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 10:03:16,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:16,855 INFO L93 Difference]: Finished difference Result 75785 states and 106501 transitions. [2022-01-10 10:03:16,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:16,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2022-01-10 10:03:16,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:16,948 INFO L225 Difference]: With dead ends: 75785 [2022-01-10 10:03:16,948 INFO L226 Difference]: Without dead ends: 75783 [2022-01-10 10:03:16,956 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 10:03:16,956 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 43 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:16,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 167 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:16,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75783 states. [2022-01-10 10:03:17,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75783 to 65541. [2022-01-10 10:03:17,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65541 states, 65540 states have (on average 1.328089716203845) internal successors, (87043), 65540 states have internal predecessors, (87043), 0 states have call successors, (0), 0 states 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 10:03:17,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65541 states to 65541 states and 87043 transitions. [2022-01-10 10:03:17,807 INFO L78 Accepts]: Start accepts. Automaton has 65541 states and 87043 transitions. Word has length 32 [2022-01-10 10:03:17,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:17,807 INFO L470 AbstractCegarLoop]: Abstraction has 65541 states and 87043 transitions. [2022-01-10 10:03:17,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states 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 10:03:17,807 INFO L276 IsEmpty]: Start isEmpty. Operand 65541 states and 87043 transitions. [2022-01-10 10:03:17,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-10 10:03:17,853 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:17,854 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] [2022-01-10 10:03:17,854 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-10 10:03:17,854 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:17,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:17,854 INFO L85 PathProgramCache]: Analyzing trace with hash -225534331, now seen corresponding path program 1 times [2022-01-10 10:03:17,854 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:17,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024784279] [2022-01-10 10:03:17,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:17,854 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:17,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:17,869 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 10:03:17,869 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:17,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024784279] [2022-01-10 10:03:17,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024784279] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:17,870 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:17,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:17,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460247863] [2022-01-10 10:03:17,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:17,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:17,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:17,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:17,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:17,871 INFO L87 Difference]: Start difference. First operand 65541 states and 87043 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states 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 10:03:18,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:18,794 INFO L93 Difference]: Finished difference Result 150537 states and 200709 transitions. [2022-01-10 10:03:18,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:18,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2022-01-10 10:03:18,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:18,886 INFO L225 Difference]: With dead ends: 150537 [2022-01-10 10:03:18,886 INFO L226 Difference]: Without dead ends: 86023 [2022-01-10 10:03:18,921 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 10:03:18,921 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 63 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:18,921 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 223 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:18,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86023 states. [2022-01-10 10:03:19,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86023 to 86021. [2022-01-10 10:03:20,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86021 states, 86020 states have (on average 1.321401999534992) internal successors, (113667), 86020 states have internal predecessors, (113667), 0 states have call successors, (0), 0 states 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 10:03:20,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86021 states to 86021 states and 113667 transitions. [2022-01-10 10:03:20,162 INFO L78 Accepts]: Start accepts. Automaton has 86021 states and 113667 transitions. Word has length 32 [2022-01-10 10:03:20,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:20,162 INFO L470 AbstractCegarLoop]: Abstraction has 86021 states and 113667 transitions. [2022-01-10 10:03:20,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states 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 10:03:20,162 INFO L276 IsEmpty]: Start isEmpty. Operand 86021 states and 113667 transitions. [2022-01-10 10:03:20,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-10 10:03:20,361 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:20,361 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:03:20,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-10 10:03:20,361 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:20,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:20,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1852091751, now seen corresponding path program 1 times [2022-01-10 10:03:20,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:20,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753322648] [2022-01-10 10:03:20,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:20,362 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:20,379 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 10:03:20,379 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:20,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753322648] [2022-01-10 10:03:20,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753322648] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:20,379 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:20,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:20,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890506551] [2022-01-10 10:03:20,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:20,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:20,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:20,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:20,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:20,380 INFO L87 Difference]: Start difference. First operand 86021 states and 113667 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states 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 10:03:21,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:21,139 INFO L93 Difference]: Finished difference Result 129033 states and 169989 transitions. [2022-01-10 10:03:21,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:21,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2022-01-10 10:03:21,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:21,232 INFO L225 Difference]: With dead ends: 129033 [2022-01-10 10:03:21,233 INFO L226 Difference]: Without dead ends: 87047 [2022-01-10 10:03:21,263 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 10:03:21,264 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 65 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:21,264 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 200 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:21,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87047 states. [2022-01-10 10:03:22,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87047 to 87045. [2022-01-10 10:03:22,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87045 states, 87044 states have (on average 1.3058568080511006) internal successors, (113667), 87044 states have internal predecessors, (113667), 0 states have call successors, (0), 0 states 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 10:03:22,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87045 states to 87045 states and 113667 transitions. [2022-01-10 10:03:22,649 INFO L78 Accepts]: Start accepts. Automaton has 87045 states and 113667 transitions. Word has length 33 [2022-01-10 10:03:22,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:22,650 INFO L470 AbstractCegarLoop]: Abstraction has 87045 states and 113667 transitions. [2022-01-10 10:03:22,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states 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 10:03:22,650 INFO L276 IsEmpty]: Start isEmpty. Operand 87045 states and 113667 transitions. [2022-01-10 10:03:22,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-10 10:03:22,699 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:22,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] [2022-01-10 10:03:22,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-10 10:03:22,700 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:22,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:22,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1598403674, now seen corresponding path program 1 times [2022-01-10 10:03:22,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:22,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324573230] [2022-01-10 10:03:22,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:22,701 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:22,714 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 10:03:22,715 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:22,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324573230] [2022-01-10 10:03:22,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324573230] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:22,715 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:22,715 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:22,715 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640222075] [2022-01-10 10:03:22,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:22,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:22,715 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:22,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:22,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:22,716 INFO L87 Difference]: Start difference. First operand 87045 states and 113667 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states 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 10:03:23,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:23,924 INFO L93 Difference]: Finished difference Result 147465 states and 196613 transitions. [2022-01-10 10:03:23,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:23,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2022-01-10 10:03:23,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:24,130 INFO L225 Difference]: With dead ends: 147465 [2022-01-10 10:03:24,131 INFO L226 Difference]: Without dead ends: 147463 [2022-01-10 10:03:24,156 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 10:03:24,158 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 40 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:24,158 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 165 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:24,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147463 states. [2022-01-10 10:03:25,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147463 to 131077. [2022-01-10 10:03:25,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131077 states, 131076 states have (on average 1.2656092648539778) internal successors, (165891), 131076 states have internal predecessors, (165891), 0 states have call successors, (0), 0 states 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 10:03:26,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131077 states to 131077 states and 165891 transitions. [2022-01-10 10:03:26,091 INFO L78 Accepts]: Start accepts. Automaton has 131077 states and 165891 transitions. Word has length 33 [2022-01-10 10:03:26,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:26,091 INFO L470 AbstractCegarLoop]: Abstraction has 131077 states and 165891 transitions. [2022-01-10 10:03:26,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states 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 10:03:26,091 INFO L276 IsEmpty]: Start isEmpty. Operand 131077 states and 165891 transitions. [2022-01-10 10:03:26,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-10 10:03:26,160 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:26,161 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] [2022-01-10 10:03:26,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-10 10:03:26,161 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:26,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:26,161 INFO L85 PathProgramCache]: Analyzing trace with hash 601331321, now seen corresponding path program 1 times [2022-01-10 10:03:26,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:26,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265416071] [2022-01-10 10:03:26,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:26,161 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:26,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:26,174 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 10:03:26,175 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:26,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265416071] [2022-01-10 10:03:26,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265416071] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:26,175 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:26,175 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:26,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426620081] [2022-01-10 10:03:26,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:26,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:26,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:26,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:26,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:26,176 INFO L87 Difference]: Start difference. First operand 131077 states and 165891 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states 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 10:03:27,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:27,705 INFO L93 Difference]: Finished difference Result 299017 states and 378885 transitions. [2022-01-10 10:03:27,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:27,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2022-01-10 10:03:27,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:27,901 INFO L225 Difference]: With dead ends: 299017 [2022-01-10 10:03:27,901 INFO L226 Difference]: Without dead ends: 169991 [2022-01-10 10:03:27,977 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 10:03:27,977 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 62 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:27,977 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 224 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:28,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169991 states. [2022-01-10 10:03:30,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169991 to 169989. [2022-01-10 10:03:30,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169989 states, 169988 states have (on average 1.253000211779655) internal successors, (212995), 169988 states have internal predecessors, (212995), 0 states have call successors, (0), 0 states 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 10:03:30,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169989 states to 169989 states and 212995 transitions. [2022-01-10 10:03:30,733 INFO L78 Accepts]: Start accepts. Automaton has 169989 states and 212995 transitions. Word has length 33 [2022-01-10 10:03:30,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:30,733 INFO L470 AbstractCegarLoop]: Abstraction has 169989 states and 212995 transitions. [2022-01-10 10:03:30,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states 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 10:03:30,734 INFO L276 IsEmpty]: Start isEmpty. Operand 169989 states and 212995 transitions. [2022-01-10 10:03:30,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 10:03:30,803 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:30,803 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] [2022-01-10 10:03:30,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-10 10:03:30,803 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:30,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:30,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1989060191, now seen corresponding path program 1 times [2022-01-10 10:03:30,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:30,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917559562] [2022-01-10 10:03:30,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:30,804 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:30,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:30,824 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 10:03:30,824 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:30,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917559562] [2022-01-10 10:03:30,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917559562] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:30,824 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:30,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:30,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15888613] [2022-01-10 10:03:30,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:30,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:30,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:30,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:30,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:30,825 INFO L87 Difference]: Start difference. First operand 169989 states and 212995 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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 10:03:32,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:32,454 INFO L93 Difference]: Finished difference Result 254985 states and 318469 transitions. [2022-01-10 10:03:32,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:32,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2022-01-10 10:03:32,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:32,646 INFO L225 Difference]: With dead ends: 254985 [2022-01-10 10:03:32,646 INFO L226 Difference]: Without dead ends: 172039 [2022-01-10 10:03:32,690 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 10:03:32,691 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 64 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:32,691 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 196 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:32,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172039 states. [2022-01-10 10:03:34,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172039 to 172037. [2022-01-10 10:03:35,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172037 states, 172036 states have (on average 1.2380838894184938) internal successors, (212995), 172036 states have internal predecessors, (212995), 0 states have call successors, (0), 0 states 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 10:03:35,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172037 states to 172037 states and 212995 transitions. [2022-01-10 10:03:35,244 INFO L78 Accepts]: Start accepts. Automaton has 172037 states and 212995 transitions. Word has length 34 [2022-01-10 10:03:35,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:35,245 INFO L470 AbstractCegarLoop]: Abstraction has 172037 states and 212995 transitions. [2022-01-10 10:03:35,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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 10:03:35,245 INFO L276 IsEmpty]: Start isEmpty. Operand 172037 states and 212995 transitions. [2022-01-10 10:03:35,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 10:03:35,502 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:35,502 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] [2022-01-10 10:03:35,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-10 10:03:35,502 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:35,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:35,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1461435234, now seen corresponding path program 1 times [2022-01-10 10:03:35,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:35,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789708535] [2022-01-10 10:03:35,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:35,503 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:35,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:35,520 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 10:03:35,520 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:35,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789708535] [2022-01-10 10:03:35,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789708535] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:35,521 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:35,521 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:35,521 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562232867] [2022-01-10 10:03:35,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:35,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:35,521 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:35,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:35,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:35,521 INFO L87 Difference]: Start difference. First operand 172037 states and 212995 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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 10:03:37,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:37,784 INFO L93 Difference]: Finished difference Result 286729 states and 360453 transitions. [2022-01-10 10:03:37,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:37,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2022-01-10 10:03:37,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:38,180 INFO L225 Difference]: With dead ends: 286729 [2022-01-10 10:03:38,180 INFO L226 Difference]: Without dead ends: 286727 [2022-01-10 10:03:38,226 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 10:03:38,228 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 37 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:38,228 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 163 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:38,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286727 states. [2022-01-10 10:03:41,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286727 to 262149. [2022-01-10 10:03:41,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262149 states, 262148 states have (on average 1.2031180859667059) internal successors, (315395), 262148 states have internal predecessors, (315395), 0 states have call successors, (0), 0 states 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 10:03:42,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262149 states to 262149 states and 315395 transitions. [2022-01-10 10:03:42,044 INFO L78 Accepts]: Start accepts. Automaton has 262149 states and 315395 transitions. Word has length 34 [2022-01-10 10:03:42,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:42,044 INFO L470 AbstractCegarLoop]: Abstraction has 262149 states and 315395 transitions. [2022-01-10 10:03:42,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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 10:03:42,044 INFO L276 IsEmpty]: Start isEmpty. Operand 262149 states and 315395 transitions. [2022-01-10 10:03:42,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 10:03:42,475 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:42,475 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] [2022-01-10 10:03:42,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-10 10:03:42,475 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:42,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:42,475 INFO L85 PathProgramCache]: Analyzing trace with hash 464362881, now seen corresponding path program 1 times [2022-01-10 10:03:42,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:42,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564840740] [2022-01-10 10:03:42,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:42,476 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:42,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:42,491 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 10:03:42,491 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:42,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564840740] [2022-01-10 10:03:42,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564840740] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:42,491 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:42,491 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:42,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601610162] [2022-01-10 10:03:42,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:42,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:42,492 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:42,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:42,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:42,492 INFO L87 Difference]: Start difference. First operand 262149 states and 315395 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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 10:03:45,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:45,942 INFO L93 Difference]: Finished difference Result 593929 states and 712709 transitions. [2022-01-10 10:03:45,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:45,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2022-01-10 10:03:45,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:46,395 INFO L225 Difference]: With dead ends: 593929 [2022-01-10 10:03:46,395 INFO L226 Difference]: Without dead ends: 335879 [2022-01-10 10:03:46,509 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 10:03:46,510 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 61 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:46,510 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 225 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:46,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335879 states. [2022-01-10 10:03:51,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335879 to 335877. [2022-01-10 10:03:51,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335877 states, 335876 states have (on average 1.1829216734747348) internal successors, (397315), 335876 states have internal predecessors, (397315), 0 states have call successors, (0), 0 states 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 10:03:51,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335877 states to 335877 states and 397315 transitions. [2022-01-10 10:03:51,908 INFO L78 Accepts]: Start accepts. Automaton has 335877 states and 397315 transitions. Word has length 34 [2022-01-10 10:03:51,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:51,908 INFO L470 AbstractCegarLoop]: Abstraction has 335877 states and 397315 transitions. [2022-01-10 10:03:51,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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 10:03:51,908 INFO L276 IsEmpty]: Start isEmpty. Operand 335877 states and 397315 transitions. [2022-01-10 10:03:52,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 10:03:52,084 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:52,084 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:03:52,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-10 10:03:52,084 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:52,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:52,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1940114411, now seen corresponding path program 1 times [2022-01-10 10:03:52,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:52,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311725074] [2022-01-10 10:03:52,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:52,085 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:52,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:52,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 10:03:52,108 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:52,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311725074] [2022-01-10 10:03:52,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311725074] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:52,108 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:52,108 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:52,108 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042059795] [2022-01-10 10:03:52,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:52,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:52,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:52,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:52,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:52,109 INFO L87 Difference]: Start difference. First operand 335877 states and 397315 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:55,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:55,229 INFO L93 Difference]: Finished difference Result 503817 states and 593925 transitions. [2022-01-10 10:03:55,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:55,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-01-10 10:03:55,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:55,714 INFO L225 Difference]: With dead ends: 503817 [2022-01-10 10:03:55,714 INFO L226 Difference]: Without dead ends: 339975 [2022-01-10 10:03:55,795 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 10:03:55,796 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 63 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:55,798 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 192 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:55,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339975 states. [2022-01-10 10:04:00,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339975 to 339973. [2022-01-10 10:04:00,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339973 states, 339972 states have (on average 1.1686697728048192) internal successors, (397315), 339972 states have internal predecessors, (397315), 0 states have call successors, (0), 0 states 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 10:04:01,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339973 states to 339973 states and 397315 transitions. [2022-01-10 10:04:01,217 INFO L78 Accepts]: Start accepts. Automaton has 339973 states and 397315 transitions. Word has length 35 [2022-01-10 10:04:01,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:04:01,217 INFO L470 AbstractCegarLoop]: Abstraction has 339973 states and 397315 transitions. [2022-01-10 10:04:01,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:04:01,217 INFO L276 IsEmpty]: Start isEmpty. Operand 339973 states and 397315 transitions. [2022-01-10 10:04:01,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 10:04:01,414 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:04:01,415 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:04:01,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-10 10:04:01,415 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:04:01,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:04:01,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1510381014, now seen corresponding path program 1 times [2022-01-10 10:04:01,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:04:01,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490089690] [2022-01-10 10:04:01,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:04:01,416 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:04:01,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:04:01,432 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 10:04:01,432 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:04:01,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490089690] [2022-01-10 10:04:01,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490089690] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:04:01,432 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:04:01,432 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:04:01,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615575128] [2022-01-10 10:04:01,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:04:01,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:04:01,433 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:04:01,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:04:01,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:04:01,434 INFO L87 Difference]: Start difference. First operand 339973 states and 397315 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:04:05,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:04:05,995 INFO L93 Difference]: Finished difference Result 557065 states and 655365 transitions. [2022-01-10 10:04:05,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:04:05,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-01-10 10:04:05,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:04:06,973 INFO L225 Difference]: With dead ends: 557065 [2022-01-10 10:04:06,973 INFO L226 Difference]: Without dead ends: 557063 [2022-01-10 10:04:07,037 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 10:04:07,038 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 34 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:04:07,038 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 161 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:04:07,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557063 states.