/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf -i ../../../trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 01:47:46,594 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 01:47:46,596 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 01:47:46,666 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 01:47:46,666 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 01:47:46,670 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 01:47:46,671 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 01:47:46,672 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 01:47:46,673 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 01:47:46,673 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 01:47:46,676 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 01:47:46,678 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 01:47:46,679 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 01:47:46,683 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 01:47:46,684 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 01:47:46,685 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 01:47:46,685 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 01:47:46,686 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 01:47:46,687 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 01:47:46,688 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 01:47:46,693 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 01:47:46,694 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 01:47:46,698 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 01:47:46,698 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 01:47:46,700 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 01:47:46,700 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 01:47:46,700 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 01:47:46,701 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 01:47:46,701 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 01:47:46,701 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 01:47:46,702 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 01:47:46,702 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 01:47:46,702 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 01:47:46,703 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 01:47:46,703 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 01:47:46,704 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 01:47:46,704 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 01:47:46,704 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 01:47:46,704 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 01:47:46,705 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 01:47:46,705 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 01:47:46,710 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-11 01:47:46,733 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 01:47:46,733 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 01:47:46,733 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 01:47:46,733 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 01:47:46,734 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 01:47:46,734 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 01:47:46,734 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 01:47:46,734 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 01:47:46,734 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 01:47:46,734 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 01:47:46,734 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 01:47:46,735 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 01:47:46,735 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 01:47:46,735 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 01:47:46,735 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 01:47:46,739 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 01:47:46,739 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 01:47:46,739 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 01:47:46,739 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 01:47:46,739 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 01:47:46,739 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 01:47:46,739 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 01:47:46,740 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 01:47:46,740 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 01:47:46,740 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 01:47:46,740 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 01:47:46,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 01:47:46,740 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 01:47:46,741 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 01:47:46,741 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 01:47:46,741 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 01:47:46,741 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 01:47:46,742 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 01:47:46,742 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-11 01:47:46,936 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 01:47:46,951 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 01:47:46,952 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 01:47:46,953 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 01:47:46,955 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 01:47:46,956 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-1.c [2022-01-11 01:47:47,009 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6411d81f/c7265e88497d4eb8be8d59921d188374/FLAG2558c6275 [2022-01-11 01:47:47,380 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 01:47:47,380 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-1.c [2022-01-11 01:47:47,389 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6411d81f/c7265e88497d4eb8be8d59921d188374/FLAG2558c6275 [2022-01-11 01:47:47,402 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6411d81f/c7265e88497d4eb8be8d59921d188374 [2022-01-11 01:47:47,403 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 01:47:47,404 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 01:47:47,405 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 01:47:47,405 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 01:47:47,417 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 01:47:47,417 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 01:47:47" (1/1) ... [2022-01-11 01:47:47,418 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40c82ae8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:47, skipping insertion in model container [2022-01-11 01:47:47,418 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 01:47:47" (1/1) ... [2022-01-11 01:47:47,422 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 01:47:47,488 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 01:47:47,605 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-1.c[913,926] [2022-01-11 01:47:47,663 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-1.c[5977,5990] [2022-01-11 01:47:47,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 01:47:47,728 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 01:47:47,736 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-1.c[913,926] [2022-01-11 01:47:47,744 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-1.c[5977,5990] [2022-01-11 01:47:47,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 01:47:47,810 INFO L208 MainTranslator]: Completed translation [2022-01-11 01:47:47,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:47 WrapperNode [2022-01-11 01:47:47,810 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 01:47:47,811 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 01:47:47,811 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 01:47:47,811 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 01:47:47,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:47" (1/1) ... [2022-01-11 01:47:47,839 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:47" (1/1) ... [2022-01-11 01:47:47,917 INFO L137 Inliner]: procedures = 73, calls = 85, calls flagged for inlining = 80, calls inlined = 289, statements flattened = 4399 [2022-01-11 01:47:47,917 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 01:47:47,918 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 01:47:47,918 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 01:47:47,918 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 01:47:47,923 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:47" (1/1) ... [2022-01-11 01:47:47,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:47" (1/1) ... [2022-01-11 01:47:47,931 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:47" (1/1) ... [2022-01-11 01:47:47,931 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:47" (1/1) ... [2022-01-11 01:47:47,960 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:47" (1/1) ... [2022-01-11 01:47:47,983 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:47" (1/1) ... [2022-01-11 01:47:47,988 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:47" (1/1) ... [2022-01-11 01:47:47,998 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 01:47:47,999 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 01:47:47,999 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 01:47:47,999 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 01:47:47,999 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:47" (1/1) ... [2022-01-11 01:47:48,004 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 01:47:48,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 01:47:48,037 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-11 01:47:48,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-11 01:47:48,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 01:47:48,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 01:47:48,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 01:47:48,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 01:47:48,151 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 01:47:48,152 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 01:47:49,872 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 01:47:49,885 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 01:47:49,885 INFO L299 CfgBuilder]: Removed 19 assume(true) statements. [2022-01-11 01:47:49,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:47:49 BoogieIcfgContainer [2022-01-11 01:47:49,887 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 01:47:49,888 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 01:47:49,888 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 01:47:49,889 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 01:47:49,891 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:47:49" (1/1) ... [2022-01-11 01:47:50,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 01:47:50 BasicIcfg [2022-01-11 01:47:50,142 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 01:47:50,143 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 01:47:50,144 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 01:47:50,145 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 01:47:50,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 01:47:47" (1/4) ... [2022-01-11 01:47:50,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d80ab76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 01:47:50, skipping insertion in model container [2022-01-11 01:47:50,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:47" (2/4) ... [2022-01-11 01:47:50,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d80ab76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 01:47:50, skipping insertion in model container [2022-01-11 01:47:50,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:47:49" (3/4) ... [2022-01-11 01:47:50,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d80ab76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 01:47:50, skipping insertion in model container [2022-01-11 01:47:50,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 01:47:50" (4/4) ... [2022-01-11 01:47:50,147 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.12.cil-1.cTransformedIcfg [2022-01-11 01:47:50,150 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 01:47:50,150 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-01-11 01:47:50,179 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 01:47:50,192 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-11 01:47:50,192 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-11 01:47:50,222 INFO L276 IsEmpty]: Start isEmpty. Operand has 1879 states, 1874 states have (on average 1.503735325506937) internal successors, (2818), 1878 states have internal predecessors, (2818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:50,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-11 01:47:50,228 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:50,229 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:47:50,229 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:50,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:50,236 INFO L85 PathProgramCache]: Analyzing trace with hash -176383202, now seen corresponding path program 1 times [2022-01-11 01:47:50,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:50,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001222288] [2022-01-11 01:47:50,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:50,243 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:50,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:50,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:50,508 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:50,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001222288] [2022-01-11 01:47:50,509 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001222288] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:50,509 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:50,509 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:50,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930745164] [2022-01-11 01:47:50,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:50,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:50,530 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:50,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:50,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:50,565 INFO L87 Difference]: Start difference. First operand has 1879 states, 1874 states have (on average 1.503735325506937) internal successors, (2818), 1878 states have internal predecessors, (2818), 0 states have call successors, (0), 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 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:50,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:50,780 INFO L93 Difference]: Finished difference Result 3656 states and 5461 transitions. [2022-01-11 01:47:50,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:50,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2022-01-11 01:47:50,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:50,805 INFO L225 Difference]: With dead ends: 3656 [2022-01-11 01:47:50,806 INFO L226 Difference]: Without dead ends: 1933 [2022-01-11 01:47:50,815 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-11 01:47:50,820 INFO L933 BasicCegarLoop]: 2782 mSDtfsCounter, 2743 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2743 SdHoareTripleChecker+Valid, 2876 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:50,825 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2743 Valid, 2876 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:50,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2022-01-11 01:47:50,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 1912. [2022-01-11 01:47:50,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1912 states, 1908 states have (on average 1.480083857442348) internal successors, (2824), 1911 states have internal predecessors, (2824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:50,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1912 states to 1912 states and 2824 transitions. [2022-01-11 01:47:50,922 INFO L78 Accepts]: Start accepts. Automaton has 1912 states and 2824 transitions. Word has length 36 [2022-01-11 01:47:50,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:50,923 INFO L470 AbstractCegarLoop]: Abstraction has 1912 states and 2824 transitions. [2022-01-11 01:47:50,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:50,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 2824 transitions. [2022-01-11 01:47:50,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-11 01:47:50,928 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:50,928 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:47:50,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 01:47:50,928 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:50,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:50,931 INFO L85 PathProgramCache]: Analyzing trace with hash -411400193, now seen corresponding path program 1 times [2022-01-11 01:47:50,931 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:50,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968759640] [2022-01-11 01:47:50,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:50,932 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:50,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:51,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:51,014 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:51,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968759640] [2022-01-11 01:47:51,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968759640] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:51,015 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:51,015 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:51,015 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483495790] [2022-01-11 01:47:51,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:51,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:51,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:51,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:51,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:51,017 INFO L87 Difference]: Start difference. First operand 1912 states and 2824 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:51,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:51,069 INFO L93 Difference]: Finished difference Result 2081 states and 3059 transitions. [2022-01-11 01:47:51,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:51,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-01-11 01:47:51,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:51,075 INFO L225 Difference]: With dead ends: 2081 [2022-01-11 01:47:51,075 INFO L226 Difference]: Without dead ends: 1970 [2022-01-11 01:47:51,077 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-11 01:47:51,078 INFO L933 BasicCegarLoop]: 2762 mSDtfsCounter, 60 mSDsluCounter, 2723 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 5485 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:51,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 5485 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:51,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2022-01-11 01:47:51,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1965. [2022-01-11 01:47:51,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1965 states, 1961 states have (on average 1.4773074961754207) internal successors, (2897), 1964 states have internal predecessors, (2897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:51,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 2897 transitions. [2022-01-11 01:47:51,113 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 2897 transitions. Word has length 37 [2022-01-11 01:47:51,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:51,113 INFO L470 AbstractCegarLoop]: Abstraction has 1965 states and 2897 transitions. [2022-01-11 01:47:51,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:51,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 2897 transitions. [2022-01-11 01:47:51,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-11 01:47:51,119 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:51,119 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:47:51,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 01:47:51,123 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:51,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:51,124 INFO L85 PathProgramCache]: Analyzing trace with hash -565697026, now seen corresponding path program 1 times [2022-01-11 01:47:51,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:51,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024267009] [2022-01-11 01:47:51,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:51,125 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:51,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:51,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:51,206 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:51,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024267009] [2022-01-11 01:47:51,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024267009] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:51,207 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:51,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:51,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382807227] [2022-01-11 01:47:51,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:51,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:51,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:51,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:51,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:51,209 INFO L87 Difference]: Start difference. First operand 1965 states and 2897 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:51,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:51,263 INFO L93 Difference]: Finished difference Result 2282 states and 3333 transitions. [2022-01-11 01:47:51,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:51,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-01-11 01:47:51,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:51,269 INFO L225 Difference]: With dead ends: 2282 [2022-01-11 01:47:51,269 INFO L226 Difference]: Without dead ends: 2118 [2022-01-11 01:47:51,272 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-11 01:47:51,274 INFO L933 BasicCegarLoop]: 2785 mSDtfsCounter, 2734 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2734 SdHoareTripleChecker+Valid, 2873 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:51,275 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2734 Valid, 2873 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:51,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2118 states. [2022-01-11 01:47:51,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2118 to 2096. [2022-01-11 01:47:51,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2096 states, 2092 states have (on average 1.4689292543021033) internal successors, (3073), 2095 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:51,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2096 states to 2096 states and 3073 transitions. [2022-01-11 01:47:51,357 INFO L78 Accepts]: Start accepts. Automaton has 2096 states and 3073 transitions. Word has length 37 [2022-01-11 01:47:51,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:51,357 INFO L470 AbstractCegarLoop]: Abstraction has 2096 states and 3073 transitions. [2022-01-11 01:47:51,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:51,357 INFO L276 IsEmpty]: Start isEmpty. Operand 2096 states and 3073 transitions. [2022-01-11 01:47:51,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-11 01:47:51,359 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:51,359 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:47:51,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 01:47:51,359 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:51,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:51,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1638365307, now seen corresponding path program 1 times [2022-01-11 01:47:51,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:51,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148649719] [2022-01-11 01:47:51,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:51,361 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:51,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:51,422 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:51,423 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:51,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148649719] [2022-01-11 01:47:51,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148649719] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:51,423 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:51,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:51,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127482845] [2022-01-11 01:47:51,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:51,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:51,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:51,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:51,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:51,426 INFO L87 Difference]: Start difference. First operand 2096 states and 3073 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:51,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:51,485 INFO L93 Difference]: Finished difference Result 2547 states and 3680 transitions. [2022-01-11 01:47:51,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:51,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-01-11 01:47:51,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:51,493 INFO L225 Difference]: With dead ends: 2547 [2022-01-11 01:47:51,493 INFO L226 Difference]: Without dead ends: 2252 [2022-01-11 01:47:51,495 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-11 01:47:51,500 INFO L933 BasicCegarLoop]: 2815 mSDtfsCounter, 48 mSDsluCounter, 2750 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 5565 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:51,501 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 5565 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:51,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2252 states. [2022-01-11 01:47:51,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2252 to 2252. [2022-01-11 01:47:51,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2252 states, 2248 states have (on average 1.4506227758007118) internal successors, (3261), 2251 states have internal predecessors, (3261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:51,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2252 states to 2252 states and 3261 transitions. [2022-01-11 01:47:51,540 INFO L78 Accepts]: Start accepts. Automaton has 2252 states and 3261 transitions. Word has length 51 [2022-01-11 01:47:51,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:51,540 INFO L470 AbstractCegarLoop]: Abstraction has 2252 states and 3261 transitions. [2022-01-11 01:47:51,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:51,540 INFO L276 IsEmpty]: Start isEmpty. Operand 2252 states and 3261 transitions. [2022-01-11 01:47:51,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-11 01:47:51,541 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:51,541 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:47:51,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 01:47:51,542 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:51,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:51,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1481808314, now seen corresponding path program 1 times [2022-01-11 01:47:51,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:51,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50118698] [2022-01-11 01:47:51,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:51,543 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:51,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:51,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:51,588 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:51,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50118698] [2022-01-11 01:47:51,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50118698] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:51,588 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:51,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:51,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772949473] [2022-01-11 01:47:51,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:51,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:51,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:51,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:51,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:51,589 INFO L87 Difference]: Start difference. First operand 2252 states and 3261 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:51,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:51,666 INFO L93 Difference]: Finished difference Result 2725 states and 3877 transitions. [2022-01-11 01:47:51,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:51,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-01-11 01:47:51,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:51,673 INFO L225 Difference]: With dead ends: 2725 [2022-01-11 01:47:51,673 INFO L226 Difference]: Without dead ends: 2360 [2022-01-11 01:47:51,674 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-11 01:47:51,675 INFO L933 BasicCegarLoop]: 2762 mSDtfsCounter, 2708 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2708 SdHoareTripleChecker+Valid, 2850 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:51,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2708 Valid, 2850 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:51,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2360 states. [2022-01-11 01:47:51,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2360 to 2360. [2022-01-11 01:47:51,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2360 states, 2356 states have (on average 1.4384550084889642) internal successors, (3389), 2359 states have internal predecessors, (3389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:51,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2360 states to 2360 states and 3389 transitions. [2022-01-11 01:47:51,751 INFO L78 Accepts]: Start accepts. Automaton has 2360 states and 3389 transitions. Word has length 55 [2022-01-11 01:47:51,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:51,751 INFO L470 AbstractCegarLoop]: Abstraction has 2360 states and 3389 transitions. [2022-01-11 01:47:51,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:51,751 INFO L276 IsEmpty]: Start isEmpty. Operand 2360 states and 3389 transitions. [2022-01-11 01:47:51,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-11 01:47:51,752 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:51,752 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:47:51,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 01:47:51,752 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:51,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:51,753 INFO L85 PathProgramCache]: Analyzing trace with hash -972314080, now seen corresponding path program 1 times [2022-01-11 01:47:51,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:51,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844337150] [2022-01-11 01:47:51,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:51,753 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:51,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:51,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:51,809 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:51,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844337150] [2022-01-11 01:47:51,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844337150] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:51,809 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:51,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:47:51,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041030611] [2022-01-11 01:47:51,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:51,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:47:51,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:51,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:47:51,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:47:51,811 INFO L87 Difference]: Start difference. First operand 2360 states and 3389 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:51,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:51,926 INFO L93 Difference]: Finished difference Result 3443 states and 4793 transitions. [2022-01-11 01:47:51,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:47:51,926 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2022-01-11 01:47:51,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:51,934 INFO L225 Difference]: With dead ends: 3443 [2022-01-11 01:47:51,934 INFO L226 Difference]: Without dead ends: 3020 [2022-01-11 01:47:51,935 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 01:47:51,935 INFO L933 BasicCegarLoop]: 2835 mSDtfsCounter, 302 mSDsluCounter, 8423 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 11258 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:51,936 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [302 Valid, 11258 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:51,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3020 states. [2022-01-11 01:47:51,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3020 to 2384. [2022-01-11 01:47:52,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2384 states, 2380 states have (on average 1.4323529411764706) internal successors, (3409), 2383 states have internal predecessors, (3409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:52,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2384 states to 2384 states and 3409 transitions. [2022-01-11 01:47:52,009 INFO L78 Accepts]: Start accepts. Automaton has 2384 states and 3409 transitions. Word has length 56 [2022-01-11 01:47:52,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:52,010 INFO L470 AbstractCegarLoop]: Abstraction has 2384 states and 3409 transitions. [2022-01-11 01:47:52,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:52,010 INFO L276 IsEmpty]: Start isEmpty. Operand 2384 states and 3409 transitions. [2022-01-11 01:47:52,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-11 01:47:52,011 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:52,011 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:47:52,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 01:47:52,011 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:52,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:52,012 INFO L85 PathProgramCache]: Analyzing trace with hash -621514143, now seen corresponding path program 1 times [2022-01-11 01:47:52,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:52,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077536780] [2022-01-11 01:47:52,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:52,012 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:52,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:52,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:52,062 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:52,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077536780] [2022-01-11 01:47:52,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077536780] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:52,062 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:52,062 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:47:52,062 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026954334] [2022-01-11 01:47:52,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:52,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:47:52,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:52,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:47:52,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:47:52,063 INFO L87 Difference]: Start difference. First operand 2384 states and 3409 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:52,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:52,187 INFO L93 Difference]: Finished difference Result 3173 states and 4419 transitions. [2022-01-11 01:47:52,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:47:52,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2022-01-11 01:47:52,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:52,195 INFO L225 Difference]: With dead ends: 3173 [2022-01-11 01:47:52,195 INFO L226 Difference]: Without dead ends: 2675 [2022-01-11 01:47:52,196 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 01:47:52,197 INFO L933 BasicCegarLoop]: 2812 mSDtfsCounter, 276 mSDsluCounter, 8392 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 11204 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:52,197 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 11204 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:52,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2675 states. [2022-01-11 01:47:52,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2675 to 2282. [2022-01-11 01:47:52,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2282 states, 2278 states have (on average 1.4389815627743634) internal successors, (3278), 2281 states have internal predecessors, (3278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:52,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 2282 states and 3278 transitions. [2022-01-11 01:47:52,254 INFO L78 Accepts]: Start accepts. Automaton has 2282 states and 3278 transitions. Word has length 56 [2022-01-11 01:47:52,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:52,254 INFO L470 AbstractCegarLoop]: Abstraction has 2282 states and 3278 transitions. [2022-01-11 01:47:52,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:52,255 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 3278 transitions. [2022-01-11 01:47:52,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-11 01:47:52,255 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:52,256 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:47:52,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 01:47:52,256 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:52,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:52,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1596273601, now seen corresponding path program 1 times [2022-01-11 01:47:52,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:52,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706876092] [2022-01-11 01:47:52,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:52,257 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:52,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:52,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:52,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:52,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706876092] [2022-01-11 01:47:52,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706876092] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:52,322 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:52,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 01:47:52,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315001590] [2022-01-11 01:47:52,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:52,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 01:47:52,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:52,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 01:47:52,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 01:47:52,323 INFO L87 Difference]: Start difference. First operand 2282 states and 3278 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:52,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:52,454 INFO L93 Difference]: Finished difference Result 2332 states and 3338 transitions. [2022-01-11 01:47:52,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 01:47:52,455 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2022-01-11 01:47:52,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:52,462 INFO L225 Difference]: With dead ends: 2332 [2022-01-11 01:47:52,462 INFO L226 Difference]: Without dead ends: 2330 [2022-01-11 01:47:52,463 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:47:52,463 INFO L933 BasicCegarLoop]: 2762 mSDtfsCounter, 5492 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5492 SdHoareTripleChecker+Valid, 2831 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:52,463 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5492 Valid, 2831 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:52,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2330 states. [2022-01-11 01:47:52,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2330 to 2280. [2022-01-11 01:47:52,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2280 states, 2277 states have (on average 1.438296003513395) internal successors, (3275), 2279 states have internal predecessors, (3275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:52,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 3275 transitions. [2022-01-11 01:47:52,557 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 3275 transitions. Word has length 56 [2022-01-11 01:47:52,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:52,558 INFO L470 AbstractCegarLoop]: Abstraction has 2280 states and 3275 transitions. [2022-01-11 01:47:52,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:52,558 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 3275 transitions. [2022-01-11 01:47:52,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-11 01:47:52,558 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:52,559 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:47:52,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 01:47:52,559 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:52,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:52,559 INFO L85 PathProgramCache]: Analyzing trace with hash -2055119878, now seen corresponding path program 1 times [2022-01-11 01:47:52,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:52,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850579254] [2022-01-11 01:47:52,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:52,560 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:52,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:52,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:52,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850579254] [2022-01-11 01:47:52,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850579254] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 01:47:52,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088824509] [2022-01-11 01:47:52,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:52,736 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 01:47:52,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 01:47:52,737 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 01:47:52,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-11 01:47:52,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:52,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-11 01:47:52,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 01:47:53,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:53,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 01:47:53,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:53,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088824509] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 01:47:53,320 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 01:47:53,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-11 01:47:53,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275910926] [2022-01-11 01:47:53,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 01:47:53,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-11 01:47:53,320 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:53,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-11 01:47:53,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-11 01:47:53,321 INFO L87 Difference]: Start difference. First operand 2280 states and 3275 transitions. Second operand has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:53,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:53,584 INFO L93 Difference]: Finished difference Result 3166 states and 4403 transitions. [2022-01-11 01:47:53,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-11 01:47:53,584 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 0 states have call successors, (0), 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 57 [2022-01-11 01:47:53,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:53,592 INFO L225 Difference]: With dead ends: 3166 [2022-01-11 01:47:53,592 INFO L226 Difference]: Without dead ends: 3164 [2022-01-11 01:47:53,593 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-11 01:47:53,593 INFO L933 BasicCegarLoop]: 2837 mSDtfsCounter, 8436 mSDsluCounter, 8751 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8436 SdHoareTripleChecker+Valid, 11588 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:53,593 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8436 Valid, 11588 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:53,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3164 states. [2022-01-11 01:47:53,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3164 to 2552. [2022-01-11 01:47:53,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2552 states, 2549 states have (on average 1.4233032561788936) internal successors, (3628), 2551 states have internal predecessors, (3628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:53,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 3628 transitions. [2022-01-11 01:47:53,729 INFO L78 Accepts]: Start accepts. Automaton has 2552 states and 3628 transitions. Word has length 57 [2022-01-11 01:47:53,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:53,730 INFO L470 AbstractCegarLoop]: Abstraction has 2552 states and 3628 transitions. [2022-01-11 01:47:53,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:53,731 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 3628 transitions. [2022-01-11 01:47:53,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-01-11 01:47:53,732 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:53,732 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:47:53,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-11 01:47:53,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 01:47:53,950 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:53,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:53,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1559204522, now seen corresponding path program 2 times [2022-01-11 01:47:53,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:53,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382650345] [2022-01-11 01:47:53,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:53,951 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:53,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:54,006 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:54,006 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:54,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382650345] [2022-01-11 01:47:54,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382650345] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:54,006 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:54,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:54,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152960867] [2022-01-11 01:47:54,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:54,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:54,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:54,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:54,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:54,008 INFO L87 Difference]: Start difference. First operand 2552 states and 3628 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:54,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:54,112 INFO L93 Difference]: Finished difference Result 3059 states and 4288 transitions. [2022-01-11 01:47:54,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:54,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2022-01-11 01:47:54,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:54,119 INFO L225 Difference]: With dead ends: 3059 [2022-01-11 01:47:54,119 INFO L226 Difference]: Without dead ends: 2463 [2022-01-11 01:47:54,121 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-11 01:47:54,121 INFO L933 BasicCegarLoop]: 2796 mSDtfsCounter, 2712 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2712 SdHoareTripleChecker+Valid, 2865 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:54,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2712 Valid, 2865 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:54,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2463 states. [2022-01-11 01:47:54,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2463 to 2437. [2022-01-11 01:47:54,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2437 states, 2434 states have (on average 1.4281018898931799) internal successors, (3476), 2436 states have internal predecessors, (3476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:54,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2437 states to 2437 states and 3476 transitions. [2022-01-11 01:47:54,253 INFO L78 Accepts]: Start accepts. Automaton has 2437 states and 3476 transitions. Word has length 72 [2022-01-11 01:47:54,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:54,253 INFO L470 AbstractCegarLoop]: Abstraction has 2437 states and 3476 transitions. [2022-01-11 01:47:54,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:54,253 INFO L276 IsEmpty]: Start isEmpty. Operand 2437 states and 3476 transitions. [2022-01-11 01:47:54,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-11 01:47:54,257 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:54,258 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:47:54,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 01:47:54,258 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:54,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:54,258 INFO L85 PathProgramCache]: Analyzing trace with hash 848611532, now seen corresponding path program 1 times [2022-01-11 01:47:54,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:54,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067133338] [2022-01-11 01:47:54,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:54,259 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:54,302 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 01:47:54,303 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:54,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067133338] [2022-01-11 01:47:54,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067133338] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:54,303 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:54,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:54,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250958365] [2022-01-11 01:47:54,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:54,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:54,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:54,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:54,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:54,304 INFO L87 Difference]: Start difference. First operand 2437 states and 3476 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:54,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:54,412 INFO L93 Difference]: Finished difference Result 3091 states and 4303 transitions. [2022-01-11 01:47:54,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:54,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2022-01-11 01:47:54,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:54,429 INFO L225 Difference]: With dead ends: 3091 [2022-01-11 01:47:54,429 INFO L226 Difference]: Without dead ends: 2455 [2022-01-11 01:47:54,430 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-11 01:47:54,431 INFO L933 BasicCegarLoop]: 2769 mSDtfsCounter, 2697 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2697 SdHoareTripleChecker+Valid, 2853 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:54,431 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2697 Valid, 2853 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:54,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2455 states. [2022-01-11 01:47:54,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2455 to 2437. [2022-01-11 01:47:54,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2437 states, 2434 states have (on average 1.419884963023829) internal successors, (3456), 2436 states have internal predecessors, (3456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:54,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2437 states to 2437 states and 3456 transitions. [2022-01-11 01:47:54,521 INFO L78 Accepts]: Start accepts. Automaton has 2437 states and 3456 transitions. Word has length 84 [2022-01-11 01:47:54,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:54,521 INFO L470 AbstractCegarLoop]: Abstraction has 2437 states and 3456 transitions. [2022-01-11 01:47:54,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:54,521 INFO L276 IsEmpty]: Start isEmpty. Operand 2437 states and 3456 transitions. [2022-01-11 01:47:54,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-01-11 01:47:54,522 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:54,522 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:47:54,522 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 01:47:54,523 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:54,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:54,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1399297825, now seen corresponding path program 1 times [2022-01-11 01:47:54,523 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:54,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242722643] [2022-01-11 01:47:54,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:54,523 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:54,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:54,560 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 01:47:54,561 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:54,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242722643] [2022-01-11 01:47:54,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242722643] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:54,561 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:54,561 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:54,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51751312] [2022-01-11 01:47:54,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:54,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:54,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:54,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:54,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:54,562 INFO L87 Difference]: Start difference. First operand 2437 states and 3456 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:54,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:54,672 INFO L93 Difference]: Finished difference Result 2701 states and 3774 transitions. [2022-01-11 01:47:54,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:54,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2022-01-11 01:47:54,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:54,676 INFO L225 Difference]: With dead ends: 2701 [2022-01-11 01:47:54,676 INFO L226 Difference]: Without dead ends: 1795 [2022-01-11 01:47:54,677 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-11 01:47:54,678 INFO L933 BasicCegarLoop]: 2795 mSDtfsCounter, 56 mSDsluCounter, 2727 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 5522 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:54,678 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 5522 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:54,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1795 states. [2022-01-11 01:47:54,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1795 to 1795. [2022-01-11 01:47:54,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1795 states, 1793 states have (on average 1.483547127718907) internal successors, (2660), 1794 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:54,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2660 transitions. [2022-01-11 01:47:54,745 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2660 transitions. Word has length 85 [2022-01-11 01:47:54,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:54,746 INFO L470 AbstractCegarLoop]: Abstraction has 1795 states and 2660 transitions. [2022-01-11 01:47:54,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:54,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2660 transitions. [2022-01-11 01:47:54,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-11 01:47:54,747 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:54,747 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:47:54,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 01:47:54,747 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:54,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:54,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1578430486, now seen corresponding path program 1 times [2022-01-11 01:47:54,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:54,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568081488] [2022-01-11 01:47:54,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:54,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:54,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:54,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:54,789 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:54,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568081488] [2022-01-11 01:47:54,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568081488] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:54,790 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:54,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:54,790 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095039533] [2022-01-11 01:47:54,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:54,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:54,791 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:54,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:54,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:54,791 INFO L87 Difference]: Start difference. First operand 1795 states and 2660 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:54,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:54,871 INFO L93 Difference]: Finished difference Result 3584 states and 5313 transitions. [2022-01-11 01:47:54,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:54,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2022-01-11 01:47:54,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:54,875 INFO L225 Difference]: With dead ends: 3584 [2022-01-11 01:47:54,875 INFO L226 Difference]: Without dead ends: 1795 [2022-01-11 01:47:54,877 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-11 01:47:54,878 INFO L933 BasicCegarLoop]: 2658 mSDtfsCounter, 2654 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2654 SdHoareTripleChecker+Valid, 2659 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:54,878 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2654 Valid, 2659 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:54,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1795 states. [2022-01-11 01:47:54,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1795 to 1795. [2022-01-11 01:47:54,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1795 states, 1793 states have (on average 1.482989403234802) internal successors, (2659), 1794 states have internal predecessors, (2659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:54,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2659 transitions. [2022-01-11 01:47:54,944 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2659 transitions. Word has length 165 [2022-01-11 01:47:54,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:54,944 INFO L470 AbstractCegarLoop]: Abstraction has 1795 states and 2659 transitions. [2022-01-11 01:47:54,945 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:54,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2659 transitions. [2022-01-11 01:47:54,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-11 01:47:54,945 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:54,946 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:47:54,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 01:47:54,946 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:54,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:54,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1971429431, now seen corresponding path program 1 times [2022-01-11 01:47:54,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:54,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32047939] [2022-01-11 01:47:54,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:54,947 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:54,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:54,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:54,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32047939] [2022-01-11 01:47:54,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32047939] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:54,987 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:54,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:54,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497338219] [2022-01-11 01:47:54,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:54,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:54,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:54,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:54,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:54,989 INFO L87 Difference]: Start difference. First operand 1795 states and 2659 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:55,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:55,053 INFO L93 Difference]: Finished difference Result 3575 states and 5294 transitions. [2022-01-11 01:47:55,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:55,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2022-01-11 01:47:55,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:55,056 INFO L225 Difference]: With dead ends: 3575 [2022-01-11 01:47:55,056 INFO L226 Difference]: Without dead ends: 1795 [2022-01-11 01:47:55,058 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-11 01:47:55,058 INFO L933 BasicCegarLoop]: 2657 mSDtfsCounter, 2644 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2644 SdHoareTripleChecker+Valid, 2658 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:55,058 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2644 Valid, 2658 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:55,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1795 states. [2022-01-11 01:47:55,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1795 to 1795. [2022-01-11 01:47:55,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1795 states, 1793 states have (on average 1.4824316787506973) internal successors, (2658), 1794 states have internal predecessors, (2658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:55,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2658 transitions. [2022-01-11 01:47:55,113 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2658 transitions. Word has length 165 [2022-01-11 01:47:55,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:55,113 INFO L470 AbstractCegarLoop]: Abstraction has 1795 states and 2658 transitions. [2022-01-11 01:47:55,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:55,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2658 transitions. [2022-01-11 01:47:55,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-11 01:47:55,114 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:55,114 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:47:55,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-11 01:47:55,115 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:55,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:55,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1248138998, now seen corresponding path program 1 times [2022-01-11 01:47:55,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:55,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936610017] [2022-01-11 01:47:55,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:55,115 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:55,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:55,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:55,161 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:55,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936610017] [2022-01-11 01:47:55,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936610017] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:55,161 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:55,161 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:55,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193103333] [2022-01-11 01:47:55,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:55,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:55,163 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:55,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:55,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:55,163 INFO L87 Difference]: Start difference. First operand 1795 states and 2658 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:55,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:55,313 INFO L93 Difference]: Finished difference Result 5108 states and 7543 transitions. [2022-01-11 01:47:55,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:55,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2022-01-11 01:47:55,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:55,318 INFO L225 Difference]: With dead ends: 5108 [2022-01-11 01:47:55,318 INFO L226 Difference]: Without dead ends: 3333 [2022-01-11 01:47:55,321 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:55,321 INFO L933 BasicCegarLoop]: 2652 mSDtfsCounter, 2501 mSDsluCounter, 2385 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2501 SdHoareTripleChecker+Valid, 5037 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:55,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2501 Valid, 5037 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:55,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3333 states. [2022-01-11 01:47:55,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3333 to 3329. [2022-01-11 01:47:55,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3329 states, 3327 states have (on average 1.4761045987376014) internal successors, (4911), 3328 states have internal predecessors, (4911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:55,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4911 transitions. [2022-01-11 01:47:55,433 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4911 transitions. Word has length 165 [2022-01-11 01:47:55,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:55,433 INFO L470 AbstractCegarLoop]: Abstraction has 3329 states and 4911 transitions. [2022-01-11 01:47:55,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:55,433 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4911 transitions. [2022-01-11 01:47:55,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-11 01:47:55,434 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:55,434 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:47:55,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-11 01:47:55,434 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:55,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:55,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1349110762, now seen corresponding path program 1 times [2022-01-11 01:47:55,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:55,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401665968] [2022-01-11 01:47:55,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:55,435 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:55,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:55,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:55,474 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:55,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401665968] [2022-01-11 01:47:55,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401665968] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:55,474 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:55,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:55,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947099592] [2022-01-11 01:47:55,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:55,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:55,475 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:55,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:55,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:55,475 INFO L87 Difference]: Start difference. First operand 3329 states and 4911 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:55,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:55,599 INFO L93 Difference]: Finished difference Result 6637 states and 9789 transitions. [2022-01-11 01:47:55,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:55,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2022-01-11 01:47:55,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:55,605 INFO L225 Difference]: With dead ends: 6637 [2022-01-11 01:47:55,605 INFO L226 Difference]: Without dead ends: 3329 [2022-01-11 01:47:55,609 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:55,610 INFO L933 BasicCegarLoop]: 2646 mSDtfsCounter, 2631 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2631 SdHoareTripleChecker+Valid, 2646 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:55,610 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2631 Valid, 2646 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:55,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2022-01-11 01:47:55,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3329. [2022-01-11 01:47:55,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3329 states, 3327 states have (on average 1.4737000300571086) internal successors, (4903), 3328 states have internal predecessors, (4903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:55,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4903 transitions. [2022-01-11 01:47:55,761 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4903 transitions. Word has length 165 [2022-01-11 01:47:55,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:55,761 INFO L470 AbstractCegarLoop]: Abstraction has 3329 states and 4903 transitions. [2022-01-11 01:47:55,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:55,761 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4903 transitions. [2022-01-11 01:47:55,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-11 01:47:55,762 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:55,762 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:47:55,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-11 01:47:55,762 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:55,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:55,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1060958966, now seen corresponding path program 1 times [2022-01-11 01:47:55,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:55,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236990934] [2022-01-11 01:47:55,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:55,763 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:55,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:55,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:55,797 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:55,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236990934] [2022-01-11 01:47:55,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236990934] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:55,797 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:55,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:55,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199307580] [2022-01-11 01:47:55,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:55,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:55,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:55,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:55,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:55,798 INFO L87 Difference]: Start difference. First operand 3329 states and 4903 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:55,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:55,914 INFO L93 Difference]: Finished difference Result 6636 states and 9772 transitions. [2022-01-11 01:47:55,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:55,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2022-01-11 01:47:55,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:55,920 INFO L225 Difference]: With dead ends: 6636 [2022-01-11 01:47:55,920 INFO L226 Difference]: Without dead ends: 3329 [2022-01-11 01:47:55,923 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:55,923 INFO L933 BasicCegarLoop]: 2641 mSDtfsCounter, 2625 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2625 SdHoareTripleChecker+Valid, 2641 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:55,923 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2625 Valid, 2641 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:55,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2022-01-11 01:47:56,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3329. [2022-01-11 01:47:56,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3329 states, 3327 states have (on average 1.4712954613766156) internal successors, (4895), 3328 states have internal predecessors, (4895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:56,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4895 transitions. [2022-01-11 01:47:56,034 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4895 transitions. Word has length 165 [2022-01-11 01:47:56,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:56,034 INFO L470 AbstractCegarLoop]: Abstraction has 3329 states and 4895 transitions. [2022-01-11 01:47:56,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:56,034 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4895 transitions. [2022-01-11 01:47:56,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-11 01:47:56,035 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:56,035 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:47:56,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-11 01:47:56,035 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:56,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:56,036 INFO L85 PathProgramCache]: Analyzing trace with hash 307419158, now seen corresponding path program 1 times [2022-01-11 01:47:56,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:56,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766689253] [2022-01-11 01:47:56,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:56,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:56,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:56,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-11 01:47:56,069 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:56,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766689253] [2022-01-11 01:47:56,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766689253] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:56,070 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:56,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:56,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47126750] [2022-01-11 01:47:56,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:56,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:56,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:56,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:56,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:56,071 INFO L87 Difference]: Start difference. First operand 3329 states and 4895 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:56,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:56,220 INFO L93 Difference]: Finished difference Result 6635 states and 9755 transitions. [2022-01-11 01:47:56,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:56,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2022-01-11 01:47:56,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:56,225 INFO L225 Difference]: With dead ends: 6635 [2022-01-11 01:47:56,225 INFO L226 Difference]: Without dead ends: 3329 [2022-01-11 01:47:56,227 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:56,227 INFO L933 BasicCegarLoop]: 2636 mSDtfsCounter, 2619 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2619 SdHoareTripleChecker+Valid, 2636 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:56,227 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2619 Valid, 2636 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:56,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2022-01-11 01:47:56,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3329. [2022-01-11 01:47:56,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3329 states, 3327 states have (on average 1.4688908926961226) internal successors, (4887), 3328 states have internal predecessors, (4887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:56,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4887 transitions. [2022-01-11 01:47:56,347 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4887 transitions. Word has length 165 [2022-01-11 01:47:56,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:56,347 INFO L470 AbstractCegarLoop]: Abstraction has 3329 states and 4887 transitions. [2022-01-11 01:47:56,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:56,347 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4887 transitions. [2022-01-11 01:47:56,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-11 01:47:56,348 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:56,348 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:47:56,348 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-11 01:47:56,349 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:56,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:56,349 INFO L85 PathProgramCache]: Analyzing trace with hash 6016758, now seen corresponding path program 1 times [2022-01-11 01:47:56,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:56,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953660435] [2022-01-11 01:47:56,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:56,349 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:56,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:56,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:56,400 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:56,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953660435] [2022-01-11 01:47:56,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953660435] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:56,400 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:56,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:56,401 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587754199] [2022-01-11 01:47:56,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:56,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:56,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:56,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:56,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:56,402 INFO L87 Difference]: Start difference. First operand 3329 states and 4887 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:56,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:56,525 INFO L93 Difference]: Finished difference Result 6633 states and 9736 transitions. [2022-01-11 01:47:56,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:56,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2022-01-11 01:47:56,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:56,531 INFO L225 Difference]: With dead ends: 6633 [2022-01-11 01:47:56,531 INFO L226 Difference]: Without dead ends: 3329 [2022-01-11 01:47:56,535 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:56,535 INFO L933 BasicCegarLoop]: 2631 mSDtfsCounter, 2612 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2612 SdHoareTripleChecker+Valid, 2631 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:56,535 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2612 Valid, 2631 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:56,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2022-01-11 01:47:56,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3329. [2022-01-11 01:47:56,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3329 states, 3327 states have (on average 1.4664863240156296) internal successors, (4879), 3328 states have internal predecessors, (4879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:56,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4879 transitions. [2022-01-11 01:47:56,715 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4879 transitions. Word has length 165 [2022-01-11 01:47:56,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:56,717 INFO L470 AbstractCegarLoop]: Abstraction has 3329 states and 4879 transitions. [2022-01-11 01:47:56,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:56,717 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4879 transitions. [2022-01-11 01:47:56,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-11 01:47:56,718 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:56,718 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:47:56,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-11 01:47:56,718 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:56,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:56,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1878326742, now seen corresponding path program 1 times [2022-01-11 01:47:56,719 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:56,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885513606] [2022-01-11 01:47:56,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:56,719 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:56,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:56,760 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:56,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885513606] [2022-01-11 01:47:56,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885513606] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:56,760 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:56,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:56,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563323945] [2022-01-11 01:47:56,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:56,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:56,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:56,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:56,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:56,761 INFO L87 Difference]: Start difference. First operand 3329 states and 4879 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:56,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:56,922 INFO L93 Difference]: Finished difference Result 6632 states and 9719 transitions. [2022-01-11 01:47:56,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:56,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2022-01-11 01:47:56,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:56,927 INFO L225 Difference]: With dead ends: 6632 [2022-01-11 01:47:56,928 INFO L226 Difference]: Without dead ends: 3329 [2022-01-11 01:47:56,932 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:56,933 INFO L933 BasicCegarLoop]: 2626 mSDtfsCounter, 2606 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2606 SdHoareTripleChecker+Valid, 2626 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:56,933 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2606 Valid, 2626 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:56,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2022-01-11 01:47:57,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3329. [2022-01-11 01:47:57,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3329 states, 3327 states have (on average 1.4640817553351368) internal successors, (4871), 3328 states have internal predecessors, (4871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:57,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4871 transitions. [2022-01-11 01:47:57,061 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4871 transitions. Word has length 165 [2022-01-11 01:47:57,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:57,061 INFO L470 AbstractCegarLoop]: Abstraction has 3329 states and 4871 transitions. [2022-01-11 01:47:57,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:57,062 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4871 transitions. [2022-01-11 01:47:57,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-11 01:47:57,063 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:57,063 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:47:57,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-11 01:47:57,063 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:57,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:57,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1661629174, now seen corresponding path program 1 times [2022-01-11 01:47:57,063 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:57,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346755967] [2022-01-11 01:47:57,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:57,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:57,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:57,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:57,103 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:57,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346755967] [2022-01-11 01:47:57,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346755967] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:57,103 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:57,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:57,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744138144] [2022-01-11 01:47:57,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:57,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:57,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:57,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:57,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:57,105 INFO L87 Difference]: Start difference. First operand 3329 states and 4871 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:57,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:57,273 INFO L93 Difference]: Finished difference Result 6631 states and 9702 transitions. [2022-01-11 01:47:57,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:57,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2022-01-11 01:47:57,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:57,278 INFO L225 Difference]: With dead ends: 6631 [2022-01-11 01:47:57,278 INFO L226 Difference]: Without dead ends: 3329 [2022-01-11 01:47:57,280 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:57,281 INFO L933 BasicCegarLoop]: 2621 mSDtfsCounter, 2600 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2600 SdHoareTripleChecker+Valid, 2621 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:57,281 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2600 Valid, 2621 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:57,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2022-01-11 01:47:57,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3329. [2022-01-11 01:47:57,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3329 states, 3327 states have (on average 1.4616771866546439) internal successors, (4863), 3328 states have internal predecessors, (4863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:57,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4863 transitions. [2022-01-11 01:47:57,409 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4863 transitions. Word has length 165 [2022-01-11 01:47:57,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:57,409 INFO L470 AbstractCegarLoop]: Abstraction has 3329 states and 4863 transitions. [2022-01-11 01:47:57,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:57,409 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4863 transitions. [2022-01-11 01:47:57,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-11 01:47:57,410 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:57,410 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:47:57,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-11 01:47:57,410 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:57,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:57,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1793186262, now seen corresponding path program 1 times [2022-01-11 01:47:57,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:57,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053026616] [2022-01-11 01:47:57,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:57,411 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:57,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:57,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:57,456 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:57,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053026616] [2022-01-11 01:47:57,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053026616] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:57,456 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:57,456 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:57,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160866047] [2022-01-11 01:47:57,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:57,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:57,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:57,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:57,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:57,458 INFO L87 Difference]: Start difference. First operand 3329 states and 4863 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:57,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:57,603 INFO L93 Difference]: Finished difference Result 6630 states and 9685 transitions. [2022-01-11 01:47:57,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:57,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2022-01-11 01:47:57,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:57,609 INFO L225 Difference]: With dead ends: 6630 [2022-01-11 01:47:57,609 INFO L226 Difference]: Without dead ends: 3329 [2022-01-11 01:47:57,613 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:57,614 INFO L933 BasicCegarLoop]: 2616 mSDtfsCounter, 2594 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2594 SdHoareTripleChecker+Valid, 2616 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:57,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2594 Valid, 2616 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:57,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2022-01-11 01:47:57,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3329. [2022-01-11 01:47:57,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3329 states, 3327 states have (on average 1.4592726179741509) internal successors, (4855), 3328 states have internal predecessors, (4855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:57,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4855 transitions. [2022-01-11 01:47:57,751 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4855 transitions. Word has length 165 [2022-01-11 01:47:57,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:57,752 INFO L470 AbstractCegarLoop]: Abstraction has 3329 states and 4855 transitions. [2022-01-11 01:47:57,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:57,752 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4855 transitions. [2022-01-11 01:47:57,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-11 01:47:57,753 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:57,753 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:47:57,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-11 01:47:57,753 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:57,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:57,753 INFO L85 PathProgramCache]: Analyzing trace with hash 689051382, now seen corresponding path program 1 times [2022-01-11 01:47:57,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:57,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472322310] [2022-01-11 01:47:57,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:57,754 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:57,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:57,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:57,788 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:57,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472322310] [2022-01-11 01:47:57,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472322310] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:57,788 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:57,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:57,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084930130] [2022-01-11 01:47:57,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:57,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:57,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:57,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:57,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:57,791 INFO L87 Difference]: Start difference. First operand 3329 states and 4855 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:57,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:57,954 INFO L93 Difference]: Finished difference Result 6629 states and 9668 transitions. [2022-01-11 01:47:57,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:57,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2022-01-11 01:47:57,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:57,960 INFO L225 Difference]: With dead ends: 6629 [2022-01-11 01:47:57,960 INFO L226 Difference]: Without dead ends: 3329 [2022-01-11 01:47:57,964 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:57,965 INFO L933 BasicCegarLoop]: 2611 mSDtfsCounter, 2588 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2588 SdHoareTripleChecker+Valid, 2611 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:57,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2588 Valid, 2611 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:57,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2022-01-11 01:47:58,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3329. [2022-01-11 01:47:58,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3329 states, 3327 states have (on average 1.4568680492936579) internal successors, (4847), 3328 states have internal predecessors, (4847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:58,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4847 transitions. [2022-01-11 01:47:58,118 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4847 transitions. Word has length 165 [2022-01-11 01:47:58,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:58,118 INFO L470 AbstractCegarLoop]: Abstraction has 3329 states and 4847 transitions. [2022-01-11 01:47:58,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:58,118 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4847 transitions. [2022-01-11 01:47:58,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-11 01:47:58,119 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:58,119 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:47:58,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-11 01:47:58,119 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:58,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:58,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1286228522, now seen corresponding path program 1 times [2022-01-11 01:47:58,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:58,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749344651] [2022-01-11 01:47:58,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:58,120 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:58,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:58,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:58,160 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:58,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749344651] [2022-01-11 01:47:58,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749344651] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:58,160 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:58,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:58,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2401986] [2022-01-11 01:47:58,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:58,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:58,161 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:58,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:58,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:58,161 INFO L87 Difference]: Start difference. First operand 3329 states and 4847 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:58,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:58,312 INFO L93 Difference]: Finished difference Result 6627 states and 9649 transitions. [2022-01-11 01:47:58,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:58,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2022-01-11 01:47:58,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:58,318 INFO L225 Difference]: With dead ends: 6627 [2022-01-11 01:47:58,318 INFO L226 Difference]: Without dead ends: 3329 [2022-01-11 01:47:58,322 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:58,323 INFO L933 BasicCegarLoop]: 2606 mSDtfsCounter, 2581 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2581 SdHoareTripleChecker+Valid, 2606 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:58,323 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2581 Valid, 2606 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:58,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2022-01-11 01:47:58,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3329. [2022-01-11 01:47:58,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3329 states, 3327 states have (on average 1.454463480613165) internal successors, (4839), 3328 states have internal predecessors, (4839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:58,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4839 transitions. [2022-01-11 01:47:58,499 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4839 transitions. Word has length 165 [2022-01-11 01:47:58,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:58,500 INFO L470 AbstractCegarLoop]: Abstraction has 3329 states and 4839 transitions. [2022-01-11 01:47:58,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:58,500 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4839 transitions. [2022-01-11 01:47:58,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-11 01:47:58,501 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:58,501 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:47:58,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-11 01:47:58,501 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:58,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:58,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1572048054, now seen corresponding path program 1 times [2022-01-11 01:47:58,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:58,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018370050] [2022-01-11 01:47:58,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:58,502 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:58,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:58,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:58,542 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:58,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018370050] [2022-01-11 01:47:58,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018370050] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:58,543 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:58,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:58,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420580858] [2022-01-11 01:47:58,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:58,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:58,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:58,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:58,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:58,544 INFO L87 Difference]: Start difference. First operand 3329 states and 4839 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:58,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:58,695 INFO L93 Difference]: Finished difference Result 6626 states and 9632 transitions. [2022-01-11 01:47:58,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:58,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2022-01-11 01:47:58,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:58,701 INFO L225 Difference]: With dead ends: 6626 [2022-01-11 01:47:58,701 INFO L226 Difference]: Without dead ends: 3329 [2022-01-11 01:47:58,705 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:58,705 INFO L933 BasicCegarLoop]: 2601 mSDtfsCounter, 2575 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2575 SdHoareTripleChecker+Valid, 2601 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:58,705 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2575 Valid, 2601 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:58,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2022-01-11 01:47:58,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3329. [2022-01-11 01:47:58,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3329 states, 3327 states have (on average 1.4520589119326721) internal successors, (4831), 3328 states have internal predecessors, (4831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:58,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4831 transitions. [2022-01-11 01:47:58,904 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4831 transitions. Word has length 165 [2022-01-11 01:47:58,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:58,904 INFO L470 AbstractCegarLoop]: Abstraction has 3329 states and 4831 transitions. [2022-01-11 01:47:58,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:58,904 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4831 transitions. [2022-01-11 01:47:58,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-11 01:47:58,905 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:58,906 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:47:58,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-11 01:47:58,906 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:58,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:58,906 INFO L85 PathProgramCache]: Analyzing trace with hash -691054122, now seen corresponding path program 1 times [2022-01-11 01:47:58,906 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:58,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248007435] [2022-01-11 01:47:58,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:58,907 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:58,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:58,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:58,952 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:58,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248007435] [2022-01-11 01:47:58,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248007435] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:58,952 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:58,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:58,952 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422174338] [2022-01-11 01:47:58,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:58,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:58,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:58,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:58,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:58,954 INFO L87 Difference]: Start difference. First operand 3329 states and 4831 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:59,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:59,214 INFO L93 Difference]: Finished difference Result 6625 states and 9615 transitions. [2022-01-11 01:47:59,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:59,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2022-01-11 01:47:59,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:59,220 INFO L225 Difference]: With dead ends: 6625 [2022-01-11 01:47:59,220 INFO L226 Difference]: Without dead ends: 3329 [2022-01-11 01:47:59,234 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:59,235 INFO L933 BasicCegarLoop]: 2566 mSDtfsCounter, 2422 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2422 SdHoareTripleChecker+Valid, 2694 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:59,235 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2422 Valid, 2694 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:59,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2022-01-11 01:47:59,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3329. [2022-01-11 01:47:59,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3329 states, 3327 states have (on average 1.4412383528704538) internal successors, (4795), 3328 states have internal predecessors, (4795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:59,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4795 transitions. [2022-01-11 01:47:59,519 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4795 transitions. Word has length 165 [2022-01-11 01:47:59,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:59,519 INFO L470 AbstractCegarLoop]: Abstraction has 3329 states and 4795 transitions. [2022-01-11 01:47:59,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:59,519 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4795 transitions. [2022-01-11 01:47:59,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-11 01:47:59,520 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:59,520 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:47:59,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-11 01:47:59,520 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:59,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:59,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1047348021, now seen corresponding path program 1 times [2022-01-11 01:47:59,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:59,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227304136] [2022-01-11 01:47:59,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:59,521 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:59,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:59,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:59,557 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:59,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227304136] [2022-01-11 01:47:59,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227304136] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:59,557 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:59,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:59,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740220424] [2022-01-11 01:47:59,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:59,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:59,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:59,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:59,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:59,558 INFO L87 Difference]: Start difference. First operand 3329 states and 4795 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:59,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:59,756 INFO L93 Difference]: Finished difference Result 6623 states and 9540 transitions. [2022-01-11 01:47:59,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:59,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2022-01-11 01:47:59,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:59,762 INFO L225 Difference]: With dead ends: 6623 [2022-01-11 01:47:59,762 INFO L226 Difference]: Without dead ends: 3329 [2022-01-11 01:47:59,767 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:59,767 INFO L933 BasicCegarLoop]: 2546 mSDtfsCounter, 2401 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2401 SdHoareTripleChecker+Valid, 2673 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:59,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2401 Valid, 2673 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:59,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2022-01-11 01:47:59,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3329. [2022-01-11 01:47:59,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3329 states, 3327 states have (on average 1.4304177938082356) internal successors, (4759), 3328 states have internal predecessors, (4759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:59,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4759 transitions. [2022-01-11 01:47:59,960 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4759 transitions. Word has length 165 [2022-01-11 01:47:59,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:59,960 INFO L470 AbstractCegarLoop]: Abstraction has 3329 states and 4759 transitions. [2022-01-11 01:47:59,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:59,960 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4759 transitions. [2022-01-11 01:47:59,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-11 01:47:59,961 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:59,961 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:47:59,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-11 01:47:59,961 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:59,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:59,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1259203348, now seen corresponding path program 1 times [2022-01-11 01:47:59,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:59,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408539844] [2022-01-11 01:47:59,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:59,962 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:59,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:59,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:59,995 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:59,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408539844] [2022-01-11 01:47:59,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408539844] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:59,995 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:59,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:59,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034127042] [2022-01-11 01:47:59,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:59,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:59,996 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:59,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:59,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:59,996 INFO L87 Difference]: Start difference. First operand 3329 states and 4759 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:00,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:00,170 INFO L93 Difference]: Finished difference Result 6622 states and 9467 transitions. [2022-01-11 01:48:00,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:00,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2022-01-11 01:48:00,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:00,176 INFO L225 Difference]: With dead ends: 6622 [2022-01-11 01:48:00,177 INFO L226 Difference]: Without dead ends: 3329 [2022-01-11 01:48:00,180 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:00,180 INFO L933 BasicCegarLoop]: 2526 mSDtfsCounter, 2381 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2381 SdHoareTripleChecker+Valid, 2652 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:00,181 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2381 Valid, 2652 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:00,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2022-01-11 01:48:00,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3329. [2022-01-11 01:48:00,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3329 states, 3327 states have (on average 1.4195972347460175) internal successors, (4723), 3328 states have internal predecessors, (4723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:00,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4723 transitions. [2022-01-11 01:48:00,325 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4723 transitions. Word has length 165 [2022-01-11 01:48:00,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:00,325 INFO L470 AbstractCegarLoop]: Abstraction has 3329 states and 4723 transitions. [2022-01-11 01:48:00,325 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:00,325 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4723 transitions. [2022-01-11 01:48:00,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-11 01:48:00,326 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:00,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:00,326 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-11 01:48:00,326 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:00,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:00,327 INFO L85 PathProgramCache]: Analyzing trace with hash 763499635, now seen corresponding path program 1 times [2022-01-11 01:48:00,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:00,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241937393] [2022-01-11 01:48:00,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:00,327 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:00,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:00,358 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:00,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241937393] [2022-01-11 01:48:00,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241937393] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:00,359 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:00,359 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:48:00,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17298363] [2022-01-11 01:48:00,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:00,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:00,359 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:00,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:00,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:00,360 INFO L87 Difference]: Start difference. First operand 3329 states and 4723 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:00,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:00,551 INFO L93 Difference]: Finished difference Result 6621 states and 9394 transitions. [2022-01-11 01:48:00,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:00,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2022-01-11 01:48:00,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:00,557 INFO L225 Difference]: With dead ends: 6621 [2022-01-11 01:48:00,557 INFO L226 Difference]: Without dead ends: 3329 [2022-01-11 01:48:00,559 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:00,560 INFO L933 BasicCegarLoop]: 2506 mSDtfsCounter, 2361 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2361 SdHoareTripleChecker+Valid, 2631 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:00,560 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2361 Valid, 2631 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:00,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2022-01-11 01:48:00,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3329. [2022-01-11 01:48:00,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3329 states, 3327 states have (on average 1.4087766756837992) internal successors, (4687), 3328 states have internal predecessors, (4687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:00,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4687 transitions. [2022-01-11 01:48:00,712 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4687 transitions. Word has length 165 [2022-01-11 01:48:00,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:00,712 INFO L470 AbstractCegarLoop]: Abstraction has 3329 states and 4687 transitions. [2022-01-11 01:48:00,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:00,713 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4687 transitions. [2022-01-11 01:48:00,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-11 01:48:00,714 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:00,714 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:00,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-11 01:48:00,714 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:00,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:00,714 INFO L85 PathProgramCache]: Analyzing trace with hash -720815406, now seen corresponding path program 1 times [2022-01-11 01:48:00,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:00,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961935756] [2022-01-11 01:48:00,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:00,715 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:00,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:00,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:00,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961935756] [2022-01-11 01:48:00,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961935756] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:00,750 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:00,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:48:00,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325783844] [2022-01-11 01:48:00,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:00,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:00,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:00,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:00,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:00,752 INFO L87 Difference]: Start difference. First operand 3329 states and 4687 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:00,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:00,929 INFO L93 Difference]: Finished difference Result 6620 states and 9321 transitions. [2022-01-11 01:48:00,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:00,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2022-01-11 01:48:00,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:00,935 INFO L225 Difference]: With dead ends: 6620 [2022-01-11 01:48:00,935 INFO L226 Difference]: Without dead ends: 3329 [2022-01-11 01:48:00,939 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:00,939 INFO L933 BasicCegarLoop]: 2486 mSDtfsCounter, 2341 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2341 SdHoareTripleChecker+Valid, 2610 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:00,939 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2341 Valid, 2610 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:00,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2022-01-11 01:48:01,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3329. [2022-01-11 01:48:01,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3329 states, 3327 states have (on average 1.397956116621581) internal successors, (4651), 3328 states have internal predecessors, (4651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:01,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4651 transitions. [2022-01-11 01:48:01,094 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4651 transitions. Word has length 165 [2022-01-11 01:48:01,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:01,094 INFO L470 AbstractCegarLoop]: Abstraction has 3329 states and 4651 transitions. [2022-01-11 01:48:01,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:01,094 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4651 transitions. [2022-01-11 01:48:01,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-11 01:48:01,095 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:01,095 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:01,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-11 01:48:01,095 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:01,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:01,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1148497231, now seen corresponding path program 1 times [2022-01-11 01:48:01,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:01,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571768881] [2022-01-11 01:48:01,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:01,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:01,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:01,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:01,129 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:01,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571768881] [2022-01-11 01:48:01,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571768881] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:01,129 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:01,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:48:01,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974098029] [2022-01-11 01:48:01,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:01,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:01,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:01,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:01,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:01,130 INFO L87 Difference]: Start difference. First operand 3329 states and 4651 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:01,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:01,351 INFO L93 Difference]: Finished difference Result 6619 states and 9248 transitions. [2022-01-11 01:48:01,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:01,352 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2022-01-11 01:48:01,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:01,359 INFO L225 Difference]: With dead ends: 6619 [2022-01-11 01:48:01,359 INFO L226 Difference]: Without dead ends: 3329 [2022-01-11 01:48:01,362 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:01,362 INFO L933 BasicCegarLoop]: 2466 mSDtfsCounter, 2321 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2321 SdHoareTripleChecker+Valid, 2589 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:01,363 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2321 Valid, 2589 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:01,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2022-01-11 01:48:01,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3329. [2022-01-11 01:48:01,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3329 states, 3327 states have (on average 1.3871355575593627) internal successors, (4615), 3328 states have internal predecessors, (4615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:01,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4615 transitions. [2022-01-11 01:48:01,526 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4615 transitions. Word has length 165 [2022-01-11 01:48:01,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:01,526 INFO L470 AbstractCegarLoop]: Abstraction has 3329 states and 4615 transitions. [2022-01-11 01:48:01,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:01,527 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4615 transitions. [2022-01-11 01:48:01,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-11 01:48:01,527 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:01,528 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:01,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-11 01:48:01,528 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:01,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:01,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1174620272, now seen corresponding path program 1 times [2022-01-11 01:48:01,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:01,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104197028] [2022-01-11 01:48:01,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:01,529 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:01,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:01,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:01,561 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:01,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104197028] [2022-01-11 01:48:01,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104197028] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:01,562 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:01,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:48:01,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586791599] [2022-01-11 01:48:01,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:01,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:01,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:01,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:01,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:01,563 INFO L87 Difference]: Start difference. First operand 3329 states and 4615 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:01,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:01,745 INFO L93 Difference]: Finished difference Result 6618 states and 9175 transitions. [2022-01-11 01:48:01,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:01,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2022-01-11 01:48:01,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:01,750 INFO L225 Difference]: With dead ends: 6618 [2022-01-11 01:48:01,750 INFO L226 Difference]: Without dead ends: 3329 [2022-01-11 01:48:01,756 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:01,757 INFO L933 BasicCegarLoop]: 2446 mSDtfsCounter, 2301 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2301 SdHoareTripleChecker+Valid, 2568 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:01,757 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2301 Valid, 2568 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:01,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2022-01-11 01:48:02,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3329. [2022-01-11 01:48:02,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3329 states, 3327 states have (on average 1.3763149984971446) internal successors, (4579), 3328 states have internal predecessors, (4579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:02,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4579 transitions. [2022-01-11 01:48:02,013 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4579 transitions. Word has length 165 [2022-01-11 01:48:02,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:02,013 INFO L470 AbstractCegarLoop]: Abstraction has 3329 states and 4579 transitions. [2022-01-11 01:48:02,013 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:02,013 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4579 transitions. [2022-01-11 01:48:02,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-11 01:48:02,014 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:02,015 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:02,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-11 01:48:02,015 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:02,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:02,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1053064687, now seen corresponding path program 1 times [2022-01-11 01:48:02,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:02,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908381726] [2022-01-11 01:48:02,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:02,016 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:02,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:02,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:02,052 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:02,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908381726] [2022-01-11 01:48:02,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908381726] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:02,053 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:02,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:48:02,053 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144874942] [2022-01-11 01:48:02,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:02,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:02,053 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:02,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:02,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:02,054 INFO L87 Difference]: Start difference. First operand 3329 states and 4579 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:02,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:02,290 INFO L93 Difference]: Finished difference Result 6617 states and 9102 transitions. [2022-01-11 01:48:02,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:02,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2022-01-11 01:48:02,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:02,297 INFO L225 Difference]: With dead ends: 6617 [2022-01-11 01:48:02,298 INFO L226 Difference]: Without dead ends: 3329 [2022-01-11 01:48:02,301 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:02,302 INFO L933 BasicCegarLoop]: 2426 mSDtfsCounter, 2281 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2281 SdHoareTripleChecker+Valid, 2547 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:02,303 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2281 Valid, 2547 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:02,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2022-01-11 01:48:02,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3329. [2022-01-11 01:48:02,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3329 states, 3327 states have (on average 1.3654944394349264) internal successors, (4543), 3328 states have internal predecessors, (4543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:02,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4543 transitions. [2022-01-11 01:48:02,476 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4543 transitions. Word has length 165 [2022-01-11 01:48:02,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:02,476 INFO L470 AbstractCegarLoop]: Abstraction has 3329 states and 4543 transitions. [2022-01-11 01:48:02,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:02,476 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4543 transitions. [2022-01-11 01:48:02,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-11 01:48:02,477 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:02,477 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:02,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-11 01:48:02,477 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:02,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:02,477 INFO L85 PathProgramCache]: Analyzing trace with hash -431759026, now seen corresponding path program 1 times [2022-01-11 01:48:02,477 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:02,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553775288] [2022-01-11 01:48:02,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:02,478 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:02,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:02,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:02,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:02,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553775288] [2022-01-11 01:48:02,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553775288] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:02,513 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:02,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:48:02,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614066299] [2022-01-11 01:48:02,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:02,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:02,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:02,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:02,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:02,515 INFO L87 Difference]: Start difference. First operand 3329 states and 4543 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:02,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:02,721 INFO L93 Difference]: Finished difference Result 6616 states and 9029 transitions. [2022-01-11 01:48:02,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:02,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2022-01-11 01:48:02,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:02,728 INFO L225 Difference]: With dead ends: 6616 [2022-01-11 01:48:02,728 INFO L226 Difference]: Without dead ends: 3329 [2022-01-11 01:48:02,732 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:02,733 INFO L933 BasicCegarLoop]: 2406 mSDtfsCounter, 2261 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2261 SdHoareTripleChecker+Valid, 2526 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:02,733 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2261 Valid, 2526 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:02,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2022-01-11 01:48:02,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3329. [2022-01-11 01:48:02,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3329 states, 3327 states have (on average 1.354673880372708) internal successors, (4507), 3328 states have internal predecessors, (4507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:02,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4507 transitions. [2022-01-11 01:48:02,931 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4507 transitions. Word has length 165 [2022-01-11 01:48:02,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:02,931 INFO L470 AbstractCegarLoop]: Abstraction has 3329 states and 4507 transitions. [2022-01-11 01:48:02,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:02,931 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4507 transitions. [2022-01-11 01:48:02,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-11 01:48:02,932 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:02,932 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:02,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-11 01:48:02,933 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:02,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:02,933 INFO L85 PathProgramCache]: Analyzing trace with hash 447288877, now seen corresponding path program 1 times [2022-01-11 01:48:02,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:02,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312117437] [2022-01-11 01:48:02,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:02,934 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:02,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:02,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:02,966 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:02,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312117437] [2022-01-11 01:48:02,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312117437] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:02,967 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:02,967 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:48:02,967 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198641954] [2022-01-11 01:48:02,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:02,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:02,967 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:02,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:02,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:02,968 INFO L87 Difference]: Start difference. First operand 3329 states and 4507 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:03,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:03,175 INFO L93 Difference]: Finished difference Result 6615 states and 8956 transitions. [2022-01-11 01:48:03,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:03,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2022-01-11 01:48:03,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:03,181 INFO L225 Difference]: With dead ends: 6615 [2022-01-11 01:48:03,181 INFO L226 Difference]: Without dead ends: 3329 [2022-01-11 01:48:03,184 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:03,185 INFO L933 BasicCegarLoop]: 2386 mSDtfsCounter, 2241 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2241 SdHoareTripleChecker+Valid, 2505 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:03,185 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2241 Valid, 2505 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:03,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2022-01-11 01:48:03,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3329. [2022-01-11 01:48:03,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3329 states, 3327 states have (on average 1.34385332131049) internal successors, (4471), 3328 states have internal predecessors, (4471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:03,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4471 transitions. [2022-01-11 01:48:03,378 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4471 transitions. Word has length 165 [2022-01-11 01:48:03,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:03,378 INFO L470 AbstractCegarLoop]: Abstraction has 3329 states and 4471 transitions. [2022-01-11 01:48:03,378 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:03,378 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4471 transitions. [2022-01-11 01:48:03,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-11 01:48:03,379 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:03,379 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:03,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-11 01:48:03,379 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:03,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:03,380 INFO L85 PathProgramCache]: Analyzing trace with hash 595212300, now seen corresponding path program 1 times [2022-01-11 01:48:03,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:03,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523819707] [2022-01-11 01:48:03,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:03,380 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:03,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:03,415 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:03,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523819707] [2022-01-11 01:48:03,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523819707] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:03,415 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:03,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:48:03,416 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25164679] [2022-01-11 01:48:03,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:03,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:03,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:03,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:03,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:03,417 INFO L87 Difference]: Start difference. First operand 3329 states and 4471 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:03,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:03,646 INFO L93 Difference]: Finished difference Result 6614 states and 8883 transitions. [2022-01-11 01:48:03,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:03,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2022-01-11 01:48:03,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:03,651 INFO L225 Difference]: With dead ends: 6614 [2022-01-11 01:48:03,651 INFO L226 Difference]: Without dead ends: 3329 [2022-01-11 01:48:03,656 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:03,656 INFO L933 BasicCegarLoop]: 2366 mSDtfsCounter, 2221 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2221 SdHoareTripleChecker+Valid, 2484 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:03,656 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2221 Valid, 2484 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:03,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2022-01-11 01:48:03,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3329. [2022-01-11 01:48:03,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3329 states, 3327 states have (on average 1.3330327622482716) internal successors, (4435), 3328 states have internal predecessors, (4435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:03,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4435 transitions. [2022-01-11 01:48:03,839 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4435 transitions. Word has length 165 [2022-01-11 01:48:03,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:03,841 INFO L470 AbstractCegarLoop]: Abstraction has 3329 states and 4435 transitions. [2022-01-11 01:48:03,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:03,841 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4435 transitions. [2022-01-11 01:48:03,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-11 01:48:03,841 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:03,841 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:03,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-11 01:48:03,842 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:03,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:03,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1611359381, now seen corresponding path program 1 times [2022-01-11 01:48:03,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:03,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350073823] [2022-01-11 01:48:03,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:03,842 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:03,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:03,891 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:03,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350073823] [2022-01-11 01:48:03,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350073823] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:03,891 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:03,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:48:03,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130629790] [2022-01-11 01:48:03,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:03,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:48:03,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:03,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:48:03,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:48:03,892 INFO L87 Difference]: Start difference. First operand 3329 states and 4435 transitions. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:04,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:04,278 INFO L93 Difference]: Finished difference Result 7584 states and 10187 transitions. [2022-01-11 01:48:04,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:48:04,279 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2022-01-11 01:48:04,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:04,284 INFO L225 Difference]: With dead ends: 7584 [2022-01-11 01:48:04,284 INFO L226 Difference]: Without dead ends: 4307 [2022-01-11 01:48:04,286 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 01:48:04,287 INFO L933 BasicCegarLoop]: 2550 mSDtfsCounter, 6858 mSDsluCounter, 2024 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6858 SdHoareTripleChecker+Valid, 4574 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:04,287 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6858 Valid, 4574 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:48:04,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4307 states. [2022-01-11 01:48:04,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4307 to 3335. [2022-01-11 01:48:04,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3335 states, 3333 states have (on average 1.3240324032403241) internal successors, (4413), 3334 states have internal predecessors, (4413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:04,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3335 states to 3335 states and 4413 transitions. [2022-01-11 01:48:04,520 INFO L78 Accepts]: Start accepts. Automaton has 3335 states and 4413 transitions. Word has length 165 [2022-01-11 01:48:04,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:04,520 INFO L470 AbstractCegarLoop]: Abstraction has 3335 states and 4413 transitions. [2022-01-11 01:48:04,520 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:04,520 INFO L276 IsEmpty]: Start isEmpty. Operand 3335 states and 4413 transitions. [2022-01-11 01:48:04,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-11 01:48:04,521 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:04,521 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:04,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-11 01:48:04,521 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:04,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:04,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1500590380, now seen corresponding path program 1 times [2022-01-11 01:48:04,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:04,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360549010] [2022-01-11 01:48:04,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:04,522 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:04,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:04,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:04,552 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:04,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360549010] [2022-01-11 01:48:04,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360549010] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:04,552 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:04,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:48:04,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830108340] [2022-01-11 01:48:04,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:04,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:04,552 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:04,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:04,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:04,553 INFO L87 Difference]: Start difference. First operand 3335 states and 4413 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:04,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:04,964 INFO L93 Difference]: Finished difference Result 9569 states and 12654 transitions. [2022-01-11 01:48:04,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:04,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2022-01-11 01:48:04,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:04,971 INFO L225 Difference]: With dead ends: 9569 [2022-01-11 01:48:04,971 INFO L226 Difference]: Without dead ends: 6288 [2022-01-11 01:48:04,976 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:04,976 INFO L933 BasicCegarLoop]: 2352 mSDtfsCounter, 2148 mSDsluCounter, 2126 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2148 SdHoareTripleChecker+Valid, 4478 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:04,976 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2148 Valid, 4478 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:04,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6288 states. [2022-01-11 01:48:05,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6288 to 6280. [2022-01-11 01:48:05,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6280 states, 6278 states have (on average 1.318254221089519) internal successors, (8276), 6279 states have internal predecessors, (8276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:05,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6280 states to 6280 states and 8276 transitions. [2022-01-11 01:48:05,381 INFO L78 Accepts]: Start accepts. Automaton has 6280 states and 8276 transitions. Word has length 165 [2022-01-11 01:48:05,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:05,383 INFO L470 AbstractCegarLoop]: Abstraction has 6280 states and 8276 transitions. [2022-01-11 01:48:05,383 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:05,383 INFO L276 IsEmpty]: Start isEmpty. Operand 6280 states and 8276 transitions. [2022-01-11 01:48:05,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-11 01:48:05,384 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:05,384 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:05,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-11 01:48:05,384 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:05,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:05,388 INFO L85 PathProgramCache]: Analyzing trace with hash 688035563, now seen corresponding path program 1 times [2022-01-11 01:48:05,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:05,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988949793] [2022-01-11 01:48:05,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:05,390 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:05,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:05,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:05,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:05,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988949793] [2022-01-11 01:48:05,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988949793] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:05,427 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:05,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:48:05,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547059938] [2022-01-11 01:48:05,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:05,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:48:05,428 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:05,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:48:05,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:48:05,429 INFO L87 Difference]: Start difference. First operand 6280 states and 8276 transitions. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:06,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:06,159 INFO L93 Difference]: Finished difference Result 13815 states and 18292 transitions. [2022-01-11 01:48:06,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:48:06,159 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2022-01-11 01:48:06,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:06,167 INFO L225 Difference]: With dead ends: 13815 [2022-01-11 01:48:06,167 INFO L226 Difference]: Without dead ends: 7600 [2022-01-11 01:48:06,171 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 01:48:06,180 INFO L933 BasicCegarLoop]: 2494 mSDtfsCounter, 6487 mSDsluCounter, 2782 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6487 SdHoareTripleChecker+Valid, 5276 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:06,181 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6487 Valid, 5276 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:48:06,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7600 states. [2022-01-11 01:48:06,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7600 to 6286. [2022-01-11 01:48:06,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6286 states, 6284 states have (on average 1.3091979630808401) internal successors, (8227), 6285 states have internal predecessors, (8227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:06,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6286 states to 6286 states and 8227 transitions. [2022-01-11 01:48:06,670 INFO L78 Accepts]: Start accepts. Automaton has 6286 states and 8227 transitions. Word has length 165 [2022-01-11 01:48:06,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:06,671 INFO L470 AbstractCegarLoop]: Abstraction has 6286 states and 8227 transitions. [2022-01-11 01:48:06,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:06,671 INFO L276 IsEmpty]: Start isEmpty. Operand 6286 states and 8227 transitions. [2022-01-11 01:48:06,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-11 01:48:06,672 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:06,672 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:06,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-11 01:48:06,672 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:06,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:06,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1818822188, now seen corresponding path program 1 times [2022-01-11 01:48:06,673 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:06,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864831069] [2022-01-11 01:48:06,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:06,673 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:06,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:06,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:06,727 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:06,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864831069] [2022-01-11 01:48:06,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864831069] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:06,728 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:06,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:48:06,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598068465] [2022-01-11 01:48:06,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:06,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:48:06,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:06,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:48:06,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:48:06,729 INFO L87 Difference]: Start difference. First operand 6286 states and 8227 transitions. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:07,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:07,546 INFO L93 Difference]: Finished difference Result 15386 states and 20234 transitions. [2022-01-11 01:48:07,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:48:07,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2022-01-11 01:48:07,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:07,556 INFO L225 Difference]: With dead ends: 15386 [2022-01-11 01:48:07,556 INFO L226 Difference]: Without dead ends: 9172 [2022-01-11 01:48:07,561 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 01:48:07,561 INFO L933 BasicCegarLoop]: 2461 mSDtfsCounter, 6296 mSDsluCounter, 3111 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6296 SdHoareTripleChecker+Valid, 5572 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:07,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6296 Valid, 5572 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:48:07,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9172 states. [2022-01-11 01:48:08,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9172 to 6298. [2022-01-11 01:48:08,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6298 states, 6296 states have (on average 1.3001905972045744) internal successors, (8186), 6297 states have internal predecessors, (8186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:08,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6298 states to 6298 states and 8186 transitions. [2022-01-11 01:48:08,095 INFO L78 Accepts]: Start accepts. Automaton has 6298 states and 8186 transitions. Word has length 165 [2022-01-11 01:48:08,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:08,095 INFO L470 AbstractCegarLoop]: Abstraction has 6298 states and 8186 transitions. [2022-01-11 01:48:08,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:08,095 INFO L276 IsEmpty]: Start isEmpty. Operand 6298 states and 8186 transitions. [2022-01-11 01:48:08,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-11 01:48:08,096 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:08,096 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:08,096 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-11 01:48:08,096 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:08,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:08,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1675609555, now seen corresponding path program 1 times [2022-01-11 01:48:08,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:08,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265641171] [2022-01-11 01:48:08,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:08,097 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:08,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:08,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:08,134 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:08,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265641171] [2022-01-11 01:48:08,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265641171] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:08,135 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:08,135 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:48:08,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249231443] [2022-01-11 01:48:08,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:08,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:08,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:08,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:08,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:08,136 INFO L87 Difference]: Start difference. First operand 6298 states and 8186 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:09,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:09,171 INFO L93 Difference]: Finished difference Result 18158 states and 23583 transitions. [2022-01-11 01:48:09,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:09,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2022-01-11 01:48:09,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:09,186 INFO L225 Difference]: With dead ends: 18158 [2022-01-11 01:48:09,186 INFO L226 Difference]: Without dead ends: 11990 [2022-01-11 01:48:09,192 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:09,193 INFO L933 BasicCegarLoop]: 2319 mSDtfsCounter, 2050 mSDsluCounter, 2098 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2050 SdHoareTripleChecker+Valid, 4417 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:09,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2050 Valid, 4417 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:48:09,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11990 states. [2022-01-11 01:48:10,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11990 to 11978. [2022-01-11 01:48:10,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11978 states, 11976 states have (on average 1.2939211756847027) internal successors, (15496), 11977 states have internal predecessors, (15496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:10,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11978 states to 11978 states and 15496 transitions. [2022-01-11 01:48:10,190 INFO L78 Accepts]: Start accepts. Automaton has 11978 states and 15496 transitions. Word has length 165 [2022-01-11 01:48:10,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:10,190 INFO L470 AbstractCegarLoop]: Abstraction has 11978 states and 15496 transitions. [2022-01-11 01:48:10,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:10,190 INFO L276 IsEmpty]: Start isEmpty. Operand 11978 states and 15496 transitions. [2022-01-11 01:48:10,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-11 01:48:10,191 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:10,191 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:10,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-11 01:48:10,192 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:10,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:10,192 INFO L85 PathProgramCache]: Analyzing trace with hash -2071364692, now seen corresponding path program 1 times [2022-01-11 01:48:10,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:10,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839559631] [2022-01-11 01:48:10,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:10,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:10,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:10,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:10,232 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:10,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839559631] [2022-01-11 01:48:10,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839559631] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:10,232 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:10,232 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:48:10,232 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848912006] [2022-01-11 01:48:10,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:10,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:10,233 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:10,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:10,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:10,233 INFO L87 Difference]: Start difference. First operand 11978 states and 15496 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:11,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:11,320 INFO L93 Difference]: Finished difference Result 23932 states and 30956 transitions. [2022-01-11 01:48:11,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:11,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2022-01-11 01:48:11,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:11,334 INFO L225 Difference]: With dead ends: 23932 [2022-01-11 01:48:11,334 INFO L226 Difference]: Without dead ends: 11978 [2022-01-11 01:48:11,343 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:11,343 INFO L933 BasicCegarLoop]: 2325 mSDtfsCounter, 2202 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2202 SdHoareTripleChecker+Valid, 2325 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:11,343 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2202 Valid, 2325 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:11,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11978 states. [2022-01-11 01:48:12,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11978 to 11978. [2022-01-11 01:48:12,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11978 states, 11976 states have (on average 1.291750167000668) internal successors, (15470), 11977 states have internal predecessors, (15470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:12,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11978 states to 11978 states and 15470 transitions. [2022-01-11 01:48:12,297 INFO L78 Accepts]: Start accepts. Automaton has 11978 states and 15470 transitions. Word has length 165 [2022-01-11 01:48:12,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:12,297 INFO L470 AbstractCegarLoop]: Abstraction has 11978 states and 15470 transitions. [2022-01-11 01:48:12,297 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:12,298 INFO L276 IsEmpty]: Start isEmpty. Operand 11978 states and 15470 transitions. [2022-01-11 01:48:12,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-11 01:48:12,298 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:12,298 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:12,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-11 01:48:12,298 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:12,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:12,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1741598931, now seen corresponding path program 1 times [2022-01-11 01:48:12,299 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:12,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001665101] [2022-01-11 01:48:12,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:12,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:12,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:12,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:12,340 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:12,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001665101] [2022-01-11 01:48:12,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001665101] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:12,341 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:12,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:48:12,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723106042] [2022-01-11 01:48:12,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:12,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:12,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:12,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:12,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:12,342 INFO L87 Difference]: Start difference. First operand 11978 states and 15470 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:13,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:13,364 INFO L93 Difference]: Finished difference Result 23926 states and 30898 transitions. [2022-01-11 01:48:13,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:13,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2022-01-11 01:48:13,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:13,379 INFO L225 Difference]: With dead ends: 23926 [2022-01-11 01:48:13,379 INFO L226 Difference]: Without dead ends: 11978 [2022-01-11 01:48:13,387 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:13,388 INFO L933 BasicCegarLoop]: 2320 mSDtfsCounter, 2191 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2191 SdHoareTripleChecker+Valid, 2320 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:13,388 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2191 Valid, 2320 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:13,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11978 states. [2022-01-11 01:48:14,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11978 to 11978. [2022-01-11 01:48:14,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11978 states, 11976 states have (on average 1.2895791583166332) internal successors, (15444), 11977 states have internal predecessors, (15444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:14,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11978 states to 11978 states and 15444 transitions. [2022-01-11 01:48:14,595 INFO L78 Accepts]: Start accepts. Automaton has 11978 states and 15444 transitions. Word has length 165 [2022-01-11 01:48:14,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:14,595 INFO L470 AbstractCegarLoop]: Abstraction has 11978 states and 15444 transitions. [2022-01-11 01:48:14,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:14,595 INFO L276 IsEmpty]: Start isEmpty. Operand 11978 states and 15444 transitions. [2022-01-11 01:48:14,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-11 01:48:14,596 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:14,596 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:14,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-11 01:48:14,596 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:14,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:14,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1390798994, now seen corresponding path program 1 times [2022-01-11 01:48:14,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:14,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481265917] [2022-01-11 01:48:14,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:14,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:14,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:14,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:14,639 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:14,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481265917] [2022-01-11 01:48:14,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481265917] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:14,639 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:14,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:48:14,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258725994] [2022-01-11 01:48:14,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:14,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:14,640 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:14,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:14,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:14,641 INFO L87 Difference]: Start difference. First operand 11978 states and 15444 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:15,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:15,819 INFO L93 Difference]: Finished difference Result 23922 states and 30842 transitions. [2022-01-11 01:48:15,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:15,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2022-01-11 01:48:15,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:15,834 INFO L225 Difference]: With dead ends: 23922 [2022-01-11 01:48:15,834 INFO L226 Difference]: Without dead ends: 11978 [2022-01-11 01:48:15,844 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:15,845 INFO L933 BasicCegarLoop]: 2287 mSDtfsCounter, 2050 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2050 SdHoareTripleChecker+Valid, 2401 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:15,845 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2050 Valid, 2401 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:15,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11978 states. [2022-01-11 01:48:16,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11978 to 11978. [2022-01-11 01:48:16,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11978 states, 11976 states have (on average 1.2830661322645291) internal successors, (15366), 11977 states have internal predecessors, (15366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:16,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11978 states to 11978 states and 15366 transitions. [2022-01-11 01:48:16,897 INFO L78 Accepts]: Start accepts. Automaton has 11978 states and 15366 transitions. Word has length 165 [2022-01-11 01:48:16,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:16,897 INFO L470 AbstractCegarLoop]: Abstraction has 11978 states and 15366 transitions. [2022-01-11 01:48:16,897 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:16,897 INFO L276 IsEmpty]: Start isEmpty. Operand 11978 states and 15366 transitions. [2022-01-11 01:48:16,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-11 01:48:16,898 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:16,898 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:16,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-01-11 01:48:16,898 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:16,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:16,899 INFO L85 PathProgramCache]: Analyzing trace with hash -429184977, now seen corresponding path program 1 times [2022-01-11 01:48:16,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:16,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185954263] [2022-01-11 01:48:16,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:16,899 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:16,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:16,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:16,944 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:16,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185954263] [2022-01-11 01:48:16,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185954263] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:16,944 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:16,944 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:48:16,944 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163712368] [2022-01-11 01:48:16,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:16,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:16,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:16,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:16,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:16,945 INFO L87 Difference]: Start difference. First operand 11978 states and 15366 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:18,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:18,012 INFO L93 Difference]: Finished difference Result 23911 states and 30675 transitions. [2022-01-11 01:48:18,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:18,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2022-01-11 01:48:18,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:18,024 INFO L225 Difference]: With dead ends: 23911 [2022-01-11 01:48:18,024 INFO L226 Difference]: Without dead ends: 11978 [2022-01-11 01:48:18,031 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:18,031 INFO L933 BasicCegarLoop]: 2268 mSDtfsCounter, 2021 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2021 SdHoareTripleChecker+Valid, 2381 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:18,031 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2021 Valid, 2381 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:18,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11978 states. [2022-01-11 01:48:19,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11978 to 11978. [2022-01-11 01:48:19,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11978 states, 11976 states have (on average 1.276553106212425) internal successors, (15288), 11977 states have internal predecessors, (15288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:19,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11978 states to 11978 states and 15288 transitions. [2022-01-11 01:48:19,094 INFO L78 Accepts]: Start accepts. Automaton has 11978 states and 15288 transitions. Word has length 165 [2022-01-11 01:48:19,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:19,094 INFO L470 AbstractCegarLoop]: Abstraction has 11978 states and 15288 transitions. [2022-01-11 01:48:19,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:19,094 INFO L276 IsEmpty]: Start isEmpty. Operand 11978 states and 15288 transitions. [2022-01-11 01:48:19,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-11 01:48:19,095 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:19,095 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:19,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-01-11 01:48:19,095 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:19,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:19,096 INFO L85 PathProgramCache]: Analyzing trace with hash -939719154, now seen corresponding path program 1 times [2022-01-11 01:48:19,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:19,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122812198] [2022-01-11 01:48:19,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:19,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:19,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:19,141 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:19,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122812198] [2022-01-11 01:48:19,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122812198] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:19,142 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:19,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:48:19,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110711753] [2022-01-11 01:48:19,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:19,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:19,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:19,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:19,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:19,143 INFO L87 Difference]: Start difference. First operand 11978 states and 15288 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:21,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:21,235 INFO L93 Difference]: Finished difference Result 35536 states and 45360 transitions. [2022-01-11 01:48:21,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:21,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2022-01-11 01:48:21,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:21,260 INFO L225 Difference]: With dead ends: 35536 [2022-01-11 01:48:21,260 INFO L226 Difference]: Without dead ends: 23605 [2022-01-11 01:48:21,271 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:21,271 INFO L933 BasicCegarLoop]: 2268 mSDtfsCounter, 2073 mSDsluCounter, 2058 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2073 SdHoareTripleChecker+Valid, 4326 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:21,271 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2073 Valid, 4326 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:21,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23605 states. [2022-01-11 01:48:23,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23605 to 22893. [2022-01-11 01:48:23,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22893 states, 22891 states have (on average 1.272552531562623) internal successors, (29130), 22892 states have internal predecessors, (29130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:23,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22893 states to 22893 states and 29130 transitions. [2022-01-11 01:48:23,354 INFO L78 Accepts]: Start accepts. Automaton has 22893 states and 29130 transitions. Word has length 165 [2022-01-11 01:48:23,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:23,355 INFO L470 AbstractCegarLoop]: Abstraction has 22893 states and 29130 transitions. [2022-01-11 01:48:23,355 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:23,355 INFO L276 IsEmpty]: Start isEmpty. Operand 22893 states and 29130 transitions. [2022-01-11 01:48:23,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-01-11 01:48:23,366 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:23,367 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:23,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-01-11 01:48:23,367 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:23,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:23,367 INFO L85 PathProgramCache]: Analyzing trace with hash -778491454, now seen corresponding path program 1 times [2022-01-11 01:48:23,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:23,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939231691] [2022-01-11 01:48:23,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:23,368 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:23,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:23,438 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:23,438 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:23,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939231691] [2022-01-11 01:48:23,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939231691] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:23,438 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:23,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:48:23,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118684102] [2022-01-11 01:48:23,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:23,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:48:23,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:23,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:48:23,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:48:23,439 INFO L87 Difference]: Start difference. First operand 22893 states and 29130 transitions. Second operand has 5 states, 5 states have (on average 53.6) internal successors, (268), 5 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:27,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:27,252 INFO L93 Difference]: Finished difference Result 62468 states and 79830 transitions. [2022-01-11 01:48:27,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:48:27,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 53.6) internal successors, (268), 5 states have internal predecessors, (268), 0 states have call successors, (0), 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 268 [2022-01-11 01:48:27,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:27,311 INFO L225 Difference]: With dead ends: 62468 [2022-01-11 01:48:27,312 INFO L226 Difference]: Without dead ends: 39681 [2022-01-11 01:48:27,334 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 01:48:27,335 INFO L933 BasicCegarLoop]: 2301 mSDtfsCounter, 5322 mSDsluCounter, 4845 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5322 SdHoareTripleChecker+Valid, 7146 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:27,335 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5322 Valid, 7146 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-11 01:48:27,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39681 states. [2022-01-11 01:48:30,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39681 to 22941. [2022-01-11 01:48:30,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22941 states, 22939 states have (on average 1.2635685949692663) internal successors, (28985), 22940 states have internal predecessors, (28985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:30,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22941 states to 22941 states and 28985 transitions. [2022-01-11 01:48:30,056 INFO L78 Accepts]: Start accepts. Automaton has 22941 states and 28985 transitions. Word has length 268 [2022-01-11 01:48:30,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:30,056 INFO L470 AbstractCegarLoop]: Abstraction has 22941 states and 28985 transitions. [2022-01-11 01:48:30,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 53.6) internal successors, (268), 5 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:30,057 INFO L276 IsEmpty]: Start isEmpty. Operand 22941 states and 28985 transitions. [2022-01-11 01:48:30,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-01-11 01:48:30,080 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:30,080 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:30,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-01-11 01:48:30,080 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:30,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:30,081 INFO L85 PathProgramCache]: Analyzing trace with hash -760870592, now seen corresponding path program 1 times [2022-01-11 01:48:30,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:30,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278390342] [2022-01-11 01:48:30,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:30,081 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:30,138 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:30,139 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:30,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278390342] [2022-01-11 01:48:30,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278390342] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:30,139 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:30,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:30,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181597712] [2022-01-11 01:48:30,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:30,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:30,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:30,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:30,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:30,140 INFO L87 Difference]: Start difference. First operand 22941 states and 28985 transitions. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:34,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:34,917 INFO L93 Difference]: Finished difference Result 67971 states and 85492 transitions. [2022-01-11 01:48:34,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:34,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 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 268 [2022-01-11 01:48:34,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:34,977 INFO L225 Difference]: With dead ends: 67971 [2022-01-11 01:48:34,977 INFO L226 Difference]: Without dead ends: 45191 [2022-01-11 01:48:34,999 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-11 01:48:34,999 INFO L933 BasicCegarLoop]: 2604 mSDtfsCounter, 2089 mSDsluCounter, 2235 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2089 SdHoareTripleChecker+Valid, 4839 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:34,999 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2089 Valid, 4839 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:35,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45191 states. [2022-01-11 01:48:39,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45191 to 44519. [2022-01-11 01:48:40,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44519 states, 44517 states have (on average 1.2534537367747154) internal successors, (55800), 44518 states have internal predecessors, (55800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:40,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44519 states to 44519 states and 55800 transitions. [2022-01-11 01:48:40,134 INFO L78 Accepts]: Start accepts. Automaton has 44519 states and 55800 transitions. Word has length 268 [2022-01-11 01:48:40,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:40,135 INFO L470 AbstractCegarLoop]: Abstraction has 44519 states and 55800 transitions. [2022-01-11 01:48:40,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:40,135 INFO L276 IsEmpty]: Start isEmpty. Operand 44519 states and 55800 transitions. [2022-01-11 01:48:40,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-01-11 01:48:40,149 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:40,149 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:40,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-01-11 01:48:40,149 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:40,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:40,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1220303907, now seen corresponding path program 1 times [2022-01-11 01:48:40,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:40,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894280581] [2022-01-11 01:48:40,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:40,150 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:40,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:40,181 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-11 01:48:40,181 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:40,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894280581] [2022-01-11 01:48:40,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894280581] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:40,181 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:40,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:40,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115250155] [2022-01-11 01:48:40,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:40,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:40,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:40,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:40,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:40,182 INFO L87 Difference]: Start difference. First operand 44519 states and 55800 transitions. Second operand has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:43,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:43,676 INFO L93 Difference]: Finished difference Result 77901 states and 97574 transitions. [2022-01-11 01:48:43,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:43,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 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 268 [2022-01-11 01:48:43,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:43,716 INFO L225 Difference]: With dead ends: 77901 [2022-01-11 01:48:43,716 INFO L226 Difference]: Without dead ends: 33439 [2022-01-11 01:48:43,737 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-11 01:48:43,738 INFO L933 BasicCegarLoop]: 2268 mSDtfsCounter, 2263 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2263 SdHoareTripleChecker+Valid, 2269 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:43,738 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2263 Valid, 2269 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:43,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33439 states. [2022-01-11 01:48:47,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33439 to 33439. [2022-01-11 01:48:47,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33439 states, 33437 states have (on average 1.2513682447588002) internal successors, (41842), 33438 states have internal predecessors, (41842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:47,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33439 states to 33439 states and 41842 transitions. [2022-01-11 01:48:47,435 INFO L78 Accepts]: Start accepts. Automaton has 33439 states and 41842 transitions. Word has length 268 [2022-01-11 01:48:47,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:47,436 INFO L470 AbstractCegarLoop]: Abstraction has 33439 states and 41842 transitions. [2022-01-11 01:48:47,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:47,436 INFO L276 IsEmpty]: Start isEmpty. Operand 33439 states and 41842 transitions. [2022-01-11 01:48:47,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2022-01-11 01:48:47,447 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:47,448 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:47,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-01-11 01:48:47,451 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:47,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:47,452 INFO L85 PathProgramCache]: Analyzing trace with hash -374784475, now seen corresponding path program 1 times [2022-01-11 01:48:47,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:47,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097580908] [2022-01-11 01:48:47,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:47,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:47,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:47,530 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:47,530 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:47,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097580908] [2022-01-11 01:48:47,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097580908] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:47,531 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:47,531 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:47,531 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878043461] [2022-01-11 01:48:47,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:47,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:47,531 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:47,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:47,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:47,532 INFO L87 Difference]: Start difference. First operand 33439 states and 41842 transitions. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)