/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_LAZY.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-10 20:01:30,309 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 20:01:30,310 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 20:01:30,346 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 20:01:30,347 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 20:01:30,349 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 20:01:30,351 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 20:01:30,354 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 20:01:30,360 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 20:01:30,360 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 20:01:30,361 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 20:01:30,361 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 20:01:30,361 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 20:01:30,362 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 20:01:30,363 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 20:01:30,363 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 20:01:30,364 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 20:01:30,367 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 20:01:30,368 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 20:01:30,372 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 20:01:30,374 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 20:01:30,377 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 20:01:30,379 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 20:01:30,380 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 20:01:30,384 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 20:01:30,384 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 20:01:30,384 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 20:01:30,385 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 20:01:30,385 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 20:01:30,385 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 20:01:30,386 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 20:01:30,386 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 20:01:30,386 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 20:01:30,387 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 20:01:30,387 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 20:01:30,387 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 20:01:30,388 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 20:01:30,388 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 20:01:30,388 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 20:01:30,389 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 20:01:30,389 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 20:01:30,393 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf [2022-01-10 20:01:30,413 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 20:01:30,414 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 20:01:30,414 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 20:01:30,414 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 20:01:30,415 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 20:01:30,415 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 20:01:30,415 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 20:01:30,417 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 20:01:30,417 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 20:01:30,417 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 20:01:30,418 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 20:01:30,418 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 20:01:30,418 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 20:01:30,418 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 20:01:30,418 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 20:01:30,418 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 20:01:30,418 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 20:01:30,418 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 20:01:30,419 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 20:01:30,419 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 20:01:30,419 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 20:01:30,420 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 20:01:30,420 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 20:01:30,420 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 20:01:30,420 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 20:01:30,420 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 20:01:30,420 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 20:01:30,420 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 20:01:30,420 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 20:01:30,420 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 20:01:30,421 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 20:01:30,421 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 20:01:30,421 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 20:01:30,421 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_LAZY WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 20:01:30,610 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 20:01:30,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 20:01:30,629 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 20:01:30,629 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 20:01:30,630 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 20:01:30,631 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-10 20:01:30,678 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53417aa3c/aade3bb529be441ea90b862d510e0ee2/FLAGd4fd4caa5 [2022-01-10 20:01:31,019 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 20:01:31,020 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-1.c [2022-01-10 20:01:31,031 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53417aa3c/aade3bb529be441ea90b862d510e0ee2/FLAGd4fd4caa5 [2022-01-10 20:01:31,430 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53417aa3c/aade3bb529be441ea90b862d510e0ee2 [2022-01-10 20:01:31,432 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 20:01:31,433 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 20:01:31,434 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 20:01:31,434 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 20:01:31,437 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 20:01:31,438 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 08:01:31" (1/1) ... [2022-01-10 20:01:31,438 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f0096bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:01:31, skipping insertion in model container [2022-01-10 20:01:31,438 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 08:01:31" (1/1) ... [2022-01-10 20:01:31,443 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 20:01:31,474 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 20:01:31,618 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-10 20:01:31,649 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-10 20:01:31,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 20:01:31,727 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 20:01:31,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-10 20:01:31,756 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-10 20:01:31,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 20:01:31,833 INFO L208 MainTranslator]: Completed translation [2022-01-10 20:01:31,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:01:31 WrapperNode [2022-01-10 20:01:31,833 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 20:01:31,834 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 20:01:31,834 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 20:01:31,834 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 20:01:31,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:01:31" (1/1) ... [2022-01-10 20:01:31,864 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:01:31" (1/1) ... [2022-01-10 20:01:31,969 INFO L137 Inliner]: procedures = 73, calls = 85, calls flagged for inlining = 80, calls inlined = 289, statements flattened = 4399 [2022-01-10 20:01:31,969 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 20:01:31,970 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 20:01:31,970 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 20:01:31,970 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 20:01:31,992 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:01:31" (1/1) ... [2022-01-10 20:01:31,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:01:31" (1/1) ... [2022-01-10 20:01:32,018 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:01:31" (1/1) ... [2022-01-10 20:01:32,018 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:01:31" (1/1) ... [2022-01-10 20:01:32,077 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:01:31" (1/1) ... [2022-01-10 20:01:32,115 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:01:31" (1/1) ... [2022-01-10 20:01:32,122 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:01:31" (1/1) ... [2022-01-10 20:01:32,145 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 20:01:32,147 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 20:01:32,147 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 20:01:32,147 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 20:01:32,149 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:01:31" (1/1) ... [2022-01-10 20:01:32,155 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 20:01:32,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 20:01:32,174 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 20:01:32,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 20:01:32,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 20:01:32,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 20:01:32,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 20:01:32,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 20:01:32,363 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 20:01:32,364 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 20:01:34,085 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 20:01:34,102 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 20:01:34,103 INFO L299 CfgBuilder]: Removed 19 assume(true) statements. [2022-01-10 20:01:34,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:01:34 BoogieIcfgContainer [2022-01-10 20:01:34,109 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 20:01:34,110 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 20:01:34,110 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 20:01:34,111 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 20:01:34,114 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:01:34" (1/1) ... [2022-01-10 20:01:34,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 08:01:34 BasicIcfg [2022-01-10 20:01:34,439 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 20:01:34,440 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 20:01:34,440 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 20:01:34,442 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 20:01:34,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 08:01:31" (1/4) ... [2022-01-10 20:01:34,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@225f531a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 08:01:34, skipping insertion in model container [2022-01-10 20:01:34,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:01:31" (2/4) ... [2022-01-10 20:01:34,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@225f531a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 08:01:34, skipping insertion in model container [2022-01-10 20:01:34,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:01:34" (3/4) ... [2022-01-10 20:01:34,444 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@225f531a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 08:01:34, skipping insertion in model container [2022-01-10 20:01:34,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 08:01:34" (4/4) ... [2022-01-10 20:01:34,444 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.12.cil-1.cTransformedIcfg [2022-01-10 20:01:34,450 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 20:01:34,450 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-01-10 20:01:34,497 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 20:01:34,501 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 20:01:34,501 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-10 20:01:34,565 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-10 20:01:34,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 20:01:34,572 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:34,572 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-10 20:01:34,573 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-10 20:01:34,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:34,581 INFO L85 PathProgramCache]: Analyzing trace with hash -176383202, now seen corresponding path program 1 times [2022-01-10 20:01:34,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:34,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383536601] [2022-01-10 20:01:34,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:34,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:34,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:34,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:34,858 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:34,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383536601] [2022-01-10 20:01:34,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383536601] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:34,858 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:34,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:01:34,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221563848] [2022-01-10 20:01:34,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:34,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:34,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:34,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:34,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:34,903 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-10 20:01:35,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:35,105 INFO L93 Difference]: Finished difference Result 3656 states and 5461 transitions. [2022-01-10 20:01:35,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:35,107 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-10 20:01:35,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:35,127 INFO L225 Difference]: With dead ends: 3656 [2022-01-10 20:01:35,127 INFO L226 Difference]: Without dead ends: 1933 [2022-01-10 20:01:35,136 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:35,142 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-10 20:01:35,143 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-10 20:01:35,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2022-01-10 20:01:35,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 1912. [2022-01-10 20:01:35,251 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-10 20:01:35,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1912 states to 1912 states and 2824 transitions. [2022-01-10 20:01:35,256 INFO L78 Accepts]: Start accepts. Automaton has 1912 states and 2824 transitions. Word has length 36 [2022-01-10 20:01:35,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:35,257 INFO L470 AbstractCegarLoop]: Abstraction has 1912 states and 2824 transitions. [2022-01-10 20:01:35,257 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-10 20:01:35,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 2824 transitions. [2022-01-10 20:01:35,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-10 20:01:35,262 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:35,263 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-10 20:01:35,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 20:01:35,263 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-10 20:01:35,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:35,267 INFO L85 PathProgramCache]: Analyzing trace with hash -411400193, now seen corresponding path program 1 times [2022-01-10 20:01:35,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:35,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95461848] [2022-01-10 20:01:35,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:35,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:35,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:35,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:35,367 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:35,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95461848] [2022-01-10 20:01:35,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95461848] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:35,368 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:35,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:01:35,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368894794] [2022-01-10 20:01:35,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:35,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:35,371 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:35,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:35,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:35,374 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-10 20:01:35,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:35,423 INFO L93 Difference]: Finished difference Result 2081 states and 3059 transitions. [2022-01-10 20:01:35,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:35,424 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-10 20:01:35,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:35,430 INFO L225 Difference]: With dead ends: 2081 [2022-01-10 20:01:35,431 INFO L226 Difference]: Without dead ends: 1970 [2022-01-10 20:01:35,431 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:35,432 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-10 20:01:35,433 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-10 20:01:35,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2022-01-10 20:01:35,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1965. [2022-01-10 20:01:35,496 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-10 20:01:35,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 2897 transitions. [2022-01-10 20:01:35,500 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 2897 transitions. Word has length 37 [2022-01-10 20:01:35,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:35,500 INFO L470 AbstractCegarLoop]: Abstraction has 1965 states and 2897 transitions. [2022-01-10 20:01:35,501 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-10 20:01:35,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 2897 transitions. [2022-01-10 20:01:35,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-10 20:01:35,506 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:35,507 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-10 20:01:35,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 20:01:35,512 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-10 20:01:35,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:35,514 INFO L85 PathProgramCache]: Analyzing trace with hash -565697026, now seen corresponding path program 1 times [2022-01-10 20:01:35,514 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:35,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357951637] [2022-01-10 20:01:35,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:35,514 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:35,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:35,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:35,574 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:35,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357951637] [2022-01-10 20:01:35,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357951637] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:35,575 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:35,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:01:35,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513856894] [2022-01-10 20:01:35,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:35,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:35,576 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:35,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:35,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:35,577 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-10 20:01:35,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:35,629 INFO L93 Difference]: Finished difference Result 2282 states and 3333 transitions. [2022-01-10 20:01:35,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:35,630 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-10 20:01:35,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:35,636 INFO L225 Difference]: With dead ends: 2282 [2022-01-10 20:01:35,636 INFO L226 Difference]: Without dead ends: 2118 [2022-01-10 20:01:35,639 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:35,642 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-10 20:01:35,643 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-10 20:01:35,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2118 states. [2022-01-10 20:01:35,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2118 to 2096. [2022-01-10 20:01:35,686 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-10 20:01:35,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2096 states to 2096 states and 3073 transitions. [2022-01-10 20:01:35,690 INFO L78 Accepts]: Start accepts. Automaton has 2096 states and 3073 transitions. Word has length 37 [2022-01-10 20:01:35,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:35,691 INFO L470 AbstractCegarLoop]: Abstraction has 2096 states and 3073 transitions. [2022-01-10 20:01:35,691 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-10 20:01:35,691 INFO L276 IsEmpty]: Start isEmpty. Operand 2096 states and 3073 transitions. [2022-01-10 20:01:35,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-10 20:01:35,693 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:35,693 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-10 20:01:35,693 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 20:01:35,693 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-10 20:01:35,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:35,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1638365307, now seen corresponding path program 1 times [2022-01-10 20:01:35,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:35,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153559561] [2022-01-10 20:01:35,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:35,694 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:35,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:35,755 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-10 20:01:35,755 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:35,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153559561] [2022-01-10 20:01:35,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153559561] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:35,756 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:35,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:01:35,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203736110] [2022-01-10 20:01:35,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:35,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:35,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:35,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:35,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:35,757 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-10 20:01:35,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:35,808 INFO L93 Difference]: Finished difference Result 2547 states and 3680 transitions. [2022-01-10 20:01:35,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:35,808 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-10 20:01:35,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:35,814 INFO L225 Difference]: With dead ends: 2547 [2022-01-10 20:01:35,815 INFO L226 Difference]: Without dead ends: 2252 [2022-01-10 20:01:35,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-10 20:01:35,820 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-10 20:01:35,821 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-10 20:01:35,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2252 states. [2022-01-10 20:01:35,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2252 to 2252. [2022-01-10 20:01:35,914 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-10 20:01:35,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2252 states to 2252 states and 3261 transitions. [2022-01-10 20:01:35,918 INFO L78 Accepts]: Start accepts. Automaton has 2252 states and 3261 transitions. Word has length 51 [2022-01-10 20:01:35,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:35,918 INFO L470 AbstractCegarLoop]: Abstraction has 2252 states and 3261 transitions. [2022-01-10 20:01:35,919 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-10 20:01:35,919 INFO L276 IsEmpty]: Start isEmpty. Operand 2252 states and 3261 transitions. [2022-01-10 20:01:35,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-10 20:01:35,919 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:35,920 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:01:35,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 20:01:35,920 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-10 20:01:35,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:35,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1481808314, now seen corresponding path program 1 times [2022-01-10 20:01:35,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:35,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431680012] [2022-01-10 20:01:35,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:35,921 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:35,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:35,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:35,971 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:35,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431680012] [2022-01-10 20:01:35,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431680012] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:35,971 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:35,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:01:35,971 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925412768] [2022-01-10 20:01:35,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:35,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:35,972 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:35,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:35,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:35,972 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-10 20:01:36,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:36,031 INFO L93 Difference]: Finished difference Result 2725 states and 3877 transitions. [2022-01-10 20:01:36,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:36,031 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-10 20:01:36,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:36,040 INFO L225 Difference]: With dead ends: 2725 [2022-01-10 20:01:36,040 INFO L226 Difference]: Without dead ends: 2360 [2022-01-10 20:01:36,041 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:36,042 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-10 20:01:36,042 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-10 20:01:36,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2360 states. [2022-01-10 20:01:36,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2360 to 2360. [2022-01-10 20:01:36,078 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-10 20:01:36,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2360 states to 2360 states and 3389 transitions. [2022-01-10 20:01:36,085 INFO L78 Accepts]: Start accepts. Automaton has 2360 states and 3389 transitions. Word has length 55 [2022-01-10 20:01:36,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:36,087 INFO L470 AbstractCegarLoop]: Abstraction has 2360 states and 3389 transitions. [2022-01-10 20:01:36,088 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-10 20:01:36,088 INFO L276 IsEmpty]: Start isEmpty. Operand 2360 states and 3389 transitions. [2022-01-10 20:01:36,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-10 20:01:36,090 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:36,090 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-10 20:01:36,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 20:01:36,090 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-10 20:01:36,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:36,091 INFO L85 PathProgramCache]: Analyzing trace with hash -972314080, now seen corresponding path program 1 times [2022-01-10 20:01:36,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:36,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799087949] [2022-01-10 20:01:36,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:36,091 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:36,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:36,210 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-10 20:01:36,211 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:36,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799087949] [2022-01-10 20:01:36,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799087949] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:36,211 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:36,211 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:01:36,211 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545648500] [2022-01-10 20:01:36,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:36,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:01:36,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:36,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:01:36,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:01:36,212 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-10 20:01:36,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:36,350 INFO L93 Difference]: Finished difference Result 3443 states and 4793 transitions. [2022-01-10 20:01:36,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:01:36,351 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-10 20:01:36,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:36,357 INFO L225 Difference]: With dead ends: 3443 [2022-01-10 20:01:36,358 INFO L226 Difference]: Without dead ends: 3020 [2022-01-10 20:01:36,360 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-10 20:01:36,361 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-10 20:01:36,361 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-10 20:01:36,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3020 states. [2022-01-10 20:01:36,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3020 to 2384. [2022-01-10 20:01:36,408 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-10 20:01:36,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2384 states to 2384 states and 3409 transitions. [2022-01-10 20:01:36,411 INFO L78 Accepts]: Start accepts. Automaton has 2384 states and 3409 transitions. Word has length 56 [2022-01-10 20:01:36,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:36,412 INFO L470 AbstractCegarLoop]: Abstraction has 2384 states and 3409 transitions. [2022-01-10 20:01:36,412 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-10 20:01:36,412 INFO L276 IsEmpty]: Start isEmpty. Operand 2384 states and 3409 transitions. [2022-01-10 20:01:36,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-10 20:01:36,413 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:36,413 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-10 20:01:36,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 20:01:36,413 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-10 20:01:36,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:36,414 INFO L85 PathProgramCache]: Analyzing trace with hash -621514143, now seen corresponding path program 1 times [2022-01-10 20:01:36,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:36,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354010818] [2022-01-10 20:01:36,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:36,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:36,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:36,467 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-10 20:01:36,467 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:36,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354010818] [2022-01-10 20:01:36,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354010818] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:36,468 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:36,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:01:36,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782130470] [2022-01-10 20:01:36,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:36,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:01:36,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:36,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:01:36,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:01:36,469 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-10 20:01:36,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:36,614 INFO L93 Difference]: Finished difference Result 3173 states and 4419 transitions. [2022-01-10 20:01:36,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:01:36,615 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-10 20:01:36,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:36,621 INFO L225 Difference]: With dead ends: 3173 [2022-01-10 20:01:36,621 INFO L226 Difference]: Without dead ends: 2675 [2022-01-10 20:01:36,622 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-10 20:01:36,623 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-10 20:01:36,623 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-10 20:01:36,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2675 states. [2022-01-10 20:01:36,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2675 to 2282. [2022-01-10 20:01:36,680 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-10 20:01:36,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 2282 states and 3278 transitions. [2022-01-10 20:01:36,683 INFO L78 Accepts]: Start accepts. Automaton has 2282 states and 3278 transitions. Word has length 56 [2022-01-10 20:01:36,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:36,685 INFO L470 AbstractCegarLoop]: Abstraction has 2282 states and 3278 transitions. [2022-01-10 20:01:36,685 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-10 20:01:36,685 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 3278 transitions. [2022-01-10 20:01:36,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-10 20:01:36,686 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:36,686 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-10 20:01:36,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 20:01:36,686 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-10 20:01:36,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:36,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1596273601, now seen corresponding path program 1 times [2022-01-10 20:01:36,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:36,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349612443] [2022-01-10 20:01:36,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:36,687 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:36,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:36,771 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-10 20:01:36,771 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:36,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349612443] [2022-01-10 20:01:36,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349612443] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:36,771 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:36,771 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 20:01:36,771 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815379029] [2022-01-10 20:01:36,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:36,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 20:01:36,772 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:36,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 20:01:36,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 20:01:36,773 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-10 20:01:36,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:36,892 INFO L93 Difference]: Finished difference Result 2332 states and 3338 transitions. [2022-01-10 20:01:36,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 20:01:36,893 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-10 20:01:36,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:36,899 INFO L225 Difference]: With dead ends: 2332 [2022-01-10 20:01:36,899 INFO L226 Difference]: Without dead ends: 2330 [2022-01-10 20:01:36,900 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-10 20:01:36,900 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-10 20:01:36,900 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-10 20:01:36,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2330 states. [2022-01-10 20:01:36,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2330 to 2280. [2022-01-10 20:01:36,994 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-10 20:01:36,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 3275 transitions. [2022-01-10 20:01:36,997 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 3275 transitions. Word has length 56 [2022-01-10 20:01:36,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:36,997 INFO L470 AbstractCegarLoop]: Abstraction has 2280 states and 3275 transitions. [2022-01-10 20:01:36,998 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-10 20:01:36,998 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 3275 transitions. [2022-01-10 20:01:37,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-10 20:01:37,007 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:37,007 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-10 20:01:37,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 20:01:37,007 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-10 20:01:37,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:37,008 INFO L85 PathProgramCache]: Analyzing trace with hash -2055119878, now seen corresponding path program 1 times [2022-01-10 20:01:37,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:37,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018515656] [2022-01-10 20:01:37,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:37,008 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:37,182 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-10 20:01:37,182 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:37,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018515656] [2022-01-10 20:01:37,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018515656] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 20:01:37,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210022962] [2022-01-10 20:01:37,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:37,183 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 20:01:37,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 20:01:37,185 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-10 20:01:37,186 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-10 20:01:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:37,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-10 20:01:37,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 20:01:37,581 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-10 20:01:37,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 20:01:37,825 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-10 20:01:37,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210022962] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 20:01:37,826 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 20:01:37,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-10 20:01:37,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103076373] [2022-01-10 20:01:37,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 20:01:37,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 20:01:37,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:37,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 20:01:37,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-10 20:01:37,827 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-10 20:01:38,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:38,065 INFO L93 Difference]: Finished difference Result 3166 states and 4403 transitions. [2022-01-10 20:01:38,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 20:01:38,067 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-10 20:01:38,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:38,075 INFO L225 Difference]: With dead ends: 3166 [2022-01-10 20:01:38,075 INFO L226 Difference]: Without dead ends: 3164 [2022-01-10 20:01:38,076 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-10 20:01:38,076 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-10 20:01:38,076 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-10 20:01:38,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3164 states. [2022-01-10 20:01:38,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3164 to 2552. [2022-01-10 20:01:38,231 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-10 20:01:38,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 3628 transitions. [2022-01-10 20:01:38,235 INFO L78 Accepts]: Start accepts. Automaton has 2552 states and 3628 transitions. Word has length 57 [2022-01-10 20:01:38,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:38,235 INFO L470 AbstractCegarLoop]: Abstraction has 2552 states and 3628 transitions. [2022-01-10 20:01:38,235 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-10 20:01:38,235 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 3628 transitions. [2022-01-10 20:01:38,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-01-10 20:01:38,236 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:38,236 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-10 20:01:38,257 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-10 20:01:38,444 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-10 20:01:38,445 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-10 20:01:38,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:38,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1559204522, now seen corresponding path program 2 times [2022-01-10 20:01:38,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:38,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629833022] [2022-01-10 20:01:38,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:38,446 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:38,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:38,512 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-10 20:01:38,512 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:38,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629833022] [2022-01-10 20:01:38,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629833022] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:38,512 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:38,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:01:38,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233895999] [2022-01-10 20:01:38,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:38,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:38,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:38,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:38,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:38,514 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-10 20:01:38,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:38,637 INFO L93 Difference]: Finished difference Result 3059 states and 4288 transitions. [2022-01-10 20:01:38,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:38,638 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-10 20:01:38,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:38,644 INFO L225 Difference]: With dead ends: 3059 [2022-01-10 20:01:38,644 INFO L226 Difference]: Without dead ends: 2463 [2022-01-10 20:01:38,645 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:38,645 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-10 20:01:38,646 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-10 20:01:38,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2463 states. [2022-01-10 20:01:38,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2463 to 2437. [2022-01-10 20:01:38,738 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-10 20:01:38,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2437 states to 2437 states and 3476 transitions. [2022-01-10 20:01:38,742 INFO L78 Accepts]: Start accepts. Automaton has 2437 states and 3476 transitions. Word has length 72 [2022-01-10 20:01:38,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:38,742 INFO L470 AbstractCegarLoop]: Abstraction has 2437 states and 3476 transitions. [2022-01-10 20:01:38,742 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-10 20:01:38,742 INFO L276 IsEmpty]: Start isEmpty. Operand 2437 states and 3476 transitions. [2022-01-10 20:01:38,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-10 20:01:38,743 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:38,744 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-10 20:01:38,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 20:01:38,744 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-10 20:01:38,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:38,744 INFO L85 PathProgramCache]: Analyzing trace with hash 848611532, now seen corresponding path program 1 times [2022-01-10 20:01:38,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:38,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905663821] [2022-01-10 20:01:38,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:38,745 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:38,777 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-10 20:01:38,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:38,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905663821] [2022-01-10 20:01:38,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905663821] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:38,778 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:38,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:01:38,778 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855832159] [2022-01-10 20:01:38,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:38,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:38,779 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:38,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:38,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:38,779 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-10 20:01:38,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:38,919 INFO L93 Difference]: Finished difference Result 3091 states and 4303 transitions. [2022-01-10 20:01:38,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:38,919 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-10 20:01:38,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:38,925 INFO L225 Difference]: With dead ends: 3091 [2022-01-10 20:01:38,926 INFO L226 Difference]: Without dead ends: 2455 [2022-01-10 20:01:38,928 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:38,928 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-10 20:01:38,928 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-10 20:01:38,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2455 states. [2022-01-10 20:01:39,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2455 to 2437. [2022-01-10 20:01:39,021 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-10 20:01:39,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2437 states to 2437 states and 3456 transitions. [2022-01-10 20:01:39,025 INFO L78 Accepts]: Start accepts. Automaton has 2437 states and 3456 transitions. Word has length 84 [2022-01-10 20:01:39,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:39,025 INFO L470 AbstractCegarLoop]: Abstraction has 2437 states and 3456 transitions. [2022-01-10 20:01:39,025 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-10 20:01:39,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2437 states and 3456 transitions. [2022-01-10 20:01:39,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-01-10 20:01:39,026 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:39,026 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-10 20:01:39,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 20:01:39,026 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-10 20:01:39,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:39,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1399297825, now seen corresponding path program 1 times [2022-01-10 20:01:39,027 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:39,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197270166] [2022-01-10 20:01:39,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:39,027 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:39,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:39,055 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-10 20:01:39,055 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:39,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197270166] [2022-01-10 20:01:39,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197270166] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:39,055 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:39,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:01:39,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368862723] [2022-01-10 20:01:39,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:39,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:39,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:39,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:39,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:39,056 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-10 20:01:39,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:39,141 INFO L93 Difference]: Finished difference Result 2701 states and 3774 transitions. [2022-01-10 20:01:39,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:39,142 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-10 20:01:39,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:39,146 INFO L225 Difference]: With dead ends: 2701 [2022-01-10 20:01:39,146 INFO L226 Difference]: Without dead ends: 1795 [2022-01-10 20:01:39,148 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:39,148 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-10 20:01:39,148 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-10 20:01:39,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1795 states. [2022-01-10 20:01:39,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1795 to 1795. [2022-01-10 20:01:39,217 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-10 20:01:39,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2660 transitions. [2022-01-10 20:01:39,220 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2660 transitions. Word has length 85 [2022-01-10 20:01:39,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:39,221 INFO L470 AbstractCegarLoop]: Abstraction has 1795 states and 2660 transitions. [2022-01-10 20:01:39,221 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-10 20:01:39,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2660 transitions. [2022-01-10 20:01:39,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:39,222 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:39,222 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-10 20:01:39,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 20:01:39,222 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-10 20:01:39,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:39,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1578430486, now seen corresponding path program 1 times [2022-01-10 20:01:39,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:39,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728512351] [2022-01-10 20:01:39,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:39,223 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:39,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:39,259 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:39,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728512351] [2022-01-10 20:01:39,259 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728512351] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:39,260 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:39,260 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:01:39,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67776452] [2022-01-10 20:01:39,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:39,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:39,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:39,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:39,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:39,261 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-10 20:01:39,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:39,338 INFO L93 Difference]: Finished difference Result 3584 states and 5313 transitions. [2022-01-10 20:01:39,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:39,338 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-10 20:01:39,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:39,342 INFO L225 Difference]: With dead ends: 3584 [2022-01-10 20:01:39,342 INFO L226 Difference]: Without dead ends: 1795 [2022-01-10 20:01:39,345 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:39,345 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-10 20:01:39,345 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-10 20:01:39,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1795 states. [2022-01-10 20:01:39,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1795 to 1795. [2022-01-10 20:01:39,408 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-10 20:01:39,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2659 transitions. [2022-01-10 20:01:39,411 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2659 transitions. Word has length 165 [2022-01-10 20:01:39,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:39,411 INFO L470 AbstractCegarLoop]: Abstraction has 1795 states and 2659 transitions. [2022-01-10 20:01:39,411 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-10 20:01:39,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2659 transitions. [2022-01-10 20:01:39,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:39,412 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:39,412 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-10 20:01:39,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 20:01:39,413 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-10 20:01:39,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:39,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1971429431, now seen corresponding path program 1 times [2022-01-10 20:01:39,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:39,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407100958] [2022-01-10 20:01:39,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:39,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:39,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:39,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:39,451 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:39,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407100958] [2022-01-10 20:01:39,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407100958] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:39,451 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:39,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:01:39,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080928544] [2022-01-10 20:01:39,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:39,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:39,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:39,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:39,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:39,452 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-10 20:01:39,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:39,514 INFO L93 Difference]: Finished difference Result 3575 states and 5294 transitions. [2022-01-10 20:01:39,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:39,515 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-10 20:01:39,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:39,521 INFO L225 Difference]: With dead ends: 3575 [2022-01-10 20:01:39,521 INFO L226 Difference]: Without dead ends: 1795 [2022-01-10 20:01:39,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:39,523 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-10 20:01:39,523 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-10 20:01:39,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1795 states. [2022-01-10 20:01:39,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1795 to 1795. [2022-01-10 20:01:39,570 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-10 20:01:39,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2658 transitions. [2022-01-10 20:01:39,572 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2658 transitions. Word has length 165 [2022-01-10 20:01:39,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:39,573 INFO L470 AbstractCegarLoop]: Abstraction has 1795 states and 2658 transitions. [2022-01-10 20:01:39,573 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-10 20:01:39,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2658 transitions. [2022-01-10 20:01:39,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:39,573 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:39,574 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-10 20:01:39,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 20:01:39,574 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-10 20:01:39,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:39,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1248138998, now seen corresponding path program 1 times [2022-01-10 20:01:39,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:39,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374976919] [2022-01-10 20:01:39,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:39,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:39,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:39,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:39,616 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:39,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374976919] [2022-01-10 20:01:39,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374976919] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:39,616 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:39,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:39,617 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488823447] [2022-01-10 20:01:39,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:39,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:39,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:39,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:39,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:39,618 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-10 20:01:39,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:39,758 INFO L93 Difference]: Finished difference Result 5108 states and 7543 transitions. [2022-01-10 20:01:39,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:39,758 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-10 20:01:39,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:39,763 INFO L225 Difference]: With dead ends: 5108 [2022-01-10 20:01:39,763 INFO L226 Difference]: Without dead ends: 3333 [2022-01-10 20:01:39,766 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:39,767 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-10 20:01:39,767 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-10 20:01:39,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3333 states. [2022-01-10 20:01:39,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3333 to 3329. [2022-01-10 20:01:39,869 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-10 20:01:39,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4911 transitions. [2022-01-10 20:01:39,873 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4911 transitions. Word has length 165 [2022-01-10 20:01:39,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:39,873 INFO L470 AbstractCegarLoop]: Abstraction has 3329 states and 4911 transitions. [2022-01-10 20:01:39,873 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-10 20:01:39,874 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4911 transitions. [2022-01-10 20:01:39,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:39,874 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:39,874 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-10 20:01:39,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 20:01:39,875 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-10 20:01:39,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:39,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1349110762, now seen corresponding path program 1 times [2022-01-10 20:01:39,875 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:39,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600918131] [2022-01-10 20:01:39,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:39,875 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:39,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:39,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:39,917 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:39,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600918131] [2022-01-10 20:01:39,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600918131] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:39,917 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:39,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:39,917 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697429193] [2022-01-10 20:01:39,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:39,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:39,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:39,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:39,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:39,918 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-10 20:01:40,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:40,033 INFO L93 Difference]: Finished difference Result 6637 states and 9789 transitions. [2022-01-10 20:01:40,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:40,033 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-10 20:01:40,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:40,038 INFO L225 Difference]: With dead ends: 6637 [2022-01-10 20:01:40,039 INFO L226 Difference]: Without dead ends: 3329 [2022-01-10 20:01:40,042 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:40,043 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-10 20:01:40,043 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-10 20:01:40,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2022-01-10 20:01:40,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3329. [2022-01-10 20:01:40,194 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-10 20:01:40,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4903 transitions. [2022-01-10 20:01:40,198 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4903 transitions. Word has length 165 [2022-01-10 20:01:40,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:40,198 INFO L470 AbstractCegarLoop]: Abstraction has 3329 states and 4903 transitions. [2022-01-10 20:01:40,198 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-10 20:01:40,199 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4903 transitions. [2022-01-10 20:01:40,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:40,199 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:40,200 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-10 20:01:40,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 20:01:40,200 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-10 20:01:40,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:40,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1060958966, now seen corresponding path program 1 times [2022-01-10 20:01:40,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:40,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019287695] [2022-01-10 20:01:40,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:40,200 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:40,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:40,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:40,236 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:40,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019287695] [2022-01-10 20:01:40,236 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019287695] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:40,236 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:40,236 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:40,236 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368283436] [2022-01-10 20:01:40,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:40,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:40,237 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:40,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:40,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:40,237 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-10 20:01:40,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:40,355 INFO L93 Difference]: Finished difference Result 6636 states and 9772 transitions. [2022-01-10 20:01:40,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:40,356 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-10 20:01:40,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:40,362 INFO L225 Difference]: With dead ends: 6636 [2022-01-10 20:01:40,362 INFO L226 Difference]: Without dead ends: 3329 [2022-01-10 20:01:40,366 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:40,366 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-10 20:01:40,367 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-10 20:01:40,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2022-01-10 20:01:40,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3329. [2022-01-10 20:01:40,477 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-10 20:01:40,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4895 transitions. [2022-01-10 20:01:40,481 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4895 transitions. Word has length 165 [2022-01-10 20:01:40,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:40,481 INFO L470 AbstractCegarLoop]: Abstraction has 3329 states and 4895 transitions. [2022-01-10 20:01:40,481 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-10 20:01:40,481 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4895 transitions. [2022-01-10 20:01:40,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:40,482 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:40,482 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-10 20:01:40,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 20:01:40,483 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-10 20:01:40,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:40,483 INFO L85 PathProgramCache]: Analyzing trace with hash 307419158, now seen corresponding path program 1 times [2022-01-10 20:01:40,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:40,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948237842] [2022-01-10 20:01:40,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:40,483 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:40,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:40,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:40,524 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:40,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948237842] [2022-01-10 20:01:40,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948237842] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:40,524 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:40,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:40,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590600086] [2022-01-10 20:01:40,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:40,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:40,525 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:40,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:40,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:40,526 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-10 20:01:40,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:40,662 INFO L93 Difference]: Finished difference Result 6635 states and 9755 transitions. [2022-01-10 20:01:40,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:40,663 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-10 20:01:40,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:40,668 INFO L225 Difference]: With dead ends: 6635 [2022-01-10 20:01:40,668 INFO L226 Difference]: Without dead ends: 3329 [2022-01-10 20:01:40,673 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:40,673 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-10 20:01:40,673 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-10 20:01:40,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2022-01-10 20:01:40,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3329. [2022-01-10 20:01:40,791 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-10 20:01:40,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4887 transitions. [2022-01-10 20:01:40,796 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4887 transitions. Word has length 165 [2022-01-10 20:01:40,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:40,796 INFO L470 AbstractCegarLoop]: Abstraction has 3329 states and 4887 transitions. [2022-01-10 20:01:40,796 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-10 20:01:40,797 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4887 transitions. [2022-01-10 20:01:40,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:40,797 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:40,797 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-10 20:01:40,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 20:01:40,798 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-10 20:01:40,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:40,798 INFO L85 PathProgramCache]: Analyzing trace with hash 6016758, now seen corresponding path program 1 times [2022-01-10 20:01:40,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:40,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650643089] [2022-01-10 20:01:40,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:40,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:40,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:40,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:40,853 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:40,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650643089] [2022-01-10 20:01:40,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650643089] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:40,853 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:40,853 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:40,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777411891] [2022-01-10 20:01:40,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:40,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:40,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:40,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:40,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:40,854 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-10 20:01:41,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:41,023 INFO L93 Difference]: Finished difference Result 6633 states and 9736 transitions. [2022-01-10 20:01:41,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:41,024 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-10 20:01:41,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:41,029 INFO L225 Difference]: With dead ends: 6633 [2022-01-10 20:01:41,029 INFO L226 Difference]: Without dead ends: 3329 [2022-01-10 20:01:41,035 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:41,035 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-10 20:01:41,035 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-10 20:01:41,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2022-01-10 20:01:41,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3329. [2022-01-10 20:01:41,193 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-10 20:01:41,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4879 transitions. [2022-01-10 20:01:41,198 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4879 transitions. Word has length 165 [2022-01-10 20:01:41,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:41,198 INFO L470 AbstractCegarLoop]: Abstraction has 3329 states and 4879 transitions. [2022-01-10 20:01:41,198 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-10 20:01:41,198 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4879 transitions. [2022-01-10 20:01:41,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:41,199 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:41,199 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-10 20:01:41,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 20:01:41,200 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-10 20:01:41,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:41,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1878326742, now seen corresponding path program 1 times [2022-01-10 20:01:41,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:41,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640708842] [2022-01-10 20:01:41,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:41,200 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:41,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:41,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:41,238 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:41,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640708842] [2022-01-10 20:01:41,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640708842] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:41,238 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:41,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:41,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695883882] [2022-01-10 20:01:41,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:41,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:41,239 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:41,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:41,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:41,239 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-10 20:01:41,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:41,383 INFO L93 Difference]: Finished difference Result 6632 states and 9719 transitions. [2022-01-10 20:01:41,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:41,384 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-10 20:01:41,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:41,389 INFO L225 Difference]: With dead ends: 6632 [2022-01-10 20:01:41,390 INFO L226 Difference]: Without dead ends: 3329 [2022-01-10 20:01:41,395 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:41,395 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-10 20:01:41,396 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-10 20:01:41,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2022-01-10 20:01:41,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3329. [2022-01-10 20:01:41,523 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-10 20:01:41,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4871 transitions. [2022-01-10 20:01:41,528 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4871 transitions. Word has length 165 [2022-01-10 20:01:41,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:41,528 INFO L470 AbstractCegarLoop]: Abstraction has 3329 states and 4871 transitions. [2022-01-10 20:01:41,528 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-10 20:01:41,528 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4871 transitions. [2022-01-10 20:01:41,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:41,529 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:41,529 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-10 20:01:41,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 20:01:41,529 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-10 20:01:41,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:41,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1661629174, now seen corresponding path program 1 times [2022-01-10 20:01:41,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:41,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238113721] [2022-01-10 20:01:41,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:41,530 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:41,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:41,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:41,590 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:41,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238113721] [2022-01-10 20:01:41,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238113721] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:41,590 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:41,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:41,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181996119] [2022-01-10 20:01:41,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:41,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:41,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:41,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:41,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:41,592 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-10 20:01:41,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:41,743 INFO L93 Difference]: Finished difference Result 6631 states and 9702 transitions. [2022-01-10 20:01:41,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:41,744 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-10 20:01:41,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:41,749 INFO L225 Difference]: With dead ends: 6631 [2022-01-10 20:01:41,750 INFO L226 Difference]: Without dead ends: 3329 [2022-01-10 20:01:41,754 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:41,755 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-10 20:01:41,755 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-10 20:01:41,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2022-01-10 20:01:41,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3329. [2022-01-10 20:01:41,895 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-10 20:01:41,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4863 transitions. [2022-01-10 20:01:41,900 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4863 transitions. Word has length 165 [2022-01-10 20:01:41,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:41,900 INFO L470 AbstractCegarLoop]: Abstraction has 3329 states and 4863 transitions. [2022-01-10 20:01:41,901 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-10 20:01:41,901 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4863 transitions. [2022-01-10 20:01:41,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:41,902 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:41,902 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-10 20:01:41,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-10 20:01:41,902 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-10 20:01:41,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:41,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1793186262, now seen corresponding path program 1 times [2022-01-10 20:01:41,902 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:41,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899954420] [2022-01-10 20:01:41,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:41,903 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:41,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:41,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:41,949 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:41,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899954420] [2022-01-10 20:01:41,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899954420] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:41,950 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:41,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:41,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785477494] [2022-01-10 20:01:41,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:41,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:41,951 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:41,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:41,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:41,952 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-10 20:01:42,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:42,095 INFO L93 Difference]: Finished difference Result 6630 states and 9685 transitions. [2022-01-10 20:01:42,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:42,095 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-10 20:01:42,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:42,101 INFO L225 Difference]: With dead ends: 6630 [2022-01-10 20:01:42,101 INFO L226 Difference]: Without dead ends: 3329 [2022-01-10 20:01:42,106 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:42,106 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-10 20:01:42,107 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-10 20:01:42,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2022-01-10 20:01:42,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3329. [2022-01-10 20:01:42,256 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-10 20:01:42,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4855 transitions. [2022-01-10 20:01:42,261 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4855 transitions. Word has length 165 [2022-01-10 20:01:42,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:42,261 INFO L470 AbstractCegarLoop]: Abstraction has 3329 states and 4855 transitions. [2022-01-10 20:01:42,261 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-10 20:01:42,261 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4855 transitions. [2022-01-10 20:01:42,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:42,262 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:42,263 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-10 20:01:42,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-10 20:01:42,263 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-10 20:01:42,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:42,263 INFO L85 PathProgramCache]: Analyzing trace with hash 689051382, now seen corresponding path program 1 times [2022-01-10 20:01:42,263 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:42,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119997060] [2022-01-10 20:01:42,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:42,264 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:42,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:42,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:42,298 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:42,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119997060] [2022-01-10 20:01:42,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119997060] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:42,299 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:42,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:42,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131343667] [2022-01-10 20:01:42,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:42,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:42,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:42,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:42,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:42,301 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-10 20:01:42,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:42,440 INFO L93 Difference]: Finished difference Result 6629 states and 9668 transitions. [2022-01-10 20:01:42,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:42,441 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-10 20:01:42,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:42,447 INFO L225 Difference]: With dead ends: 6629 [2022-01-10 20:01:42,447 INFO L226 Difference]: Without dead ends: 3329 [2022-01-10 20:01:42,452 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:42,453 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-10 20:01:42,453 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-10 20:01:42,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2022-01-10 20:01:42,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3329. [2022-01-10 20:01:42,579 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-10 20:01:42,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4847 transitions. [2022-01-10 20:01:42,584 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4847 transitions. Word has length 165 [2022-01-10 20:01:42,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:42,584 INFO L470 AbstractCegarLoop]: Abstraction has 3329 states and 4847 transitions. [2022-01-10 20:01:42,584 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-10 20:01:42,584 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4847 transitions. [2022-01-10 20:01:42,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:42,585 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:42,585 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-10 20:01:42,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-10 20:01:42,585 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-10 20:01:42,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:42,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1286228522, now seen corresponding path program 1 times [2022-01-10 20:01:42,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:42,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409425295] [2022-01-10 20:01:42,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:42,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:42,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:42,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:42,617 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:42,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409425295] [2022-01-10 20:01:42,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409425295] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:42,617 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:42,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:42,617 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062518810] [2022-01-10 20:01:42,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:42,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:42,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:42,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:42,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:42,618 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-10 20:01:42,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:42,771 INFO L93 Difference]: Finished difference Result 6627 states and 9649 transitions. [2022-01-10 20:01:42,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:42,772 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-10 20:01:42,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:42,776 INFO L225 Difference]: With dead ends: 6627 [2022-01-10 20:01:42,776 INFO L226 Difference]: Without dead ends: 3329 [2022-01-10 20:01:42,780 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:42,780 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-10 20:01:42,781 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-10 20:01:42,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2022-01-10 20:01:42,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3329. [2022-01-10 20:01:42,909 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-10 20:01:42,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4839 transitions. [2022-01-10 20:01:42,914 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4839 transitions. Word has length 165 [2022-01-10 20:01:42,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:42,914 INFO L470 AbstractCegarLoop]: Abstraction has 3329 states and 4839 transitions. [2022-01-10 20:01:42,914 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-10 20:01:42,914 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4839 transitions. [2022-01-10 20:01:42,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:42,915 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:42,915 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-10 20:01:42,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-10 20:01:42,915 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-10 20:01:42,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:42,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1572048054, now seen corresponding path program 1 times [2022-01-10 20:01:42,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:42,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809739939] [2022-01-10 20:01:42,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:42,916 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:42,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:42,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:42,953 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:42,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809739939] [2022-01-10 20:01:42,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809739939] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:42,954 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:42,954 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:42,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204794841] [2022-01-10 20:01:42,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:42,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:42,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:42,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:42,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:42,955 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-10 20:01:43,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:43,133 INFO L93 Difference]: Finished difference Result 6626 states and 9632 transitions. [2022-01-10 20:01:43,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:43,133 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-10 20:01:43,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:43,138 INFO L225 Difference]: With dead ends: 6626 [2022-01-10 20:01:43,138 INFO L226 Difference]: Without dead ends: 3329 [2022-01-10 20:01:43,142 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:43,142 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-10 20:01:43,142 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-10 20:01:43,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2022-01-10 20:01:43,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3329. [2022-01-10 20:01:43,319 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-10 20:01:43,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4831 transitions. [2022-01-10 20:01:43,326 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4831 transitions. Word has length 165 [2022-01-10 20:01:43,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:43,326 INFO L470 AbstractCegarLoop]: Abstraction has 3329 states and 4831 transitions. [2022-01-10 20:01:43,326 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-10 20:01:43,327 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4831 transitions. [2022-01-10 20:01:43,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:43,327 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:43,327 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-10 20:01:43,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-10 20:01:43,328 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-10 20:01:43,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:43,328 INFO L85 PathProgramCache]: Analyzing trace with hash -691054122, now seen corresponding path program 1 times [2022-01-10 20:01:43,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:43,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666888583] [2022-01-10 20:01:43,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:43,329 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:43,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:43,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:43,366 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:43,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666888583] [2022-01-10 20:01:43,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666888583] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:43,366 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:43,366 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:43,366 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986628385] [2022-01-10 20:01:43,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:43,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:43,366 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:43,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:43,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:43,367 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-10 20:01:43,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:43,551 INFO L93 Difference]: Finished difference Result 6625 states and 9615 transitions. [2022-01-10 20:01:43,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:43,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-10 20:01:43,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:43,558 INFO L225 Difference]: With dead ends: 6625 [2022-01-10 20:01:43,559 INFO L226 Difference]: Without dead ends: 3329 [2022-01-10 20:01:43,564 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:43,565 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-10 20:01:43,565 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-10 20:01:43,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2022-01-10 20:01:43,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3329. [2022-01-10 20:01:43,706 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-10 20:01:43,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4795 transitions. [2022-01-10 20:01:43,713 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4795 transitions. Word has length 165 [2022-01-10 20:01:43,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:43,713 INFO L470 AbstractCegarLoop]: Abstraction has 3329 states and 4795 transitions. [2022-01-10 20:01:43,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-10 20:01:43,713 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4795 transitions. [2022-01-10 20:01:43,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:43,714 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:43,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-10 20:01:43,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-10 20:01:43,714 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-10 20:01:43,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:43,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1047348021, now seen corresponding path program 1 times [2022-01-10 20:01:43,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:43,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518379460] [2022-01-10 20:01:43,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:43,715 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:43,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:43,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:43,751 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:43,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518379460] [2022-01-10 20:01:43,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518379460] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:43,751 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:43,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:43,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682056140] [2022-01-10 20:01:43,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:43,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:43,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:43,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:43,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:43,753 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-10 20:01:43,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:43,940 INFO L93 Difference]: Finished difference Result 6623 states and 9540 transitions. [2022-01-10 20:01:43,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:43,940 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-10 20:01:43,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:43,946 INFO L225 Difference]: With dead ends: 6623 [2022-01-10 20:01:43,946 INFO L226 Difference]: Without dead ends: 3329 [2022-01-10 20:01:43,950 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:43,951 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-10 20:01:43,951 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-10 20:01:43,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2022-01-10 20:01:44,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3329. [2022-01-10 20:01:44,092 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-10 20:01:44,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4759 transitions. [2022-01-10 20:01:44,097 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4759 transitions. Word has length 165 [2022-01-10 20:01:44,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:44,097 INFO L470 AbstractCegarLoop]: Abstraction has 3329 states and 4759 transitions. [2022-01-10 20:01:44,097 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-10 20:01:44,097 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4759 transitions. [2022-01-10 20:01:44,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:44,098 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:44,098 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-10 20:01:44,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-10 20:01:44,098 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-10 20:01:44,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:44,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1259203348, now seen corresponding path program 1 times [2022-01-10 20:01:44,099 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:44,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188939491] [2022-01-10 20:01:44,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:44,099 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:44,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:44,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:44,132 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:44,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188939491] [2022-01-10 20:01:44,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188939491] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:44,132 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:44,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:44,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401161347] [2022-01-10 20:01:44,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:44,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:44,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:44,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:44,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:44,133 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-10 20:01:44,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:44,307 INFO L93 Difference]: Finished difference Result 6622 states and 9467 transitions. [2022-01-10 20:01:44,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:44,308 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-10 20:01:44,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:44,313 INFO L225 Difference]: With dead ends: 6622 [2022-01-10 20:01:44,313 INFO L226 Difference]: Without dead ends: 3329 [2022-01-10 20:01:44,317 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:44,318 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-10 20:01:44,318 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-10 20:01:44,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2022-01-10 20:01:44,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3329. [2022-01-10 20:01:44,497 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-10 20:01:44,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4723 transitions. [2022-01-10 20:01:44,501 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4723 transitions. Word has length 165 [2022-01-10 20:01:44,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:44,502 INFO L470 AbstractCegarLoop]: Abstraction has 3329 states and 4723 transitions. [2022-01-10 20:01:44,502 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-10 20:01:44,502 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4723 transitions. [2022-01-10 20:01:44,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:44,502 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:44,503 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-10 20:01:44,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-10 20:01:44,503 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-10 20:01:44,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:44,503 INFO L85 PathProgramCache]: Analyzing trace with hash 763499635, now seen corresponding path program 1 times [2022-01-10 20:01:44,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:44,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661190395] [2022-01-10 20:01:44,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:44,503 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:44,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:44,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:44,536 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:44,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661190395] [2022-01-10 20:01:44,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661190395] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:44,536 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:44,536 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:44,536 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26797502] [2022-01-10 20:01:44,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:44,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:44,537 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:44,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:44,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:44,537 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-10 20:01:44,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:44,712 INFO L93 Difference]: Finished difference Result 6621 states and 9394 transitions. [2022-01-10 20:01:44,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:44,713 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-10 20:01:44,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:44,717 INFO L225 Difference]: With dead ends: 6621 [2022-01-10 20:01:44,717 INFO L226 Difference]: Without dead ends: 3329 [2022-01-10 20:01:44,723 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:44,723 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-10 20:01:44,723 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-10 20:01:44,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2022-01-10 20:01:44,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3329. [2022-01-10 20:01:44,875 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-10 20:01:44,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4687 transitions. [2022-01-10 20:01:44,879 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4687 transitions. Word has length 165 [2022-01-10 20:01:44,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:44,880 INFO L470 AbstractCegarLoop]: Abstraction has 3329 states and 4687 transitions. [2022-01-10 20:01:44,880 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-10 20:01:44,880 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4687 transitions. [2022-01-10 20:01:44,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:44,881 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:44,881 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:01:44,881 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-10 20:01:44,881 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-10 20:01:44,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:44,882 INFO L85 PathProgramCache]: Analyzing trace with hash -720815406, now seen corresponding path program 1 times [2022-01-10 20:01:44,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:44,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950964013] [2022-01-10 20:01:44,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:44,882 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:44,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:44,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-10 20:01:44,967 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:44,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950964013] [2022-01-10 20:01:44,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950964013] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:44,967 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:44,967 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:44,967 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172415926] [2022-01-10 20:01:44,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:44,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:44,968 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:44,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:44,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:44,968 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-10 20:01:45,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:45,207 INFO L93 Difference]: Finished difference Result 6620 states and 9321 transitions. [2022-01-10 20:01:45,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:45,208 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-10 20:01:45,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:45,211 INFO L225 Difference]: With dead ends: 6620 [2022-01-10 20:01:45,211 INFO L226 Difference]: Without dead ends: 3329 [2022-01-10 20:01:45,216 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:45,217 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-10 20:01:45,217 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-10 20:01:45,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2022-01-10 20:01:45,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3329. [2022-01-10 20:01:45,370 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-10 20:01:45,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4651 transitions. [2022-01-10 20:01:45,375 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4651 transitions. Word has length 165 [2022-01-10 20:01:45,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:45,375 INFO L470 AbstractCegarLoop]: Abstraction has 3329 states and 4651 transitions. [2022-01-10 20:01:45,375 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-10 20:01:45,375 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4651 transitions. [2022-01-10 20:01:45,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:45,376 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:45,376 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-10 20:01:45,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-10 20:01:45,378 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-10 20:01:45,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:45,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1148497231, now seen corresponding path program 1 times [2022-01-10 20:01:45,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:45,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970199535] [2022-01-10 20:01:45,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:45,378 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:45,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:45,425 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:45,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970199535] [2022-01-10 20:01:45,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970199535] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:45,426 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:45,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:45,426 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077990131] [2022-01-10 20:01:45,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:45,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:45,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:45,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:45,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:45,427 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-10 20:01:45,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:45,614 INFO L93 Difference]: Finished difference Result 6619 states and 9248 transitions. [2022-01-10 20:01:45,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:45,614 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-10 20:01:45,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:45,618 INFO L225 Difference]: With dead ends: 6619 [2022-01-10 20:01:45,618 INFO L226 Difference]: Without dead ends: 3329 [2022-01-10 20:01:45,622 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:45,623 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-10 20:01:45,623 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-10 20:01:45,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2022-01-10 20:01:45,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3329. [2022-01-10 20:01:45,825 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-10 20:01:45,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4615 transitions. [2022-01-10 20:01:45,830 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4615 transitions. Word has length 165 [2022-01-10 20:01:45,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:45,830 INFO L470 AbstractCegarLoop]: Abstraction has 3329 states and 4615 transitions. [2022-01-10 20:01:45,830 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-10 20:01:45,830 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4615 transitions. [2022-01-10 20:01:45,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:45,831 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:45,831 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-10 20:01:45,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-10 20:01:45,832 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-10 20:01:45,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:45,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1174620272, now seen corresponding path program 1 times [2022-01-10 20:01:45,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:45,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621365952] [2022-01-10 20:01:45,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:45,833 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:45,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:45,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:45,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:45,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621365952] [2022-01-10 20:01:45,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621365952] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:45,871 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:45,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:45,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328695255] [2022-01-10 20:01:45,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:45,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:45,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:45,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:45,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:45,873 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-10 20:01:46,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:46,125 INFO L93 Difference]: Finished difference Result 6618 states and 9175 transitions. [2022-01-10 20:01:46,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:46,126 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-10 20:01:46,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:46,130 INFO L225 Difference]: With dead ends: 6618 [2022-01-10 20:01:46,130 INFO L226 Difference]: Without dead ends: 3329 [2022-01-10 20:01:46,134 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:46,135 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-10 20:01:46,135 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-10 20:01:46,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2022-01-10 20:01:46,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3329. [2022-01-10 20:01:46,353 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-10 20:01:46,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4579 transitions. [2022-01-10 20:01:46,357 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4579 transitions. Word has length 165 [2022-01-10 20:01:46,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:46,357 INFO L470 AbstractCegarLoop]: Abstraction has 3329 states and 4579 transitions. [2022-01-10 20:01:46,357 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-10 20:01:46,357 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4579 transitions. [2022-01-10 20:01:46,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:46,358 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:46,358 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-10 20:01:46,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-10 20:01:46,358 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-10 20:01:46,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:46,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1053064687, now seen corresponding path program 1 times [2022-01-10 20:01:46,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:46,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382366229] [2022-01-10 20:01:46,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:46,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:46,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:46,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:46,395 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:46,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382366229] [2022-01-10 20:01:46,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382366229] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:46,396 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:46,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:46,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263443180] [2022-01-10 20:01:46,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:46,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:46,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:46,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:46,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:46,397 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-10 20:01:46,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:46,599 INFO L93 Difference]: Finished difference Result 6617 states and 9102 transitions. [2022-01-10 20:01:46,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:46,600 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-10 20:01:46,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:46,605 INFO L225 Difference]: With dead ends: 6617 [2022-01-10 20:01:46,605 INFO L226 Difference]: Without dead ends: 3329 [2022-01-10 20:01:46,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-10 20:01:46,610 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-10 20:01:46,610 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-10 20:01:46,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2022-01-10 20:01:46,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3329. [2022-01-10 20:01:46,827 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-10 20:01:46,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4543 transitions. [2022-01-10 20:01:46,831 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4543 transitions. Word has length 165 [2022-01-10 20:01:46,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:46,831 INFO L470 AbstractCegarLoop]: Abstraction has 3329 states and 4543 transitions. [2022-01-10 20:01:46,831 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-10 20:01:46,831 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4543 transitions. [2022-01-10 20:01:46,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:46,832 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:46,832 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-10 20:01:46,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-10 20:01:46,832 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-10 20:01:46,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:46,832 INFO L85 PathProgramCache]: Analyzing trace with hash -431759026, now seen corresponding path program 1 times [2022-01-10 20:01:46,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:46,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095886900] [2022-01-10 20:01:46,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:46,833 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:46,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:46,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:46,868 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:46,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095886900] [2022-01-10 20:01:46,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095886900] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:46,868 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:46,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:46,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565826908] [2022-01-10 20:01:46,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:46,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:46,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:46,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:46,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:46,869 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-10 20:01:47,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:47,077 INFO L93 Difference]: Finished difference Result 6616 states and 9029 transitions. [2022-01-10 20:01:47,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:47,078 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-10 20:01:47,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:47,082 INFO L225 Difference]: With dead ends: 6616 [2022-01-10 20:01:47,082 INFO L226 Difference]: Without dead ends: 3329 [2022-01-10 20:01:47,085 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:47,086 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-10 20:01:47,086 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-10 20:01:47,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2022-01-10 20:01:47,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3329. [2022-01-10 20:01:47,264 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-10 20:01:47,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4507 transitions. [2022-01-10 20:01:47,267 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4507 transitions. Word has length 165 [2022-01-10 20:01:47,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:47,267 INFO L470 AbstractCegarLoop]: Abstraction has 3329 states and 4507 transitions. [2022-01-10 20:01:47,267 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-10 20:01:47,267 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4507 transitions. [2022-01-10 20:01:47,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:47,268 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:47,268 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-10 20:01:47,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-10 20:01:47,268 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-10 20:01:47,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:47,269 INFO L85 PathProgramCache]: Analyzing trace with hash 447288877, now seen corresponding path program 1 times [2022-01-10 20:01:47,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:47,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105594394] [2022-01-10 20:01:47,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:47,269 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:47,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:47,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:47,303 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:47,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105594394] [2022-01-10 20:01:47,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105594394] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:47,303 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:47,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:47,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507363068] [2022-01-10 20:01:47,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:47,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:47,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:47,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:47,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:47,305 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-10 20:01:47,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:47,512 INFO L93 Difference]: Finished difference Result 6615 states and 8956 transitions. [2022-01-10 20:01:47,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:47,513 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-10 20:01:47,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:47,517 INFO L225 Difference]: With dead ends: 6615 [2022-01-10 20:01:47,517 INFO L226 Difference]: Without dead ends: 3329 [2022-01-10 20:01:47,521 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:47,522 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-10 20:01:47,522 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-10 20:01:47,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2022-01-10 20:01:47,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3329. [2022-01-10 20:01:47,734 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-10 20:01:47,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4471 transitions. [2022-01-10 20:01:47,737 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4471 transitions. Word has length 165 [2022-01-10 20:01:47,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:47,738 INFO L470 AbstractCegarLoop]: Abstraction has 3329 states and 4471 transitions. [2022-01-10 20:01:47,738 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-10 20:01:47,738 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4471 transitions. [2022-01-10 20:01:47,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:47,739 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:47,739 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-10 20:01:47,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-10 20:01:47,739 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-10 20:01:47,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:47,739 INFO L85 PathProgramCache]: Analyzing trace with hash 595212300, now seen corresponding path program 1 times [2022-01-10 20:01:47,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:47,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669540956] [2022-01-10 20:01:47,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:47,740 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:47,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:47,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:47,780 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:47,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669540956] [2022-01-10 20:01:47,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669540956] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:47,780 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:47,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:47,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022823753] [2022-01-10 20:01:47,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:47,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:47,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:47,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:47,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:47,781 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-10 20:01:48,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:48,013 INFO L93 Difference]: Finished difference Result 6614 states and 8883 transitions. [2022-01-10 20:01:48,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:48,013 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-10 20:01:48,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:48,018 INFO L225 Difference]: With dead ends: 6614 [2022-01-10 20:01:48,018 INFO L226 Difference]: Without dead ends: 3329 [2022-01-10 20:01:48,022 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:48,023 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-10 20:01:48,023 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-10 20:01:48,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2022-01-10 20:01:48,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3329. [2022-01-10 20:01:48,205 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-10 20:01:48,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4435 transitions. [2022-01-10 20:01:48,208 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4435 transitions. Word has length 165 [2022-01-10 20:01:48,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:48,209 INFO L470 AbstractCegarLoop]: Abstraction has 3329 states and 4435 transitions. [2022-01-10 20:01:48,209 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-10 20:01:48,209 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4435 transitions. [2022-01-10 20:01:48,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:48,209 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:48,209 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:01:48,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-10 20:01:48,210 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-10 20:01:48,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:48,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1611359381, now seen corresponding path program 1 times [2022-01-10 20:01:48,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:48,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597899246] [2022-01-10 20:01:48,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:48,213 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:48,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:48,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:48,270 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:48,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597899246] [2022-01-10 20:01:48,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597899246] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:48,270 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:48,271 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:01:48,271 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396697041] [2022-01-10 20:01:48,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:48,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:01:48,272 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:48,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:01:48,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:01:48,273 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-10 20:01:48,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:48,649 INFO L93 Difference]: Finished difference Result 7584 states and 10187 transitions. [2022-01-10 20:01:48,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:01:48,649 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-10 20:01:48,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:48,654 INFO L225 Difference]: With dead ends: 7584 [2022-01-10 20:01:48,655 INFO L226 Difference]: Without dead ends: 4307 [2022-01-10 20:01:48,658 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 20:01:48,658 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-10 20:01:48,659 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-10 20:01:48,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4307 states. [2022-01-10 20:01:48,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4307 to 3335. [2022-01-10 20:01:48,912 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-10 20:01:48,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3335 states to 3335 states and 4413 transitions. [2022-01-10 20:01:48,917 INFO L78 Accepts]: Start accepts. Automaton has 3335 states and 4413 transitions. Word has length 165 [2022-01-10 20:01:48,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:48,917 INFO L470 AbstractCegarLoop]: Abstraction has 3335 states and 4413 transitions. [2022-01-10 20:01:48,917 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-10 20:01:48,917 INFO L276 IsEmpty]: Start isEmpty. Operand 3335 states and 4413 transitions. [2022-01-10 20:01:48,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:48,918 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:48,918 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-10 20:01:48,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-10 20:01:48,918 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-10 20:01:48,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:48,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1500590380, now seen corresponding path program 1 times [2022-01-10 20:01:48,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:48,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520458022] [2022-01-10 20:01:48,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:48,919 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:48,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:48,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:48,956 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:48,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520458022] [2022-01-10 20:01:48,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520458022] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:48,957 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:48,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:48,957 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246117824] [2022-01-10 20:01:48,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:48,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:48,957 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:48,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:48,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:48,958 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-10 20:01:49,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:49,407 INFO L93 Difference]: Finished difference Result 9569 states and 12654 transitions. [2022-01-10 20:01:49,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:49,408 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-10 20:01:49,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:49,416 INFO L225 Difference]: With dead ends: 9569 [2022-01-10 20:01:49,416 INFO L226 Difference]: Without dead ends: 6288 [2022-01-10 20:01:49,423 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:49,423 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-10 20:01:49,423 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-10 20:01:49,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6288 states. [2022-01-10 20:01:49,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6288 to 6280. [2022-01-10 20:01:49,971 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-10 20:01:49,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6280 states to 6280 states and 8276 transitions. [2022-01-10 20:01:49,980 INFO L78 Accepts]: Start accepts. Automaton has 6280 states and 8276 transitions. Word has length 165 [2022-01-10 20:01:49,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:49,980 INFO L470 AbstractCegarLoop]: Abstraction has 6280 states and 8276 transitions. [2022-01-10 20:01:49,980 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-10 20:01:49,981 INFO L276 IsEmpty]: Start isEmpty. Operand 6280 states and 8276 transitions. [2022-01-10 20:01:49,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:49,981 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:49,981 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-10 20:01:49,982 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-10 20:01:49,982 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-10 20:01:49,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:49,982 INFO L85 PathProgramCache]: Analyzing trace with hash 688035563, now seen corresponding path program 1 times [2022-01-10 20:01:49,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:49,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909969225] [2022-01-10 20:01:49,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:49,982 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:49,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:50,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:50,021 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:50,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909969225] [2022-01-10 20:01:50,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909969225] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:50,021 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:50,021 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:01:50,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770073115] [2022-01-10 20:01:50,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:50,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:01:50,022 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:50,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:01:50,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:01:50,023 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-10 20:01:50,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:50,629 INFO L93 Difference]: Finished difference Result 13815 states and 18292 transitions. [2022-01-10 20:01:50,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:01:50,629 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-10 20:01:50,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:50,639 INFO L225 Difference]: With dead ends: 13815 [2022-01-10 20:01:50,639 INFO L226 Difference]: Without dead ends: 7600 [2022-01-10 20:01:50,646 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 20:01:50,647 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-10 20:01:50,648 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-10 20:01:50,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7600 states. [2022-01-10 20:01:51,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7600 to 6286. [2022-01-10 20:01:51,126 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-10 20:01:51,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6286 states to 6286 states and 8227 transitions. [2022-01-10 20:01:51,135 INFO L78 Accepts]: Start accepts. Automaton has 6286 states and 8227 transitions. Word has length 165 [2022-01-10 20:01:51,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:51,136 INFO L470 AbstractCegarLoop]: Abstraction has 6286 states and 8227 transitions. [2022-01-10 20:01:51,136 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-10 20:01:51,136 INFO L276 IsEmpty]: Start isEmpty. Operand 6286 states and 8227 transitions. [2022-01-10 20:01:51,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:51,136 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:51,136 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-10 20:01:51,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-10 20:01:51,152 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-10 20:01:51,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:51,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1818822188, now seen corresponding path program 1 times [2022-01-10 20:01:51,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:51,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919927581] [2022-01-10 20:01:51,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:51,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:51,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:51,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:51,210 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:51,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919927581] [2022-01-10 20:01:51,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919927581] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:51,210 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:51,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:01:51,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647197339] [2022-01-10 20:01:51,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:51,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:01:51,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:51,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:01:51,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:01:51,211 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-10 20:01:52,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:52,025 INFO L93 Difference]: Finished difference Result 15386 states and 20234 transitions. [2022-01-10 20:01:52,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:01:52,026 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-10 20:01:52,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:52,036 INFO L225 Difference]: With dead ends: 15386 [2022-01-10 20:01:52,037 INFO L226 Difference]: Without dead ends: 9172 [2022-01-10 20:01:52,040 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 20:01:52,041 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-10 20:01:52,041 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-10 20:01:52,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9172 states. [2022-01-10 20:01:52,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9172 to 6298. [2022-01-10 20:01:52,524 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-10 20:01:52,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6298 states to 6298 states and 8186 transitions. [2022-01-10 20:01:52,532 INFO L78 Accepts]: Start accepts. Automaton has 6298 states and 8186 transitions. Word has length 165 [2022-01-10 20:01:52,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:52,532 INFO L470 AbstractCegarLoop]: Abstraction has 6298 states and 8186 transitions. [2022-01-10 20:01:52,532 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-10 20:01:52,532 INFO L276 IsEmpty]: Start isEmpty. Operand 6298 states and 8186 transitions. [2022-01-10 20:01:52,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:52,533 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:52,533 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-10 20:01:52,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-10 20:01:52,534 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-10 20:01:52,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:52,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1675609555, now seen corresponding path program 1 times [2022-01-10 20:01:52,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:52,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023535699] [2022-01-10 20:01:52,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:52,535 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:52,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:52,577 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:52,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023535699] [2022-01-10 20:01:52,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023535699] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:52,577 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:52,577 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:52,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888257960] [2022-01-10 20:01:52,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:52,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:52,578 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:52,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:52,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:52,580 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-10 20:01:53,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:53,534 INFO L93 Difference]: Finished difference Result 18158 states and 23583 transitions. [2022-01-10 20:01:53,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:53,534 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-10 20:01:53,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:53,549 INFO L225 Difference]: With dead ends: 18158 [2022-01-10 20:01:53,549 INFO L226 Difference]: Without dead ends: 11990 [2022-01-10 20:01:53,557 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:53,558 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.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:01:53,558 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.0s Time] [2022-01-10 20:01:53,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11990 states. [2022-01-10 20:01:54,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11990 to 11978. [2022-01-10 20:01:54,596 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-10 20:01:54,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11978 states to 11978 states and 15496 transitions. [2022-01-10 20:01:54,612 INFO L78 Accepts]: Start accepts. Automaton has 11978 states and 15496 transitions. Word has length 165 [2022-01-10 20:01:54,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:54,613 INFO L470 AbstractCegarLoop]: Abstraction has 11978 states and 15496 transitions. [2022-01-10 20:01:54,613 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-10 20:01:54,613 INFO L276 IsEmpty]: Start isEmpty. Operand 11978 states and 15496 transitions. [2022-01-10 20:01:54,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:54,613 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:54,613 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-10 20:01:54,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-10 20:01:54,614 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-10 20:01:54,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:54,614 INFO L85 PathProgramCache]: Analyzing trace with hash -2071364692, now seen corresponding path program 1 times [2022-01-10 20:01:54,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:54,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171611610] [2022-01-10 20:01:54,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:54,614 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:54,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:54,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:54,666 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:54,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171611610] [2022-01-10 20:01:54,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171611610] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:54,667 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:54,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:54,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049520136] [2022-01-10 20:01:54,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:54,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:54,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:54,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:54,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:54,668 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-10 20:01:55,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:55,717 INFO L93 Difference]: Finished difference Result 23932 states and 30956 transitions. [2022-01-10 20:01:55,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:55,718 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-10 20:01:55,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:55,732 INFO L225 Difference]: With dead ends: 23932 [2022-01-10 20:01:55,732 INFO L226 Difference]: Without dead ends: 11978 [2022-01-10 20:01:55,744 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:55,744 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-10 20:01:55,744 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-10 20:01:55,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11978 states. [2022-01-10 20:01:56,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11978 to 11978. [2022-01-10 20:01:56,709 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-10 20:01:56,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11978 states to 11978 states and 15470 transitions. [2022-01-10 20:01:56,724 INFO L78 Accepts]: Start accepts. Automaton has 11978 states and 15470 transitions. Word has length 165 [2022-01-10 20:01:56,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:56,724 INFO L470 AbstractCegarLoop]: Abstraction has 11978 states and 15470 transitions. [2022-01-10 20:01:56,724 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-10 20:01:56,724 INFO L276 IsEmpty]: Start isEmpty. Operand 11978 states and 15470 transitions. [2022-01-10 20:01:56,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:56,725 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:56,725 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:01:56,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-10 20:01:56,725 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-10 20:01:56,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:56,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1741598931, now seen corresponding path program 1 times [2022-01-10 20:01:56,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:56,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027776648] [2022-01-10 20:01:56,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:56,727 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:56,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:56,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:56,783 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:56,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027776648] [2022-01-10 20:01:56,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027776648] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:56,783 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:56,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:56,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405126012] [2022-01-10 20:01:56,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:56,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:56,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:56,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:56,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:56,784 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-10 20:01:57,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:57,770 INFO L93 Difference]: Finished difference Result 23926 states and 30898 transitions. [2022-01-10 20:01:57,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:57,771 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-10 20:01:57,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:57,784 INFO L225 Difference]: With dead ends: 23926 [2022-01-10 20:01:57,784 INFO L226 Difference]: Without dead ends: 11978 [2022-01-10 20:01:57,793 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:57,794 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-10 20:01:57,794 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-10 20:01:57,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11978 states. [2022-01-10 20:01:58,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11978 to 11978. [2022-01-10 20:01:58,815 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-10 20:01:58,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11978 states to 11978 states and 15444 transitions. [2022-01-10 20:01:58,829 INFO L78 Accepts]: Start accepts. Automaton has 11978 states and 15444 transitions. Word has length 165 [2022-01-10 20:01:58,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:58,829 INFO L470 AbstractCegarLoop]: Abstraction has 11978 states and 15444 transitions. [2022-01-10 20:01:58,829 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-10 20:01:58,830 INFO L276 IsEmpty]: Start isEmpty. Operand 11978 states and 15444 transitions. [2022-01-10 20:01:58,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:58,830 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:58,830 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-10 20:01:58,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-10 20:01:58,830 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-10 20:01:58,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:58,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1390798994, now seen corresponding path program 1 times [2022-01-10 20:01:58,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:58,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844264414] [2022-01-10 20:01:58,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:58,831 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:58,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:58,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:58,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:58,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844264414] [2022-01-10 20:01:58,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844264414] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:58,871 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:58,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:58,871 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338906328] [2022-01-10 20:01:58,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:58,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:58,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:58,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:58,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:58,872 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-10 20:01:59,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:59,987 INFO L93 Difference]: Finished difference Result 23922 states and 30842 transitions. [2022-01-10 20:01:59,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:59,988 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-10 20:01:59,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:00,000 INFO L225 Difference]: With dead ends: 23922 [2022-01-10 20:02:00,001 INFO L226 Difference]: Without dead ends: 11978 [2022-01-10 20:02:00,009 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:00,010 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-10 20:02:00,010 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-10 20:02:00,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11978 states. [2022-01-10 20:02:01,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11978 to 11978. [2022-01-10 20:02:01,036 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-10 20:02:01,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11978 states to 11978 states and 15366 transitions. [2022-01-10 20:02:01,048 INFO L78 Accepts]: Start accepts. Automaton has 11978 states and 15366 transitions. Word has length 165 [2022-01-10 20:02:01,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:01,049 INFO L470 AbstractCegarLoop]: Abstraction has 11978 states and 15366 transitions. [2022-01-10 20:02:01,049 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-10 20:02:01,049 INFO L276 IsEmpty]: Start isEmpty. Operand 11978 states and 15366 transitions. [2022-01-10 20:02:01,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:02:01,050 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:01,056 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-10 20:02:01,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-01-10 20:02:01,057 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-10 20:02:01,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:01,057 INFO L85 PathProgramCache]: Analyzing trace with hash -429184977, now seen corresponding path program 1 times [2022-01-10 20:02:01,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:01,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665058920] [2022-01-10 20:02:01,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:01,058 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:01,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:01,170 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:01,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665058920] [2022-01-10 20:02:01,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665058920] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:01,170 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:01,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:02:01,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169502157] [2022-01-10 20:02:01,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:01,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:01,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:01,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:01,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:01,171 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-10 20:02:02,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:02,219 INFO L93 Difference]: Finished difference Result 23911 states and 30675 transitions. [2022-01-10 20:02:02,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:02,220 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-10 20:02:02,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:02,235 INFO L225 Difference]: With dead ends: 23911 [2022-01-10 20:02:02,235 INFO L226 Difference]: Without dead ends: 11978 [2022-01-10 20:02:02,245 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:02,246 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-10 20:02:02,246 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-10 20:02:02,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11978 states. [2022-01-10 20:02:03,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11978 to 11978. [2022-01-10 20:02:03,261 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-10 20:02:03,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11978 states to 11978 states and 15288 transitions. [2022-01-10 20:02:03,273 INFO L78 Accepts]: Start accepts. Automaton has 11978 states and 15288 transitions. Word has length 165 [2022-01-10 20:02:03,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:03,273 INFO L470 AbstractCegarLoop]: Abstraction has 11978 states and 15288 transitions. [2022-01-10 20:02:03,274 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-10 20:02:03,274 INFO L276 IsEmpty]: Start isEmpty. Operand 11978 states and 15288 transitions. [2022-01-10 20:02:03,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:02:03,274 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:03,274 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:02:03,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-01-10 20:02:03,274 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-10 20:02:03,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:03,275 INFO L85 PathProgramCache]: Analyzing trace with hash -939719154, now seen corresponding path program 1 times [2022-01-10 20:02:03,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:03,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526754689] [2022-01-10 20:02:03,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:03,275 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:03,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:03,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:03,317 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:03,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526754689] [2022-01-10 20:02:03,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526754689] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:03,317 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:03,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:02:03,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781350039] [2022-01-10 20:02:03,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:03,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:03,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:03,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:03,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:03,318 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-10 20:02:05,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:05,384 INFO L93 Difference]: Finished difference Result 35536 states and 45360 transitions. [2022-01-10 20:02:05,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:05,385 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-10 20:02:05,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:05,417 INFO L225 Difference]: With dead ends: 35536 [2022-01-10 20:02:05,417 INFO L226 Difference]: Without dead ends: 23605 [2022-01-10 20:02:05,431 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:05,431 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-10 20:02:05,432 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-10 20:02:05,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23605 states. [2022-01-10 20:02:07,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23605 to 22893. [2022-01-10 20:02:07,513 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-10 20:02:07,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22893 states to 22893 states and 29130 transitions. [2022-01-10 20:02:07,546 INFO L78 Accepts]: Start accepts. Automaton has 22893 states and 29130 transitions. Word has length 165 [2022-01-10 20:02:07,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:07,547 INFO L470 AbstractCegarLoop]: Abstraction has 22893 states and 29130 transitions. [2022-01-10 20:02:07,549 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-10 20:02:07,550 INFO L276 IsEmpty]: Start isEmpty. Operand 22893 states and 29130 transitions. [2022-01-10 20:02:07,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-01-10 20:02:07,582 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:07,582 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-10 20:02:07,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-01-10 20:02:07,582 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-10 20:02:07,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:07,583 INFO L85 PathProgramCache]: Analyzing trace with hash -778491454, now seen corresponding path program 1 times [2022-01-10 20:02:07,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:07,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161850210] [2022-01-10 20:02:07,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:07,583 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:07,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:07,681 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:07,682 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:07,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161850210] [2022-01-10 20:02:07,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161850210] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:07,682 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:07,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:02:07,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632296946] [2022-01-10 20:02:07,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:07,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:02:07,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:07,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:02:07,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:02:07,683 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-10 20:02:11,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:11,601 INFO L93 Difference]: Finished difference Result 62468 states and 79830 transitions. [2022-01-10 20:02:11,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:02:11,602 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-10 20:02:11,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:11,664 INFO L225 Difference]: With dead ends: 62468 [2022-01-10 20:02:11,664 INFO L226 Difference]: Without dead ends: 39681 [2022-01-10 20:02:11,680 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-10 20:02:11,680 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.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:11,680 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.1s Time] [2022-01-10 20:02:11,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39681 states. [2022-01-10 20:02:13,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39681 to 22941. [2022-01-10 20:02:13,987 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-10 20:02:14,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22941 states to 22941 states and 28985 transitions. [2022-01-10 20:02:14,015 INFO L78 Accepts]: Start accepts. Automaton has 22941 states and 28985 transitions. Word has length 268 [2022-01-10 20:02:14,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:14,015 INFO L470 AbstractCegarLoop]: Abstraction has 22941 states and 28985 transitions. [2022-01-10 20:02:14,015 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-10 20:02:14,015 INFO L276 IsEmpty]: Start isEmpty. Operand 22941 states and 28985 transitions. [2022-01-10 20:02:14,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-01-10 20:02:14,049 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:14,049 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-10 20:02:14,049 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-01-10 20:02:14,049 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-10 20:02:14,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:14,050 INFO L85 PathProgramCache]: Analyzing trace with hash -760870592, now seen corresponding path program 1 times [2022-01-10 20:02:14,050 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:14,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037365665] [2022-01-10 20:02:14,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:14,050 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:14,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:14,165 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:14,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:14,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037365665] [2022-01-10 20:02:14,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037365665] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:14,166 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:14,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:02:14,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498537250] [2022-01-10 20:02:14,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:14,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:14,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:14,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:14,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:14,167 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-10 20:02:18,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:18,679 INFO L93 Difference]: Finished difference Result 67971 states and 85492 transitions. [2022-01-10 20:02:18,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:18,679 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-10 20:02:18,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:18,736 INFO L225 Difference]: With dead ends: 67971 [2022-01-10 20:02:18,736 INFO L226 Difference]: Without dead ends: 45191 [2022-01-10 20:02:18,759 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:18,760 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-10 20:02:18,760 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-10 20:02:18,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45191 states. [2022-01-10 20:02:23,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45191 to 44519. [2022-01-10 20:02:23,214 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-10 20:02:23,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44519 states to 44519 states and 55800 transitions. [2022-01-10 20:02:23,271 INFO L78 Accepts]: Start accepts. Automaton has 44519 states and 55800 transitions. Word has length 268 [2022-01-10 20:02:23,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:23,271 INFO L470 AbstractCegarLoop]: Abstraction has 44519 states and 55800 transitions. [2022-01-10 20:02:23,271 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-10 20:02:23,271 INFO L276 IsEmpty]: Start isEmpty. Operand 44519 states and 55800 transitions. [2022-01-10 20:02:23,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-01-10 20:02:23,286 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:23,286 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-10 20:02:23,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-01-10 20:02:23,286 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-10 20:02:23,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:23,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1220303907, now seen corresponding path program 1 times [2022-01-10 20:02:23,287 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:23,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350313555] [2022-01-10 20:02:23,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:23,287 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:23,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:23,316 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 20:02:23,316 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:23,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350313555] [2022-01-10 20:02:23,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350313555] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:23,316 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:23,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:02:23,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828471929] [2022-01-10 20:02:23,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:23,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:23,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:23,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:23,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:23,317 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-10 20:02:26,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:26,907 INFO L93 Difference]: Finished difference Result 77901 states and 97574 transitions. [2022-01-10 20:02:26,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:26,907 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-10 20:02:26,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:26,957 INFO L225 Difference]: With dead ends: 77901 [2022-01-10 20:02:26,957 INFO L226 Difference]: Without dead ends: 33439 [2022-01-10 20:02:26,990 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:26,991 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-10 20:02:26,991 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-10 20:02:27,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33439 states. [2022-01-10 20:02:30,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33439 to 33439. [2022-01-10 20:02:30,462 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-10 20:02:30,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33439 states to 33439 states and 41842 transitions. [2022-01-10 20:02:30,509 INFO L78 Accepts]: Start accepts. Automaton has 33439 states and 41842 transitions. Word has length 268 [2022-01-10 20:02:30,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:30,509 INFO L470 AbstractCegarLoop]: Abstraction has 33439 states and 41842 transitions. [2022-01-10 20:02:30,509 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-10 20:02:30,509 INFO L276 IsEmpty]: Start isEmpty. Operand 33439 states and 41842 transitions. [2022-01-10 20:02:30,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2022-01-10 20:02:30,521 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:30,521 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-10 20:02:30,522 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-01-10 20:02:30,525 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-10 20:02:30,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:30,525 INFO L85 PathProgramCache]: Analyzing trace with hash -374784475, now seen corresponding path program 1 times [2022-01-10 20:02:30,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:30,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839342711] [2022-01-10 20:02:30,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:30,526 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:30,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:30,610 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:30,610 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:30,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839342711] [2022-01-10 20:02:30,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839342711] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:30,610 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:30,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:02:30,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562968581] [2022-01-10 20:02:30,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:30,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:30,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:30,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:30,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:30,611 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)