/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_SUM.epf -i ../../../trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 07:40:15,509 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 07:40:15,511 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 07:40:15,583 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 07:40:15,584 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 07:40:15,586 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 07:40:15,588 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 07:40:15,590 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 07:40:15,592 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 07:40:15,596 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 07:40:15,596 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 07:40:15,597 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 07:40:15,597 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 07:40:15,598 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 07:40:15,598 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 07:40:15,599 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 07:40:15,599 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 07:40:15,600 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 07:40:15,601 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 07:40:15,602 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 07:40:15,602 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 07:40:15,604 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 07:40:15,607 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 07:40:15,608 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 07:40:15,616 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 07:40:15,616 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 07:40:15,617 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 07:40:15,618 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 07:40:15,618 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 07:40:15,619 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 07:40:15,619 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 07:40:15,620 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 07:40:15,621 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 07:40:15,622 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 07:40:15,623 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 07:40:15,623 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 07:40:15,623 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 07:40:15,623 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 07:40:15,623 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 07:40:15,624 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 07:40:15,624 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 07:40:15,625 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf [2022-01-11 07:40:15,649 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 07:40:15,650 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 07:40:15,650 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 07:40:15,650 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 07:40:15,651 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 07:40:15,651 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 07:40:15,651 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 07:40:15,652 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 07:40:15,652 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 07:40:15,652 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 07:40:15,652 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 07:40:15,652 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 07:40:15,653 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 07:40:15,653 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 07:40:15,653 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 07:40:15,653 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 07:40:15,653 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 07:40:15,653 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 07:40:15,653 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 07:40:15,653 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 07:40:15,653 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 07:40:15,654 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 07:40:15,654 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 07:40:15,654 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 07:40:15,654 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 07:40:15,655 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 07:40:15,655 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 07:40:15,655 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 07:40:15,655 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 07:40:15,655 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 07:40:15,655 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 07:40:15,655 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 07:40:15,656 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 07:40:15,656 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_SUM WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-11 07:40:15,825 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 07:40:15,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 07:40:15,852 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 07:40:15,853 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 07:40:15,856 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 07:40:15,857 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-2.c [2022-01-11 07:40:15,900 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a80690c46/e089815a25954f74b6ef7892cce194cf/FLAG2b8dbb3e0 [2022-01-11 07:40:16,296 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 07:40:16,297 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-2.c [2022-01-11 07:40:16,314 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a80690c46/e089815a25954f74b6ef7892cce194cf/FLAG2b8dbb3e0 [2022-01-11 07:40:16,322 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a80690c46/e089815a25954f74b6ef7892cce194cf [2022-01-11 07:40:16,324 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 07:40:16,325 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 07:40:16,328 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 07:40:16,328 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 07:40:16,330 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 07:40:16,330 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 07:40:16" (1/1) ... [2022-01-11 07:40:16,331 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56cb2b3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:40:16, skipping insertion in model container [2022-01-11 07:40:16,331 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 07:40:16" (1/1) ... [2022-01-11 07:40:16,336 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 07:40:16,388 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 07:40:16,538 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_2.cil-1+token_ring.06.cil-2.c[914,927] [2022-01-11 07:40:16,590 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_2.cil-1+token_ring.06.cil-2.c[7115,7128] [2022-01-11 07:40:16,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 07:40:16,667 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 07:40:16,674 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_2.cil-1+token_ring.06.cil-2.c[914,927] [2022-01-11 07:40:16,693 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_2.cil-1+token_ring.06.cil-2.c[7115,7128] [2022-01-11 07:40:16,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 07:40:16,762 INFO L208 MainTranslator]: Completed translation [2022-01-11 07:40:16,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:40:16 WrapperNode [2022-01-11 07:40:16,763 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 07:40:16,763 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 07:40:16,763 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 07:40:16,763 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 07:40:16,780 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:40:16" (1/1) ... [2022-01-11 07:40:16,806 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:40:16" (1/1) ... [2022-01-11 07:40:16,856 INFO L137 Inliner]: procedures = 66, calls = 75, calls flagged for inlining = 70, calls inlined = 140, statements flattened = 1951 [2022-01-11 07:40:16,857 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 07:40:16,857 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 07:40:16,857 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 07:40:16,857 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 07:40:16,863 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:40:16" (1/1) ... [2022-01-11 07:40:16,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:40:16" (1/1) ... [2022-01-11 07:40:16,872 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:40:16" (1/1) ... [2022-01-11 07:40:16,872 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:40:16" (1/1) ... [2022-01-11 07:40:16,898 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:40:16" (1/1) ... [2022-01-11 07:40:16,928 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:40:16" (1/1) ... [2022-01-11 07:40:16,931 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:40:16" (1/1) ... [2022-01-11 07:40:16,936 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 07:40:16,937 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 07:40:16,937 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 07:40:16,937 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 07:40:16,947 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:40:16" (1/1) ... [2022-01-11 07:40:16,953 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 07:40:16,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 07:40:16,970 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-11 07:40:16,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-11 07:40:16,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 07:40:16,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 07:40:16,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 07:40:16,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 07:40:17,076 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 07:40:17,077 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 07:40:18,035 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 07:40:18,044 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 07:40:18,045 INFO L299 CfgBuilder]: Removed 13 assume(true) statements. [2022-01-11 07:40:18,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 07:40:18 BoogieIcfgContainer [2022-01-11 07:40:18,047 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 07:40:18,047 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 07:40:18,047 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 07:40:18,048 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 07:40:18,050 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 07:40:18" (1/1) ... [2022-01-11 07:40:18,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 07:40:18 BasicIcfg [2022-01-11 07:40:18,227 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 07:40:18,228 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 07:40:18,228 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 07:40:18,230 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 07:40:18,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 07:40:16" (1/4) ... [2022-01-11 07:40:18,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7441cddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 07:40:18, skipping insertion in model container [2022-01-11 07:40:18,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:40:16" (2/4) ... [2022-01-11 07:40:18,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7441cddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 07:40:18, skipping insertion in model container [2022-01-11 07:40:18,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 07:40:18" (3/4) ... [2022-01-11 07:40:18,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7441cddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 07:40:18, skipping insertion in model container [2022-01-11 07:40:18,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 07:40:18" (4/4) ... [2022-01-11 07:40:18,232 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.06.cil-2.cTransformedIcfg [2022-01-11 07:40:18,235 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 07:40:18,235 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-01-11 07:40:18,264 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 07:40:18,268 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-11 07:40:18,268 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-11 07:40:18,285 INFO L276 IsEmpty]: Start isEmpty. Operand has 791 states, 787 states have (on average 1.531130876747141) internal successors, (1205), 790 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:18,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-11 07:40:18,290 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:18,290 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] [2022-01-11 07:40:18,290 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:18,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:18,294 INFO L85 PathProgramCache]: Analyzing trace with hash -241952275, now seen corresponding path program 1 times [2022-01-11 07:40:18,299 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:18,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287349718] [2022-01-11 07:40:18,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:18,300 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:18,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:18,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:18,519 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:18,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287349718] [2022-01-11 07:40:18,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287349718] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:18,520 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:18,520 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:40:18,521 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777207542] [2022-01-11 07:40:18,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:18,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:18,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:18,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:18,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:18,553 INFO L87 Difference]: Start difference. First operand has 791 states, 787 states have (on average 1.531130876747141) internal successors, (1205), 790 states have internal predecessors, (1205), 0 states have call successors, (0), 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 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:18,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:18,665 INFO L93 Difference]: Finished difference Result 1481 states and 2246 transitions. [2022-01-11 07:40:18,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:18,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2022-01-11 07:40:18,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:18,685 INFO L225 Difference]: With dead ends: 1481 [2022-01-11 07:40:18,685 INFO L226 Difference]: Without dead ends: 781 [2022-01-11 07:40:18,691 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:18,694 INFO L933 BasicCegarLoop]: 1171 mSDtfsCounter, 141 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 2198 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:18,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 2198 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:18,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2022-01-11 07:40:18,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 781. [2022-01-11 07:40:18,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 778 states have (on average 1.4961439588688945) internal successors, (1164), 780 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:18,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1164 transitions. [2022-01-11 07:40:18,749 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1164 transitions. Word has length 44 [2022-01-11 07:40:18,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:18,749 INFO L470 AbstractCegarLoop]: Abstraction has 781 states and 1164 transitions. [2022-01-11 07:40:18,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:18,749 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1164 transitions. [2022-01-11 07:40:18,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-11 07:40:18,750 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:18,750 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] [2022-01-11 07:40:18,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 07:40:18,751 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:18,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:18,751 INFO L85 PathProgramCache]: Analyzing trace with hash -571718036, now seen corresponding path program 1 times [2022-01-11 07:40:18,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:18,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838314163] [2022-01-11 07:40:18,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:18,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:18,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:18,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:18,813 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:18,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838314163] [2022-01-11 07:40:18,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838314163] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:18,814 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:18,814 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:40:18,814 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066406841] [2022-01-11 07:40:18,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:18,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:18,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:18,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:18,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:18,816 INFO L87 Difference]: Start difference. First operand 781 states and 1164 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:18,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:18,897 INFO L93 Difference]: Finished difference Result 961 states and 1423 transitions. [2022-01-11 07:40:18,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:18,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2022-01-11 07:40:18,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:18,901 INFO L225 Difference]: With dead ends: 961 [2022-01-11 07:40:18,901 INFO L226 Difference]: Without dead ends: 875 [2022-01-11 07:40:18,903 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:18,904 INFO L933 BasicCegarLoop]: 1160 mSDtfsCounter, 118 mSDsluCounter, 1130 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 2290 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:18,905 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 2290 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 07:40:18,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2022-01-11 07:40:18,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 871. [2022-01-11 07:40:18,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 868 states have (on average 1.4804147465437787) internal successors, (1285), 870 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:18,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1285 transitions. [2022-01-11 07:40:18,984 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1285 transitions. Word has length 44 [2022-01-11 07:40:18,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:18,984 INFO L470 AbstractCegarLoop]: Abstraction has 871 states and 1285 transitions. [2022-01-11 07:40:18,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:18,984 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1285 transitions. [2022-01-11 07:40:18,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-11 07:40:18,985 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:18,985 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] [2022-01-11 07:40:18,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 07:40:18,986 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:18,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:18,986 INFO L85 PathProgramCache]: Analyzing trace with hash -210976786, now seen corresponding path program 1 times [2022-01-11 07:40:18,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:18,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920090564] [2022-01-11 07:40:18,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:18,987 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:19,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:19,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:19,071 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:19,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920090564] [2022-01-11 07:40:19,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920090564] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:19,071 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:19,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:40:19,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12784966] [2022-01-11 07:40:19,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:19,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:19,072 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:19,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:19,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:19,073 INFO L87 Difference]: Start difference. First operand 871 states and 1285 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:19,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:19,141 INFO L93 Difference]: Finished difference Result 1157 states and 1681 transitions. [2022-01-11 07:40:19,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:19,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2022-01-11 07:40:19,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:19,146 INFO L225 Difference]: With dead ends: 1157 [2022-01-11 07:40:19,146 INFO L226 Difference]: Without dead ends: 1027 [2022-01-11 07:40:19,149 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:19,151 INFO L933 BasicCegarLoop]: 1161 mSDtfsCounter, 1124 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1124 SdHoareTripleChecker+Valid, 1278 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:19,152 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1124 Valid, 1278 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:19,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2022-01-11 07:40:19,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 1023. [2022-01-11 07:40:19,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 1020 states have (on average 1.4598039215686274) internal successors, (1489), 1022 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:19,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1489 transitions. [2022-01-11 07:40:19,180 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1489 transitions. Word has length 44 [2022-01-11 07:40:19,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:19,180 INFO L470 AbstractCegarLoop]: Abstraction has 1023 states and 1489 transitions. [2022-01-11 07:40:19,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:19,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1489 transitions. [2022-01-11 07:40:19,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-11 07:40:19,186 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:19,186 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:40:19,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 07:40:19,187 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:19,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:19,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1018985951, now seen corresponding path program 1 times [2022-01-11 07:40:19,187 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:19,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678335072] [2022-01-11 07:40:19,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:19,188 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:19,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:19,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:19,276 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:19,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678335072] [2022-01-11 07:40:19,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678335072] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:19,276 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:19,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:40:19,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123822966] [2022-01-11 07:40:19,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:19,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:19,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:19,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:19,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:19,277 INFO L87 Difference]: Start difference. First operand 1023 states and 1489 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:19,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:19,324 INFO L93 Difference]: Finished difference Result 1571 states and 2245 transitions. [2022-01-11 07:40:19,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:19,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2022-01-11 07:40:19,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:19,328 INFO L225 Difference]: With dead ends: 1571 [2022-01-11 07:40:19,329 INFO L226 Difference]: Without dead ends: 1236 [2022-01-11 07:40:19,331 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:19,336 INFO L933 BasicCegarLoop]: 1156 mSDtfsCounter, 93 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 2257 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:19,336 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 2257 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:19,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2022-01-11 07:40:19,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1222. [2022-01-11 07:40:19,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1222 states, 1219 states have (on average 1.4413453650533223) internal successors, (1757), 1221 states have internal predecessors, (1757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:19,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1757 transitions. [2022-01-11 07:40:19,364 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1757 transitions. Word has length 45 [2022-01-11 07:40:19,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:19,365 INFO L470 AbstractCegarLoop]: Abstraction has 1222 states and 1757 transitions. [2022-01-11 07:40:19,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:19,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1757 transitions. [2022-01-11 07:40:19,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-11 07:40:19,366 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:19,366 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] [2022-01-11 07:40:19,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 07:40:19,367 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:19,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:19,369 INFO L85 PathProgramCache]: Analyzing trace with hash -989403488, now seen corresponding path program 1 times [2022-01-11 07:40:19,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:19,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337347728] [2022-01-11 07:40:19,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:19,369 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:19,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:19,426 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:19,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337347728] [2022-01-11 07:40:19,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337347728] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:19,426 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:19,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:40:19,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859276676] [2022-01-11 07:40:19,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:19,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:19,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:19,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:19,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:19,428 INFO L87 Difference]: Start difference. First operand 1222 states and 1757 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:19,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:19,479 INFO L93 Difference]: Finished difference Result 2110 states and 2969 transitions. [2022-01-11 07:40:19,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:19,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2022-01-11 07:40:19,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:19,484 INFO L225 Difference]: With dead ends: 2110 [2022-01-11 07:40:19,484 INFO L226 Difference]: Without dead ends: 1634 [2022-01-11 07:40:19,485 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:19,486 INFO L933 BasicCegarLoop]: 1156 mSDtfsCounter, 1112 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1112 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:19,486 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1112 Valid, 1245 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:19,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2022-01-11 07:40:19,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1602. [2022-01-11 07:40:19,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1602 states, 1599 states have (on average 1.4115071919949969) internal successors, (2257), 1601 states have internal predecessors, (2257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:19,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 2257 transitions. [2022-01-11 07:40:19,580 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 2257 transitions. Word has length 45 [2022-01-11 07:40:19,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:19,583 INFO L470 AbstractCegarLoop]: Abstraction has 1602 states and 2257 transitions. [2022-01-11 07:40:19,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:19,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 2257 transitions. [2022-01-11 07:40:19,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-11 07:40:19,588 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:19,589 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:40:19,589 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 07:40:19,589 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:19,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:19,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1873248860, now seen corresponding path program 1 times [2022-01-11 07:40:19,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:19,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116959599] [2022-01-11 07:40:19,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:19,590 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:19,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:19,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:19,649 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:19,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116959599] [2022-01-11 07:40:19,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116959599] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:19,649 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:19,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:40:19,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043132266] [2022-01-11 07:40:19,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:19,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:19,651 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:19,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:19,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:19,651 INFO L87 Difference]: Start difference. First operand 1602 states and 2257 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:19,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:19,728 INFO L93 Difference]: Finished difference Result 2805 states and 3870 transitions. [2022-01-11 07:40:19,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:19,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-01-11 07:40:19,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:19,735 INFO L225 Difference]: With dead ends: 2805 [2022-01-11 07:40:19,735 INFO L226 Difference]: Without dead ends: 1921 [2022-01-11 07:40:19,736 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:19,737 INFO L933 BasicCegarLoop]: 1160 mSDtfsCounter, 1109 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1109 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:19,738 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1109 Valid, 1249 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:19,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states. [2022-01-11 07:40:19,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1899. [2022-01-11 07:40:19,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1899 states, 1896 states have (on average 1.3934599156118144) internal successors, (2642), 1898 states have internal predecessors, (2642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:19,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1899 states to 1899 states and 2642 transitions. [2022-01-11 07:40:19,794 INFO L78 Accepts]: Start accepts. Automaton has 1899 states and 2642 transitions. Word has length 51 [2022-01-11 07:40:19,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:19,795 INFO L470 AbstractCegarLoop]: Abstraction has 1899 states and 2642 transitions. [2022-01-11 07:40:19,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:19,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 2642 transitions. [2022-01-11 07:40:19,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-11 07:40:19,796 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:19,796 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] [2022-01-11 07:40:19,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 07:40:19,796 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:19,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:19,797 INFO L85 PathProgramCache]: Analyzing trace with hash -143294285, now seen corresponding path program 1 times [2022-01-11 07:40:19,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:19,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744076930] [2022-01-11 07:40:19,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:19,797 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:19,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 07:40:19,876 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:19,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744076930] [2022-01-11 07:40:19,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744076930] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:19,876 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:19,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 07:40:19,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826126188] [2022-01-11 07:40:19,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:19,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 07:40:19,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:19,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 07:40:19,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 07:40:19,877 INFO L87 Difference]: Start difference. First operand 1899 states and 2642 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:20,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:20,037 INFO L93 Difference]: Finished difference Result 3525 states and 4846 transitions. [2022-01-11 07:40:20,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 07:40:20,038 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 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 52 [2022-01-11 07:40:20,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:20,044 INFO L225 Difference]: With dead ends: 3525 [2022-01-11 07:40:20,044 INFO L226 Difference]: Without dead ends: 2574 [2022-01-11 07:40:20,047 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 07:40:20,048 INFO L933 BasicCegarLoop]: 1149 mSDtfsCounter, 395 mSDsluCounter, 3556 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 4705 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:20,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [395 Valid, 4705 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:20,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2574 states. [2022-01-11 07:40:20,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2574 to 1923. [2022-01-11 07:40:20,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1923 states, 1920 states have (on average 1.3791666666666667) internal successors, (2648), 1922 states have internal predecessors, (2648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:20,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1923 states to 1923 states and 2648 transitions. [2022-01-11 07:40:20,116 INFO L78 Accepts]: Start accepts. Automaton has 1923 states and 2648 transitions. Word has length 52 [2022-01-11 07:40:20,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:20,116 INFO L470 AbstractCegarLoop]: Abstraction has 1923 states and 2648 transitions. [2022-01-11 07:40:20,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:20,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1923 states and 2648 transitions. [2022-01-11 07:40:20,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-11 07:40:20,117 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:20,117 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] [2022-01-11 07:40:20,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 07:40:20,117 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:20,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:20,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1807005970, now seen corresponding path program 1 times [2022-01-11 07:40:20,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:20,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559305425] [2022-01-11 07:40:20,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:20,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:20,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:20,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 07:40:20,154 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:20,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559305425] [2022-01-11 07:40:20,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559305425] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:20,154 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:20,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 07:40:20,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156781264] [2022-01-11 07:40:20,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:20,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 07:40:20,155 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:20,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 07:40:20,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 07:40:20,155 INFO L87 Difference]: Start difference. First operand 1923 states and 2648 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:20,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:20,270 INFO L93 Difference]: Finished difference Result 3678 states and 4997 transitions. [2022-01-11 07:40:20,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 07:40:20,270 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 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 52 [2022-01-11 07:40:20,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:20,277 INFO L225 Difference]: With dead ends: 3678 [2022-01-11 07:40:20,277 INFO L226 Difference]: Without dead ends: 2513 [2022-01-11 07:40:20,278 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 07:40:20,279 INFO L933 BasicCegarLoop]: 1148 mSDtfsCounter, 354 mSDsluCounter, 3573 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 4721 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:20,279 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [354 Valid, 4721 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:20,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2513 states. [2022-01-11 07:40:20,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2513 to 1941. [2022-01-11 07:40:20,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1941 states, 1938 states have (on average 1.3653250773993808) internal successors, (2646), 1940 states have internal predecessors, (2646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:20,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 2646 transitions. [2022-01-11 07:40:20,399 INFO L78 Accepts]: Start accepts. Automaton has 1941 states and 2646 transitions. Word has length 52 [2022-01-11 07:40:20,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:20,399 INFO L470 AbstractCegarLoop]: Abstraction has 1941 states and 2646 transitions. [2022-01-11 07:40:20,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:20,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 2646 transitions. [2022-01-11 07:40:20,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-11 07:40:20,401 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:20,401 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] [2022-01-11 07:40:20,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 07:40:20,401 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:20,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:20,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1818322097, now seen corresponding path program 1 times [2022-01-11 07:40:20,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:20,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130722218] [2022-01-11 07:40:20,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:20,402 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:20,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:20,461 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:20,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130722218] [2022-01-11 07:40:20,461 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130722218] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:20,461 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:20,462 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 07:40:20,462 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817401143] [2022-01-11 07:40:20,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:20,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 07:40:20,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:20,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 07:40:20,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 07:40:20,464 INFO L87 Difference]: Start difference. First operand 1941 states and 2646 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:20,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:20,615 INFO L93 Difference]: Finished difference Result 2173 states and 2946 transitions. [2022-01-11 07:40:20,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 07:40:20,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-01-11 07:40:20,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:20,622 INFO L225 Difference]: With dead ends: 2173 [2022-01-11 07:40:20,622 INFO L226 Difference]: Without dead ends: 2171 [2022-01-11 07:40:20,623 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 07:40:20,624 INFO L933 BasicCegarLoop]: 1157 mSDtfsCounter, 2357 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2357 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:20,625 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2357 Valid, 1245 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:20,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2171 states. [2022-01-11 07:40:20,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2171 to 1939. [2022-01-11 07:40:20,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1939 states, 1937 states have (on average 1.3613835828600929) internal successors, (2637), 1938 states have internal predecessors, (2637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:20,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 2637 transitions. [2022-01-11 07:40:20,758 INFO L78 Accepts]: Start accepts. Automaton has 1939 states and 2637 transitions. Word has length 52 [2022-01-11 07:40:20,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:20,759 INFO L470 AbstractCegarLoop]: Abstraction has 1939 states and 2637 transitions. [2022-01-11 07:40:20,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:20,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 2637 transitions. [2022-01-11 07:40:20,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-11 07:40:20,762 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:20,762 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] [2022-01-11 07:40:20,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-11 07:40:20,762 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:20,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:20,763 INFO L85 PathProgramCache]: Analyzing trace with hash 533412379, now seen corresponding path program 1 times [2022-01-11 07:40:20,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:20,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251507554] [2022-01-11 07:40:20,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:20,763 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:20,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:20,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:20,960 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:20,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251507554] [2022-01-11 07:40:20,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251507554] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 07:40:20,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558346408] [2022-01-11 07:40:20,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:20,961 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 07:40:20,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 07:40:20,963 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 07:40:20,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-11 07:40:21,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:21,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-11 07:40:21,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 07:40:21,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:21,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 07:40:21,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:21,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558346408] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 07:40:21,528 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 07:40:21,529 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-11 07:40:21,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846099474] [2022-01-11 07:40:21,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 07:40:21,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-11 07:40:21,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:21,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-11 07:40:21,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-11 07:40:21,530 INFO L87 Difference]: Start difference. First operand 1939 states and 2637 transitions. Second operand has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:21,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:21,900 INFO L93 Difference]: Finished difference Result 4296 states and 5737 transitions. [2022-01-11 07:40:21,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-11 07:40:21,900 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 53 [2022-01-11 07:40:21,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:21,912 INFO L225 Difference]: With dead ends: 4296 [2022-01-11 07:40:21,912 INFO L226 Difference]: Without dead ends: 4294 [2022-01-11 07:40:21,913 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 100 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-11 07:40:21,914 INFO L933 BasicCegarLoop]: 1308 mSDtfsCounter, 5128 mSDsluCounter, 2803 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5128 SdHoareTripleChecker+Valid, 4111 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:21,914 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5128 Valid, 4111 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:21,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4294 states. [2022-01-11 07:40:22,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4294 to 2914. [2022-01-11 07:40:22,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2914 states, 2912 states have (on average 1.345467032967033) internal successors, (3918), 2913 states have internal predecessors, (3918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:22,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2914 states and 3918 transitions. [2022-01-11 07:40:22,139 INFO L78 Accepts]: Start accepts. Automaton has 2914 states and 3918 transitions. Word has length 53 [2022-01-11 07:40:22,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:22,139 INFO L470 AbstractCegarLoop]: Abstraction has 2914 states and 3918 transitions. [2022-01-11 07:40:22,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:22,140 INFO L276 IsEmpty]: Start isEmpty. Operand 2914 states and 3918 transitions. [2022-01-11 07:40:22,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-11 07:40:22,140 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:22,140 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2022-01-11 07:40:22,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-11 07:40:22,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-11 07:40:22,358 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:22,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:22,359 INFO L85 PathProgramCache]: Analyzing trace with hash -809608061, now seen corresponding path program 2 times [2022-01-11 07:40:22,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:22,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722144390] [2022-01-11 07:40:22,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:22,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:22,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:22,393 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:22,394 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:22,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722144390] [2022-01-11 07:40:22,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722144390] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:22,394 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:22,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:40:22,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315979803] [2022-01-11 07:40:22,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:22,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:22,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:22,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:22,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:22,395 INFO L87 Difference]: Start difference. First operand 2914 states and 3918 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:22,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:22,533 INFO L93 Difference]: Finished difference Result 4008 states and 5363 transitions. [2022-01-11 07:40:22,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:22,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-01-11 07:40:22,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:22,540 INFO L225 Difference]: With dead ends: 4008 [2022-01-11 07:40:22,540 INFO L226 Difference]: Without dead ends: 2268 [2022-01-11 07:40:22,542 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:22,542 INFO L933 BasicCegarLoop]: 1220 mSDtfsCounter, 1104 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1104 SdHoareTripleChecker+Valid, 1335 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:22,543 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1104 Valid, 1335 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:22,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2268 states. [2022-01-11 07:40:22,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 2252. [2022-01-11 07:40:22,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2252 states, 2250 states have (on average 1.3395555555555556) internal successors, (3014), 2251 states have internal predecessors, (3014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:22,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2252 states to 2252 states and 3014 transitions. [2022-01-11 07:40:22,719 INFO L78 Accepts]: Start accepts. Automaton has 2252 states and 3014 transitions. Word has length 56 [2022-01-11 07:40:22,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:22,719 INFO L470 AbstractCegarLoop]: Abstraction has 2252 states and 3014 transitions. [2022-01-11 07:40:22,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:22,719 INFO L276 IsEmpty]: Start isEmpty. Operand 2252 states and 3014 transitions. [2022-01-11 07:40:22,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-11 07:40:22,720 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:22,720 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:40:22,721 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 07:40:22,721 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:22,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:22,721 INFO L85 PathProgramCache]: Analyzing trace with hash 205311391, now seen corresponding path program 1 times [2022-01-11 07:40:22,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:22,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021811796] [2022-01-11 07:40:22,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:22,722 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:22,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:22,756 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:22,756 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:22,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021811796] [2022-01-11 07:40:22,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021811796] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:22,757 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:22,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:40:22,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327900485] [2022-01-11 07:40:22,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:22,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:22,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:22,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:22,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:22,758 INFO L87 Difference]: Start difference. First operand 2252 states and 3014 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:22,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:22,957 INFO L93 Difference]: Finished difference Result 3543 states and 4682 transitions. [2022-01-11 07:40:22,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:22,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2022-01-11 07:40:22,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:22,965 INFO L225 Difference]: With dead ends: 3543 [2022-01-11 07:40:22,965 INFO L226 Difference]: Without dead ends: 2637 [2022-01-11 07:40:22,966 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:22,967 INFO L933 BasicCegarLoop]: 1220 mSDtfsCounter, 66 mSDsluCounter, 1140 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 2360 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:22,967 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 2360 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:22,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2637 states. [2022-01-11 07:40:23,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2637 to 2637. [2022-01-11 07:40:23,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2637 states, 2635 states have (on average 1.3195445920303606) internal successors, (3477), 2636 states have internal predecessors, (3477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:23,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2637 states to 2637 states and 3477 transitions. [2022-01-11 07:40:23,134 INFO L78 Accepts]: Start accepts. Automaton has 2637 states and 3477 transitions. Word has length 60 [2022-01-11 07:40:23,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:23,134 INFO L470 AbstractCegarLoop]: Abstraction has 2637 states and 3477 transitions. [2022-01-11 07:40:23,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:23,134 INFO L276 IsEmpty]: Start isEmpty. Operand 2637 states and 3477 transitions. [2022-01-11 07:40:23,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-11 07:40:23,136 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:23,136 INFO L514 BasicCegarLoop]: trace histogram [3, 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, 1, 1] [2022-01-11 07:40:23,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 07:40:23,136 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:23,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:23,137 INFO L85 PathProgramCache]: Analyzing trace with hash 304339481, now seen corresponding path program 1 times [2022-01-11 07:40:23,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:23,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450399039] [2022-01-11 07:40:23,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:23,137 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:23,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:23,164 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 07:40:23,164 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:23,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450399039] [2022-01-11 07:40:23,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450399039] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:23,164 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:23,164 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:40:23,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933703782] [2022-01-11 07:40:23,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:23,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:23,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:23,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:23,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:23,183 INFO L87 Difference]: Start difference. First operand 2637 states and 3477 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:23,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:23,345 INFO L93 Difference]: Finished difference Result 4500 states and 5829 transitions. [2022-01-11 07:40:23,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:23,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2022-01-11 07:40:23,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:23,353 INFO L225 Difference]: With dead ends: 4500 [2022-01-11 07:40:23,353 INFO L226 Difference]: Without dead ends: 2637 [2022-01-11 07:40:23,355 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:23,355 INFO L933 BasicCegarLoop]: 1153 mSDtfsCounter, 1096 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1096 SdHoareTripleChecker+Valid, 1237 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:23,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1096 Valid, 1237 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:23,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2637 states. [2022-01-11 07:40:23,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2637 to 2637. [2022-01-11 07:40:23,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2637 states, 2635 states have (on average 1.3043643263757116) internal successors, (3437), 2636 states have internal predecessors, (3437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:23,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2637 states to 2637 states and 3437 transitions. [2022-01-11 07:40:23,525 INFO L78 Accepts]: Start accepts. Automaton has 2637 states and 3437 transitions. Word has length 68 [2022-01-11 07:40:23,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:23,525 INFO L470 AbstractCegarLoop]: Abstraction has 2637 states and 3437 transitions. [2022-01-11 07:40:23,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:23,526 INFO L276 IsEmpty]: Start isEmpty. Operand 2637 states and 3437 transitions. [2022-01-11 07:40:23,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-11 07:40:23,527 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:23,527 INFO L514 BasicCegarLoop]: trace histogram [3, 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, 1] [2022-01-11 07:40:23,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 07:40:23,527 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:23,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:23,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1860548546, now seen corresponding path program 1 times [2022-01-11 07:40:23,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:23,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245614411] [2022-01-11 07:40:23,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:23,528 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:23,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:23,560 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 07:40:23,560 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:23,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245614411] [2022-01-11 07:40:23,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245614411] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:23,560 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:23,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:40:23,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375907364] [2022-01-11 07:40:23,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:23,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:23,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:23,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:23,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:23,562 INFO L87 Difference]: Start difference. First operand 2637 states and 3437 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:23,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:23,761 INFO L93 Difference]: Finished difference Result 3936 states and 5071 transitions. [2022-01-11 07:40:23,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:23,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 69 [2022-01-11 07:40:23,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:23,766 INFO L225 Difference]: With dead ends: 3936 [2022-01-11 07:40:23,766 INFO L226 Difference]: Without dead ends: 2311 [2022-01-11 07:40:23,768 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:23,768 INFO L933 BasicCegarLoop]: 1236 mSDtfsCounter, 99 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 2371 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:23,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 2371 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:23,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2022-01-11 07:40:23,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 2309. [2022-01-11 07:40:23,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2309 states, 2307 states have (on average 1.3016905071521456) internal successors, (3003), 2308 states have internal predecessors, (3003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:23,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2309 states to 2309 states and 3003 transitions. [2022-01-11 07:40:23,898 INFO L78 Accepts]: Start accepts. Automaton has 2309 states and 3003 transitions. Word has length 69 [2022-01-11 07:40:23,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:23,898 INFO L470 AbstractCegarLoop]: Abstraction has 2309 states and 3003 transitions. [2022-01-11 07:40:23,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:23,898 INFO L276 IsEmpty]: Start isEmpty. Operand 2309 states and 3003 transitions. [2022-01-11 07:40:23,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-11 07:40:23,900 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:23,900 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] [2022-01-11 07:40:23,900 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-11 07:40:23,900 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:23,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:23,901 INFO L85 PathProgramCache]: Analyzing trace with hash -2140842012, now seen corresponding path program 1 times [2022-01-11 07:40:23,901 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:23,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24748919] [2022-01-11 07:40:23,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:23,901 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:23,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:23,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:23,923 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:23,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24748919] [2022-01-11 07:40:23,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24748919] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:23,923 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:23,923 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:40:23,923 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875522423] [2022-01-11 07:40:23,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:23,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:23,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:23,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:23,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:23,924 INFO L87 Difference]: Start difference. First operand 2309 states and 3003 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:24,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:24,106 INFO L93 Difference]: Finished difference Result 3520 states and 4806 transitions. [2022-01-11 07:40:24,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:24,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-01-11 07:40:24,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:24,111 INFO L225 Difference]: With dead ends: 3520 [2022-01-11 07:40:24,111 INFO L226 Difference]: Without dead ends: 2850 [2022-01-11 07:40:24,112 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:24,112 INFO L933 BasicCegarLoop]: 1146 mSDtfsCounter, 1061 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1061 SdHoareTripleChecker+Valid, 2014 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:24,113 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1061 Valid, 2014 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:24,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2850 states. [2022-01-11 07:40:24,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2850 to 2848. [2022-01-11 07:40:24,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2848 states, 2846 states have (on average 1.3352073085031624) internal successors, (3800), 2847 states have internal predecessors, (3800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:24,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2848 states to 2848 states and 3800 transitions. [2022-01-11 07:40:24,286 INFO L78 Accepts]: Start accepts. Automaton has 2848 states and 3800 transitions. Word has length 99 [2022-01-11 07:40:24,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:24,286 INFO L470 AbstractCegarLoop]: Abstraction has 2848 states and 3800 transitions. [2022-01-11 07:40:24,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:24,287 INFO L276 IsEmpty]: Start isEmpty. Operand 2848 states and 3800 transitions. [2022-01-11 07:40:24,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-11 07:40:24,288 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:24,288 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] [2022-01-11 07:40:24,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-11 07:40:24,289 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:24,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:24,289 INFO L85 PathProgramCache]: Analyzing trace with hash -279544060, now seen corresponding path program 1 times [2022-01-11 07:40:24,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:24,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532382187] [2022-01-11 07:40:24,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:24,289 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:24,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:24,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:24,313 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:24,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532382187] [2022-01-11 07:40:24,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532382187] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:24,313 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:24,314 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:40:24,314 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810059186] [2022-01-11 07:40:24,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:24,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:24,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:24,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:24,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:24,315 INFO L87 Difference]: Start difference. First operand 2848 states and 3800 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:24,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:24,484 INFO L93 Difference]: Finished difference Result 4056 states and 5597 transitions. [2022-01-11 07:40:24,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:24,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-01-11 07:40:24,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:24,488 INFO L225 Difference]: With dead ends: 4056 [2022-01-11 07:40:24,488 INFO L226 Difference]: Without dead ends: 2848 [2022-01-11 07:40:24,490 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:24,490 INFO L933 BasicCegarLoop]: 1140 mSDtfsCounter, 1131 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1131 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:24,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1131 Valid, 1140 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:24,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2848 states. [2022-01-11 07:40:24,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2848 to 2848. [2022-01-11 07:40:24,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2848 states, 2846 states have (on average 1.332396345748419) internal successors, (3792), 2847 states have internal predecessors, (3792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:24,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2848 states to 2848 states and 3792 transitions. [2022-01-11 07:40:24,700 INFO L78 Accepts]: Start accepts. Automaton has 2848 states and 3792 transitions. Word has length 99 [2022-01-11 07:40:24,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:24,700 INFO L470 AbstractCegarLoop]: Abstraction has 2848 states and 3792 transitions. [2022-01-11 07:40:24,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:24,701 INFO L276 IsEmpty]: Start isEmpty. Operand 2848 states and 3792 transitions. [2022-01-11 07:40:24,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-11 07:40:24,703 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:24,703 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] [2022-01-11 07:40:24,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-11 07:40:24,703 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:24,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:24,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1743522844, now seen corresponding path program 1 times [2022-01-11 07:40:24,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:24,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827780437] [2022-01-11 07:40:24,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:24,704 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:24,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:24,731 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:24,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827780437] [2022-01-11 07:40:24,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827780437] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:24,731 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:24,731 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:40:24,731 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633360285] [2022-01-11 07:40:24,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:24,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:24,731 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:24,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:24,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:24,732 INFO L87 Difference]: Start difference. First operand 2848 states and 3792 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:24,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:24,896 INFO L93 Difference]: Finished difference Result 4055 states and 5580 transitions. [2022-01-11 07:40:24,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:24,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-01-11 07:40:24,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:24,901 INFO L225 Difference]: With dead ends: 4055 [2022-01-11 07:40:24,901 INFO L226 Difference]: Without dead ends: 2848 [2022-01-11 07:40:24,903 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:24,903 INFO L933 BasicCegarLoop]: 1135 mSDtfsCounter, 1125 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1125 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:24,903 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1125 Valid, 1135 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:24,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2848 states. [2022-01-11 07:40:25,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2848 to 2848. [2022-01-11 07:40:25,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2848 states, 2846 states have (on average 1.3295853829936752) internal successors, (3784), 2847 states have internal predecessors, (3784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:25,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2848 states to 2848 states and 3784 transitions. [2022-01-11 07:40:25,083 INFO L78 Accepts]: Start accepts. Automaton has 2848 states and 3784 transitions. Word has length 99 [2022-01-11 07:40:25,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:25,083 INFO L470 AbstractCegarLoop]: Abstraction has 2848 states and 3784 transitions. [2022-01-11 07:40:25,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:25,083 INFO L276 IsEmpty]: Start isEmpty. Operand 2848 states and 3784 transitions. [2022-01-11 07:40:25,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-11 07:40:25,085 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:25,085 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] [2022-01-11 07:40:25,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-11 07:40:25,085 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:25,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:25,086 INFO L85 PathProgramCache]: Analyzing trace with hash 426009348, now seen corresponding path program 1 times [2022-01-11 07:40:25,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:25,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352953436] [2022-01-11 07:40:25,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:25,086 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:25,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:25,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:25,109 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:25,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352953436] [2022-01-11 07:40:25,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352953436] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:25,109 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:25,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:40:25,110 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758135095] [2022-01-11 07:40:25,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:25,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:25,110 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:25,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:25,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:25,110 INFO L87 Difference]: Start difference. First operand 2848 states and 3784 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:25,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:25,254 INFO L93 Difference]: Finished difference Result 4054 states and 5563 transitions. [2022-01-11 07:40:25,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:25,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-01-11 07:40:25,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:25,259 INFO L225 Difference]: With dead ends: 4054 [2022-01-11 07:40:25,259 INFO L226 Difference]: Without dead ends: 2848 [2022-01-11 07:40:25,261 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:25,261 INFO L933 BasicCegarLoop]: 1130 mSDtfsCounter, 1119 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1119 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:25,261 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1119 Valid, 1130 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:25,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2848 states. [2022-01-11 07:40:25,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2848 to 2848. [2022-01-11 07:40:25,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2848 states, 2846 states have (on average 1.3267744202389318) internal successors, (3776), 2847 states have internal predecessors, (3776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:25,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2848 states to 2848 states and 3776 transitions. [2022-01-11 07:40:25,402 INFO L78 Accepts]: Start accepts. Automaton has 2848 states and 3776 transitions. Word has length 99 [2022-01-11 07:40:25,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:25,402 INFO L470 AbstractCegarLoop]: Abstraction has 2848 states and 3776 transitions. [2022-01-11 07:40:25,402 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:25,402 INFO L276 IsEmpty]: Start isEmpty. Operand 2848 states and 3776 transitions. [2022-01-11 07:40:25,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-11 07:40:25,404 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:25,404 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:40:25,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-11 07:40:25,404 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:25,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:25,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1028026396, now seen corresponding path program 1 times [2022-01-11 07:40:25,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:25,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529088587] [2022-01-11 07:40:25,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:25,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:25,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:25,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:25,428 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:25,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529088587] [2022-01-11 07:40:25,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529088587] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:25,428 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:25,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:40:25,428 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233557404] [2022-01-11 07:40:25,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:25,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:25,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:25,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:25,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:25,429 INFO L87 Difference]: Start difference. First operand 2848 states and 3776 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:25,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:25,585 INFO L93 Difference]: Finished difference Result 4053 states and 5546 transitions. [2022-01-11 07:40:25,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:25,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-01-11 07:40:25,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:25,590 INFO L225 Difference]: With dead ends: 4053 [2022-01-11 07:40:25,590 INFO L226 Difference]: Without dead ends: 2848 [2022-01-11 07:40:25,591 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:25,592 INFO L933 BasicCegarLoop]: 1125 mSDtfsCounter, 1113 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:25,592 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1113 Valid, 1125 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:25,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2848 states. [2022-01-11 07:40:25,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2848 to 2848. [2022-01-11 07:40:25,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2848 states, 2846 states have (on average 1.3239634574841883) internal successors, (3768), 2847 states have internal predecessors, (3768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:25,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2848 states to 2848 states and 3768 transitions. [2022-01-11 07:40:25,735 INFO L78 Accepts]: Start accepts. Automaton has 2848 states and 3768 transitions. Word has length 99 [2022-01-11 07:40:25,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:25,735 INFO L470 AbstractCegarLoop]: Abstraction has 2848 states and 3768 transitions. [2022-01-11 07:40:25,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:25,735 INFO L276 IsEmpty]: Start isEmpty. Operand 2848 states and 3768 transitions. [2022-01-11 07:40:25,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-11 07:40:25,737 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:25,737 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] [2022-01-11 07:40:25,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-11 07:40:25,737 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:25,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:25,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1973110532, now seen corresponding path program 1 times [2022-01-11 07:40:25,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:25,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928934774] [2022-01-11 07:40:25,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:25,738 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:25,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:25,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:25,760 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:25,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928934774] [2022-01-11 07:40:25,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928934774] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:25,760 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:25,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:40:25,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586270678] [2022-01-11 07:40:25,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:25,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:25,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:25,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:25,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:25,761 INFO L87 Difference]: Start difference. First operand 2848 states and 3768 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:25,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:25,939 INFO L93 Difference]: Finished difference Result 4052 states and 5529 transitions. [2022-01-11 07:40:25,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:25,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-01-11 07:40:25,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:25,944 INFO L225 Difference]: With dead ends: 4052 [2022-01-11 07:40:25,944 INFO L226 Difference]: Without dead ends: 2848 [2022-01-11 07:40:25,946 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:25,946 INFO L933 BasicCegarLoop]: 1120 mSDtfsCounter, 1107 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1107 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:25,946 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1107 Valid, 1120 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:25,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2848 states. [2022-01-11 07:40:26,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2848 to 2848. [2022-01-11 07:40:26,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2848 states, 2846 states have (on average 1.3211524947294448) internal successors, (3760), 2847 states have internal predecessors, (3760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:26,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2848 states to 2848 states and 3760 transitions. [2022-01-11 07:40:26,094 INFO L78 Accepts]: Start accepts. Automaton has 2848 states and 3760 transitions. Word has length 99 [2022-01-11 07:40:26,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:26,096 INFO L470 AbstractCegarLoop]: Abstraction has 2848 states and 3760 transitions. [2022-01-11 07:40:26,096 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:26,097 INFO L276 IsEmpty]: Start isEmpty. Operand 2848 states and 3760 transitions. [2022-01-11 07:40:26,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-11 07:40:26,100 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:26,100 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] [2022-01-11 07:40:26,100 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-11 07:40:26,100 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:26,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:26,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1377184740, now seen corresponding path program 1 times [2022-01-11 07:40:26,101 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:26,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930946914] [2022-01-11 07:40:26,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:26,101 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:26,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:26,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:26,125 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:26,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930946914] [2022-01-11 07:40:26,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930946914] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:26,126 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:26,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:40:26,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402161223] [2022-01-11 07:40:26,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:26,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:26,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:26,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:26,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:26,128 INFO L87 Difference]: Start difference. First operand 2848 states and 3760 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:26,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:26,285 INFO L93 Difference]: Finished difference Result 4051 states and 5512 transitions. [2022-01-11 07:40:26,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:26,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-01-11 07:40:26,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:26,289 INFO L225 Difference]: With dead ends: 4051 [2022-01-11 07:40:26,289 INFO L226 Difference]: Without dead ends: 2848 [2022-01-11 07:40:26,291 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:26,292 INFO L933 BasicCegarLoop]: 1115 mSDtfsCounter, 1101 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1101 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:26,292 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1101 Valid, 1115 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:26,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2848 states. [2022-01-11 07:40:26,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2848 to 2848. [2022-01-11 07:40:26,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2848 states, 2846 states have (on average 1.3183415319747014) internal successors, (3752), 2847 states have internal predecessors, (3752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:26,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2848 states to 2848 states and 3752 transitions. [2022-01-11 07:40:26,519 INFO L78 Accepts]: Start accepts. Automaton has 2848 states and 3752 transitions. Word has length 99 [2022-01-11 07:40:26,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:26,519 INFO L470 AbstractCegarLoop]: Abstraction has 2848 states and 3752 transitions. [2022-01-11 07:40:26,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:26,520 INFO L276 IsEmpty]: Start isEmpty. Operand 2848 states and 3752 transitions. [2022-01-11 07:40:26,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-11 07:40:26,521 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:26,521 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:40:26,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-11 07:40:26,522 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:26,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:26,522 INFO L85 PathProgramCache]: Analyzing trace with hash 2050697988, now seen corresponding path program 1 times [2022-01-11 07:40:26,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:26,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177887239] [2022-01-11 07:40:26,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:26,522 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:26,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:26,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:26,553 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:26,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177887239] [2022-01-11 07:40:26,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177887239] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:26,553 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:26,554 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:40:26,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714296859] [2022-01-11 07:40:26,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:26,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:26,554 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:26,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:26,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:26,555 INFO L87 Difference]: Start difference. First operand 2848 states and 3752 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:26,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:26,775 INFO L93 Difference]: Finished difference Result 4050 states and 5495 transitions. [2022-01-11 07:40:26,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:26,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-01-11 07:40:26,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:26,780 INFO L225 Difference]: With dead ends: 4050 [2022-01-11 07:40:26,780 INFO L226 Difference]: Without dead ends: 2848 [2022-01-11 07:40:26,781 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:26,782 INFO L933 BasicCegarLoop]: 1092 mSDtfsCounter, 1014 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1014 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:26,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1014 Valid, 1160 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:26,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2848 states. [2022-01-11 07:40:26,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2848 to 2848. [2022-01-11 07:40:26,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2848 states, 2846 states have (on average 1.3099086437104708) internal successors, (3728), 2847 states have internal predecessors, (3728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:26,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2848 states to 2848 states and 3728 transitions. [2022-01-11 07:40:26,938 INFO L78 Accepts]: Start accepts. Automaton has 2848 states and 3728 transitions. Word has length 99 [2022-01-11 07:40:26,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:26,938 INFO L470 AbstractCegarLoop]: Abstraction has 2848 states and 3728 transitions. [2022-01-11 07:40:26,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:26,938 INFO L276 IsEmpty]: Start isEmpty. Operand 2848 states and 3728 transitions. [2022-01-11 07:40:26,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-11 07:40:26,940 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:26,940 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] [2022-01-11 07:40:26,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-11 07:40:26,940 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:26,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:26,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1557544035, now seen corresponding path program 1 times [2022-01-11 07:40:26,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:26,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075106761] [2022-01-11 07:40:26,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:26,941 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:26,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:26,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:26,966 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:26,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075106761] [2022-01-11 07:40:26,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075106761] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:26,966 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:26,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:40:26,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842790813] [2022-01-11 07:40:26,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:26,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:26,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:26,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:26,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:26,967 INFO L87 Difference]: Start difference. First operand 2848 states and 3728 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:27,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:27,161 INFO L93 Difference]: Finished difference Result 4049 states and 5446 transitions. [2022-01-11 07:40:27,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:27,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-01-11 07:40:27,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:27,165 INFO L225 Difference]: With dead ends: 4049 [2022-01-11 07:40:27,166 INFO L226 Difference]: Without dead ends: 2848 [2022-01-11 07:40:27,167 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:27,167 INFO L933 BasicCegarLoop]: 1078 mSDtfsCounter, 1000 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1000 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:27,168 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1000 Valid, 1145 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:27,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2848 states. [2022-01-11 07:40:27,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2848 to 2848. [2022-01-11 07:40:27,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2848 states, 2846 states have (on average 1.3014757554462404) internal successors, (3704), 2847 states have internal predecessors, (3704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:27,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2848 states to 2848 states and 3704 transitions. [2022-01-11 07:40:27,325 INFO L78 Accepts]: Start accepts. Automaton has 2848 states and 3704 transitions. Word has length 99 [2022-01-11 07:40:27,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:27,325 INFO L470 AbstractCegarLoop]: Abstraction has 2848 states and 3704 transitions. [2022-01-11 07:40:27,325 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:27,326 INFO L276 IsEmpty]: Start isEmpty. Operand 2848 states and 3704 transitions. [2022-01-11 07:40:27,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-11 07:40:27,327 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:27,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] [2022-01-11 07:40:27,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-11 07:40:27,328 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:27,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:27,328 INFO L85 PathProgramCache]: Analyzing trace with hash -856554686, now seen corresponding path program 1 times [2022-01-11 07:40:27,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:27,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722932930] [2022-01-11 07:40:27,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:27,328 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:27,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:27,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:27,350 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:27,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722932930] [2022-01-11 07:40:27,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722932930] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:27,350 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:27,350 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:40:27,350 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502745302] [2022-01-11 07:40:27,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:27,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:27,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:27,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:27,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:27,351 INFO L87 Difference]: Start difference. First operand 2848 states and 3704 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:27,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:27,531 INFO L93 Difference]: Finished difference Result 4048 states and 5397 transitions. [2022-01-11 07:40:27,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:27,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-01-11 07:40:27,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:27,536 INFO L225 Difference]: With dead ends: 4048 [2022-01-11 07:40:27,536 INFO L226 Difference]: Without dead ends: 2848 [2022-01-11 07:40:27,538 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:27,539 INFO L933 BasicCegarLoop]: 1064 mSDtfsCounter, 986 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 986 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:27,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [986 Valid, 1130 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:27,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2848 states. [2022-01-11 07:40:27,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2848 to 2848. [2022-01-11 07:40:27,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2848 states, 2846 states have (on average 1.2930428671820098) internal successors, (3680), 2847 states have internal predecessors, (3680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:27,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2848 states to 2848 states and 3680 transitions. [2022-01-11 07:40:27,722 INFO L78 Accepts]: Start accepts. Automaton has 2848 states and 3680 transitions. Word has length 99 [2022-01-11 07:40:27,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:27,722 INFO L470 AbstractCegarLoop]: Abstraction has 2848 states and 3680 transitions. [2022-01-11 07:40:27,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:27,722 INFO L276 IsEmpty]: Start isEmpty. Operand 2848 states and 3680 transitions. [2022-01-11 07:40:27,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-11 07:40:27,724 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:27,724 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] [2022-01-11 07:40:27,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-11 07:40:27,725 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:27,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:27,725 INFO L85 PathProgramCache]: Analyzing trace with hash -537767135, now seen corresponding path program 1 times [2022-01-11 07:40:27,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:27,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852119840] [2022-01-11 07:40:27,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:27,725 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:27,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:27,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:27,745 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:27,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852119840] [2022-01-11 07:40:27,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852119840] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:27,745 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:27,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:40:27,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246310444] [2022-01-11 07:40:27,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:27,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:27,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:27,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:27,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:27,746 INFO L87 Difference]: Start difference. First operand 2848 states and 3680 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:27,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:27,929 INFO L93 Difference]: Finished difference Result 4047 states and 5348 transitions. [2022-01-11 07:40:27,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:27,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-01-11 07:40:27,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:27,935 INFO L225 Difference]: With dead ends: 4047 [2022-01-11 07:40:27,935 INFO L226 Difference]: Without dead ends: 2848 [2022-01-11 07:40:27,936 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:27,937 INFO L933 BasicCegarLoop]: 1050 mSDtfsCounter, 972 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 972 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:27,937 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [972 Valid, 1115 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:27,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2848 states. [2022-01-11 07:40:28,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2848 to 2848. [2022-01-11 07:40:28,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2848 states, 2846 states have (on average 1.2846099789177794) internal successors, (3656), 2847 states have internal predecessors, (3656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:28,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2848 states to 2848 states and 3656 transitions. [2022-01-11 07:40:28,103 INFO L78 Accepts]: Start accepts. Automaton has 2848 states and 3656 transitions. Word has length 99 [2022-01-11 07:40:28,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:28,103 INFO L470 AbstractCegarLoop]: Abstraction has 2848 states and 3656 transitions. [2022-01-11 07:40:28,103 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:28,104 INFO L276 IsEmpty]: Start isEmpty. Operand 2848 states and 3656 transitions. [2022-01-11 07:40:28,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-11 07:40:28,105 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:28,106 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] [2022-01-11 07:40:28,106 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-11 07:40:28,106 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:28,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:28,106 INFO L85 PathProgramCache]: Analyzing trace with hash -660617088, now seen corresponding path program 1 times [2022-01-11 07:40:28,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:28,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671386579] [2022-01-11 07:40:28,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:28,106 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:28,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:28,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:28,127 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:28,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671386579] [2022-01-11 07:40:28,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671386579] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:28,128 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:28,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:40:28,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173586870] [2022-01-11 07:40:28,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:28,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:28,128 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:28,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:28,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:28,129 INFO L87 Difference]: Start difference. First operand 2848 states and 3656 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:28,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:28,339 INFO L93 Difference]: Finished difference Result 4045 states and 5297 transitions. [2022-01-11 07:40:28,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:28,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-01-11 07:40:28,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:28,343 INFO L225 Difference]: With dead ends: 4045 [2022-01-11 07:40:28,343 INFO L226 Difference]: Without dead ends: 2848 [2022-01-11 07:40:28,344 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:28,345 INFO L933 BasicCegarLoop]: 1036 mSDtfsCounter, 957 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 957 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:28,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [957 Valid, 1100 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:28,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2848 states. [2022-01-11 07:40:28,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2848 to 2848. [2022-01-11 07:40:28,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2848 states, 2846 states have (on average 1.2761770906535488) internal successors, (3632), 2847 states have internal predecessors, (3632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:28,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2848 states to 2848 states and 3632 transitions. [2022-01-11 07:40:28,521 INFO L78 Accepts]: Start accepts. Automaton has 2848 states and 3632 transitions. Word has length 99 [2022-01-11 07:40:28,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:28,521 INFO L470 AbstractCegarLoop]: Abstraction has 2848 states and 3632 transitions. [2022-01-11 07:40:28,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:28,522 INFO L276 IsEmpty]: Start isEmpty. Operand 2848 states and 3632 transitions. [2022-01-11 07:40:28,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-11 07:40:28,523 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:28,523 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] [2022-01-11 07:40:28,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-11 07:40:28,523 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:28,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:28,524 INFO L85 PathProgramCache]: Analyzing trace with hash 2123803743, now seen corresponding path program 1 times [2022-01-11 07:40:28,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:28,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919007831] [2022-01-11 07:40:28,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:28,524 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:28,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:28,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:28,545 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:28,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919007831] [2022-01-11 07:40:28,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919007831] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:28,546 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:28,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:40:28,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959707461] [2022-01-11 07:40:28,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:28,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:28,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:28,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:28,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:28,546 INFO L87 Difference]: Start difference. First operand 2848 states and 3632 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:28,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:28,773 INFO L93 Difference]: Finished difference Result 4044 states and 5248 transitions. [2022-01-11 07:40:28,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:28,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-01-11 07:40:28,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:28,776 INFO L225 Difference]: With dead ends: 4044 [2022-01-11 07:40:28,777 INFO L226 Difference]: Without dead ends: 2848 [2022-01-11 07:40:28,778 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:28,778 INFO L933 BasicCegarLoop]: 1022 mSDtfsCounter, 943 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 943 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:28,778 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [943 Valid, 1085 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:28,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2848 states. [2022-01-11 07:40:29,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2848 to 2848. [2022-01-11 07:40:29,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2848 states, 2846 states have (on average 1.2677442023893184) internal successors, (3608), 2847 states have internal predecessors, (3608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:29,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2848 states to 2848 states and 3608 transitions. [2022-01-11 07:40:29,027 INFO L78 Accepts]: Start accepts. Automaton has 2848 states and 3608 transitions. Word has length 99 [2022-01-11 07:40:29,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:29,027 INFO L470 AbstractCegarLoop]: Abstraction has 2848 states and 3608 transitions. [2022-01-11 07:40:29,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:29,027 INFO L276 IsEmpty]: Start isEmpty. Operand 2848 states and 3608 transitions. [2022-01-11 07:40:29,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-11 07:40:29,029 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:29,029 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] [2022-01-11 07:40:29,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-11 07:40:29,030 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:29,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:29,030 INFO L85 PathProgramCache]: Analyzing trace with hash 139245886, now seen corresponding path program 1 times [2022-01-11 07:40:29,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:29,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135052584] [2022-01-11 07:40:29,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:29,030 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:29,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:29,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:29,069 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:29,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135052584] [2022-01-11 07:40:29,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135052584] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:29,069 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:29,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 07:40:29,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449221321] [2022-01-11 07:40:29,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:29,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 07:40:29,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:29,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 07:40:29,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 07:40:29,070 INFO L87 Difference]: Start difference. First operand 2848 states and 3608 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:29,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:29,348 INFO L93 Difference]: Finished difference Result 4559 states and 5920 transitions. [2022-01-11 07:40:29,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 07:40:29,349 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-01-11 07:40:29,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:29,354 INFO L225 Difference]: With dead ends: 4559 [2022-01-11 07:40:29,354 INFO L226 Difference]: Without dead ends: 3370 [2022-01-11 07:40:29,355 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 07:40:29,356 INFO L933 BasicCegarLoop]: 997 mSDtfsCounter, 2576 mSDsluCounter, 1474 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2576 SdHoareTripleChecker+Valid, 2471 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:29,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2576 Valid, 2471 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 07:40:29,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3370 states. [2022-01-11 07:40:29,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3370 to 2854. [2022-01-11 07:40:29,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2854 states, 2852 states have (on average 1.261570827489481) internal successors, (3598), 2853 states have internal predecessors, (3598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:29,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2854 states to 2854 states and 3598 transitions. [2022-01-11 07:40:29,547 INFO L78 Accepts]: Start accepts. Automaton has 2854 states and 3598 transitions. Word has length 99 [2022-01-11 07:40:29,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:29,547 INFO L470 AbstractCegarLoop]: Abstraction has 2854 states and 3598 transitions. [2022-01-11 07:40:29,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:29,547 INFO L276 IsEmpty]: Start isEmpty. Operand 2854 states and 3598 transitions. [2022-01-11 07:40:29,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-11 07:40:29,549 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:29,549 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] [2022-01-11 07:40:29,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-11 07:40:29,549 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:29,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:29,550 INFO L85 PathProgramCache]: Analyzing trace with hash -468830977, now seen corresponding path program 1 times [2022-01-11 07:40:29,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:29,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902103419] [2022-01-11 07:40:29,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:29,550 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:29,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:29,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:29,601 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:29,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902103419] [2022-01-11 07:40:29,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902103419] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:29,601 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:29,601 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 07:40:29,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588550815] [2022-01-11 07:40:29,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:29,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 07:40:29,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:29,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 07:40:29,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 07:40:29,602 INFO L87 Difference]: Start difference. First operand 2854 states and 3598 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:29,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:29,904 INFO L93 Difference]: Finished difference Result 4808 states and 6196 transitions. [2022-01-11 07:40:29,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 07:40:29,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-01-11 07:40:29,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:29,909 INFO L225 Difference]: With dead ends: 4808 [2022-01-11 07:40:29,909 INFO L226 Difference]: Without dead ends: 3634 [2022-01-11 07:40:29,911 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 07:40:29,911 INFO L933 BasicCegarLoop]: 1051 mSDtfsCounter, 2175 mSDsluCounter, 2096 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2175 SdHoareTripleChecker+Valid, 3147 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:29,911 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2175 Valid, 3147 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 07:40:29,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3634 states. [2022-01-11 07:40:30,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3634 to 2860. [2022-01-11 07:40:30,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2860 states, 2858 states have (on average 1.2554233729881035) internal successors, (3588), 2859 states have internal predecessors, (3588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:30,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 3588 transitions. [2022-01-11 07:40:30,113 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 3588 transitions. Word has length 99 [2022-01-11 07:40:30,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:30,113 INFO L470 AbstractCegarLoop]: Abstraction has 2860 states and 3588 transitions. [2022-01-11 07:40:30,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:30,113 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 3588 transitions. [2022-01-11 07:40:30,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-11 07:40:30,114 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:30,115 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] [2022-01-11 07:40:30,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-11 07:40:30,115 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:30,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:30,115 INFO L85 PathProgramCache]: Analyzing trace with hash -476590336, now seen corresponding path program 1 times [2022-01-11 07:40:30,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:30,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027081364] [2022-01-11 07:40:30,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:30,115 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:30,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:30,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:30,157 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:30,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027081364] [2022-01-11 07:40:30,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027081364] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:30,158 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:30,158 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:40:30,158 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700637999] [2022-01-11 07:40:30,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:30,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:30,158 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:30,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:30,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:30,159 INFO L87 Difference]: Start difference. First operand 2860 states and 3588 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:30,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:30,449 INFO L93 Difference]: Finished difference Result 5059 states and 6450 transitions. [2022-01-11 07:40:30,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:30,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-01-11 07:40:30,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:30,453 INFO L225 Difference]: With dead ends: 5059 [2022-01-11 07:40:30,453 INFO L226 Difference]: Without dead ends: 3881 [2022-01-11 07:40:30,454 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:30,455 INFO L933 BasicCegarLoop]: 1005 mSDtfsCounter, 869 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 1757 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:30,455 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [869 Valid, 1757 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:30,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3881 states. [2022-01-11 07:40:30,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3881 to 3875. [2022-01-11 07:40:30,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3875 states, 3873 states have (on average 1.26284533953008) internal successors, (4891), 3874 states have internal predecessors, (4891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:30,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3875 states to 3875 states and 4891 transitions. [2022-01-11 07:40:30,709 INFO L78 Accepts]: Start accepts. Automaton has 3875 states and 4891 transitions. Word has length 99 [2022-01-11 07:40:30,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:30,709 INFO L470 AbstractCegarLoop]: Abstraction has 3875 states and 4891 transitions. [2022-01-11 07:40:30,709 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:30,709 INFO L276 IsEmpty]: Start isEmpty. Operand 3875 states and 4891 transitions. [2022-01-11 07:40:30,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-11 07:40:30,711 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:30,711 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] [2022-01-11 07:40:30,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-11 07:40:30,711 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:30,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:30,711 INFO L85 PathProgramCache]: Analyzing trace with hash -872345473, now seen corresponding path program 1 times [2022-01-11 07:40:30,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:30,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583427119] [2022-01-11 07:40:30,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:30,712 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:30,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:30,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:30,742 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:30,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583427119] [2022-01-11 07:40:30,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583427119] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:30,742 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:30,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:40:30,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052647561] [2022-01-11 07:40:30,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:30,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:30,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:30,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:30,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:30,743 INFO L87 Difference]: Start difference. First operand 3875 states and 4891 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:31,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:31,016 INFO L93 Difference]: Finished difference Result 6100 states and 7769 transitions. [2022-01-11 07:40:31,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:31,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-01-11 07:40:31,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:31,020 INFO L225 Difference]: With dead ends: 6100 [2022-01-11 07:40:31,020 INFO L226 Difference]: Without dead ends: 3875 [2022-01-11 07:40:31,023 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:31,024 INFO L933 BasicCegarLoop]: 989 mSDtfsCounter, 857 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:31,026 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [857 Valid, 1049 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:31,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3875 states. [2022-01-11 07:40:31,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3875 to 3875. [2022-01-11 07:40:31,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3875 states, 3873 states have (on average 1.2553576039246062) internal successors, (4862), 3874 states have internal predecessors, (4862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:31,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3875 states to 3875 states and 4862 transitions. [2022-01-11 07:40:31,306 INFO L78 Accepts]: Start accepts. Automaton has 3875 states and 4862 transitions. Word has length 99 [2022-01-11 07:40:31,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:31,306 INFO L470 AbstractCegarLoop]: Abstraction has 3875 states and 4862 transitions. [2022-01-11 07:40:31,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:31,306 INFO L276 IsEmpty]: Start isEmpty. Operand 3875 states and 4862 transitions. [2022-01-11 07:40:31,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-11 07:40:31,307 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:31,307 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] [2022-01-11 07:40:31,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-11 07:40:31,308 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:31,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:31,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1869417826, now seen corresponding path program 1 times [2022-01-11 07:40:31,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:31,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118115106] [2022-01-11 07:40:31,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:31,308 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:31,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:31,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:31,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118115106] [2022-01-11 07:40:31,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118115106] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:31,336 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:31,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:40:31,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561920128] [2022-01-11 07:40:31,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:31,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:31,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:31,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:31,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:31,337 INFO L87 Difference]: Start difference. First operand 3875 states and 4862 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:31,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:31,750 INFO L93 Difference]: Finished difference Result 8196 states and 10406 transitions. [2022-01-11 07:40:31,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:31,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-01-11 07:40:31,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:31,755 INFO L225 Difference]: With dead ends: 8196 [2022-01-11 07:40:31,755 INFO L226 Difference]: Without dead ends: 5975 [2022-01-11 07:40:31,757 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:31,758 INFO L933 BasicCegarLoop]: 989 mSDtfsCounter, 877 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 877 SdHoareTripleChecker+Valid, 1730 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:31,758 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [877 Valid, 1730 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:31,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5975 states. [2022-01-11 07:40:32,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5975 to 5785. [2022-01-11 07:40:32,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5785 states, 5783 states have (on average 1.2602455472937921) internal successors, (7288), 5784 states have internal predecessors, (7288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:32,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5785 states to 5785 states and 7288 transitions. [2022-01-11 07:40:32,124 INFO L78 Accepts]: Start accepts. Automaton has 5785 states and 7288 transitions. Word has length 99 [2022-01-11 07:40:32,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:32,124 INFO L470 AbstractCegarLoop]: Abstraction has 5785 states and 7288 transitions. [2022-01-11 07:40:32,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:32,125 INFO L276 IsEmpty]: Start isEmpty. Operand 5785 states and 7288 transitions. [2022-01-11 07:40:32,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-01-11 07:40:32,126 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:32,126 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2022-01-11 07:40:32,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-11 07:40:32,126 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:32,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:32,127 INFO L85 PathProgramCache]: Analyzing trace with hash 2108109651, now seen corresponding path program 1 times [2022-01-11 07:40:32,127 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:32,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654351268] [2022-01-11 07:40:32,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:32,127 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:32,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:32,145 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-01-11 07:40:32,145 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:32,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654351268] [2022-01-11 07:40:32,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654351268] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:32,146 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:32,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:40:32,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034609120] [2022-01-11 07:40:32,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:32,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:32,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:32,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:32,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:32,146 INFO L87 Difference]: Start difference. First operand 5785 states and 7288 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:32,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:32,570 INFO L93 Difference]: Finished difference Result 7429 states and 9392 transitions. [2022-01-11 07:40:32,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:32,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 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 100 [2022-01-11 07:40:32,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:32,577 INFO L225 Difference]: With dead ends: 7429 [2022-01-11 07:40:32,577 INFO L226 Difference]: Without dead ends: 6061 [2022-01-11 07:40:32,580 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:32,580 INFO L933 BasicCegarLoop]: 995 mSDtfsCounter, 975 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 975 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:32,580 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [975 Valid, 1083 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:32,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6061 states. [2022-01-11 07:40:32,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6061 to 6022. [2022-01-11 07:40:32,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6022 states, 6020 states have (on average 1.2667774086378738) internal successors, (7626), 6021 states have internal predecessors, (7626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:32,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6022 states to 6022 states and 7626 transitions. [2022-01-11 07:40:32,980 INFO L78 Accepts]: Start accepts. Automaton has 6022 states and 7626 transitions. Word has length 100 [2022-01-11 07:40:32,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:32,981 INFO L470 AbstractCegarLoop]: Abstraction has 6022 states and 7626 transitions. [2022-01-11 07:40:32,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:32,981 INFO L276 IsEmpty]: Start isEmpty. Operand 6022 states and 7626 transitions. [2022-01-11 07:40:32,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 07:40:32,982 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:32,982 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:40:32,982 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-11 07:40:32,983 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:32,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:32,983 INFO L85 PathProgramCache]: Analyzing trace with hash 2077459813, now seen corresponding path program 1 times [2022-01-11 07:40:32,983 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:33,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211513049] [2022-01-11 07:40:33,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:33,001 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:33,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:33,029 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-11 07:40:33,029 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:33,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211513049] [2022-01-11 07:40:33,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211513049] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:33,029 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:33,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:40:33,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957610689] [2022-01-11 07:40:33,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:33,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:33,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:33,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:33,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:33,031 INFO L87 Difference]: Start difference. First operand 6022 states and 7626 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:33,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:33,501 INFO L93 Difference]: Finished difference Result 7631 states and 9671 transitions. [2022-01-11 07:40:33,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:33,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 110 [2022-01-11 07:40:33,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:33,507 INFO L225 Difference]: With dead ends: 7631 [2022-01-11 07:40:33,507 INFO L226 Difference]: Without dead ends: 6030 [2022-01-11 07:40:33,509 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:33,510 INFO L933 BasicCegarLoop]: 983 mSDtfsCounter, 69 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1856 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:33,510 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 1856 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:33,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6030 states. [2022-01-11 07:40:33,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6030 to 6030. [2022-01-11 07:40:33,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6030 states, 6028 states have (on average 1.2621101526211016) internal successors, (7608), 6029 states have internal predecessors, (7608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:33,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6030 states to 6030 states and 7608 transitions. [2022-01-11 07:40:33,944 INFO L78 Accepts]: Start accepts. Automaton has 6030 states and 7608 transitions. Word has length 110 [2022-01-11 07:40:33,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:33,944 INFO L470 AbstractCegarLoop]: Abstraction has 6030 states and 7608 transitions. [2022-01-11 07:40:33,944 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:33,944 INFO L276 IsEmpty]: Start isEmpty. Operand 6030 states and 7608 transitions. [2022-01-11 07:40:33,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 07:40:33,946 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:33,946 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:40:33,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-11 07:40:33,946 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:33,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:33,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1836919684, now seen corresponding path program 1 times [2022-01-11 07:40:33,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:33,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549477515] [2022-01-11 07:40:33,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:33,947 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:33,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:33,994 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-11 07:40:33,994 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:33,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549477515] [2022-01-11 07:40:33,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549477515] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:33,994 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:33,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:40:33,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962163536] [2022-01-11 07:40:33,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:33,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:33,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:33,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:33,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:33,995 INFO L87 Difference]: Start difference. First operand 6030 states and 7608 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:34,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:34,349 INFO L93 Difference]: Finished difference Result 6793 states and 8566 transitions. [2022-01-11 07:40:34,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:34,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 110 [2022-01-11 07:40:34,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:34,356 INFO L225 Difference]: With dead ends: 6793 [2022-01-11 07:40:34,356 INFO L226 Difference]: Without dead ends: 5184 [2022-01-11 07:40:34,359 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:34,360 INFO L933 BasicCegarLoop]: 986 mSDtfsCounter, 948 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:34,360 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [948 Valid, 1007 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:34,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5184 states. [2022-01-11 07:40:34,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5184 to 5184. [2022-01-11 07:40:34,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5184 states, 5182 states have (on average 1.2591663450405248) internal successors, (6525), 5183 states have internal predecessors, (6525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:34,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5184 states to 5184 states and 6525 transitions. [2022-01-11 07:40:34,746 INFO L78 Accepts]: Start accepts. Automaton has 5184 states and 6525 transitions. Word has length 110 [2022-01-11 07:40:34,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:34,746 INFO L470 AbstractCegarLoop]: Abstraction has 5184 states and 6525 transitions. [2022-01-11 07:40:34,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:34,747 INFO L276 IsEmpty]: Start isEmpty. Operand 5184 states and 6525 transitions. [2022-01-11 07:40:34,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-11 07:40:34,748 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:34,748 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:40:34,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-11 07:40:34,748 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:34,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:34,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1943714683, now seen corresponding path program 1 times [2022-01-11 07:40:34,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:34,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717017494] [2022-01-11 07:40:34,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:34,749 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:34,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:34,778 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-11 07:40:34,779 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:34,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717017494] [2022-01-11 07:40:34,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717017494] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:34,779 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:34,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:40:34,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345759414] [2022-01-11 07:40:34,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:34,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:34,779 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:34,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:34,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:34,780 INFO L87 Difference]: Start difference. First operand 5184 states and 6525 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:35,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:35,132 INFO L93 Difference]: Finished difference Result 5956 states and 7469 transitions. [2022-01-11 07:40:35,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:35,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 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 113 [2022-01-11 07:40:35,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:35,138 INFO L225 Difference]: With dead ends: 5956 [2022-01-11 07:40:35,139 INFO L226 Difference]: Without dead ends: 5193 [2022-01-11 07:40:35,140 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:35,140 INFO L933 BasicCegarLoop]: 985 mSDtfsCounter, 60 mSDsluCounter, 875 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1860 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:35,141 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 1860 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:35,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5193 states. [2022-01-11 07:40:35,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5193 to 5193. [2022-01-11 07:40:35,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5193 states, 5191 states have (on average 1.2560200346753998) internal successors, (6520), 5192 states have internal predecessors, (6520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:35,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5193 states to 5193 states and 6520 transitions. [2022-01-11 07:40:35,524 INFO L78 Accepts]: Start accepts. Automaton has 5193 states and 6520 transitions. Word has length 113 [2022-01-11 07:40:35,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:35,524 INFO L470 AbstractCegarLoop]: Abstraction has 5193 states and 6520 transitions. [2022-01-11 07:40:35,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:35,525 INFO L276 IsEmpty]: Start isEmpty. Operand 5193 states and 6520 transitions. [2022-01-11 07:40:35,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-11 07:40:35,526 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:35,526 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:40:35,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-11 07:40:35,526 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:35,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:35,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1902555974, now seen corresponding path program 1 times [2022-01-11 07:40:35,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:35,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347982658] [2022-01-11 07:40:35,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:35,527 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:35,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:35,574 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-11 07:40:35,575 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:35,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347982658] [2022-01-11 07:40:35,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347982658] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:35,575 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:35,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:40:35,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869079005] [2022-01-11 07:40:35,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:35,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:35,576 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:35,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:35,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:35,576 INFO L87 Difference]: Start difference. First operand 5193 states and 6520 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:35,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:35,902 INFO L93 Difference]: Finished difference Result 5588 states and 6983 transitions. [2022-01-11 07:40:35,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:35,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 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 113 [2022-01-11 07:40:35,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:35,908 INFO L225 Difference]: With dead ends: 5588 [2022-01-11 07:40:35,908 INFO L226 Difference]: Without dead ends: 4160 [2022-01-11 07:40:35,910 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:35,910 INFO L933 BasicCegarLoop]: 982 mSDtfsCounter, 933 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 933 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:35,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [933 Valid, 1000 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:35,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4160 states. [2022-01-11 07:40:36,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4160 to 4160. [2022-01-11 07:40:36,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4160 states, 4159 states have (on average 1.2762683337340708) internal successors, (5308), 4159 states have internal predecessors, (5308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:36,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4160 states to 4160 states and 5308 transitions. [2022-01-11 07:40:36,165 INFO L78 Accepts]: Start accepts. Automaton has 4160 states and 5308 transitions. Word has length 113 [2022-01-11 07:40:36,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:36,165 INFO L470 AbstractCegarLoop]: Abstraction has 4160 states and 5308 transitions. [2022-01-11 07:40:36,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:36,165 INFO L276 IsEmpty]: Start isEmpty. Operand 4160 states and 5308 transitions. [2022-01-11 07:40:36,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-01-11 07:40:36,167 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:36,167 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] [2022-01-11 07:40:36,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-11 07:40:36,167 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:36,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:36,168 INFO L85 PathProgramCache]: Analyzing trace with hash -480225039, now seen corresponding path program 1 times [2022-01-11 07:40:36,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:36,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638051113] [2022-01-11 07:40:36,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:36,168 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:36,199 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:36,200 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:36,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638051113] [2022-01-11 07:40:36,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638051113] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:36,200 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:36,200 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:40:36,200 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142932680] [2022-01-11 07:40:36,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:36,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:36,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:36,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:36,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:36,201 INFO L87 Difference]: Start difference. First operand 4160 states and 5308 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:36,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:36,756 INFO L93 Difference]: Finished difference Result 12218 states and 15621 transitions. [2022-01-11 07:40:36,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:36,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 160 [2022-01-11 07:40:36,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:36,765 INFO L225 Difference]: With dead ends: 12218 [2022-01-11 07:40:36,765 INFO L226 Difference]: Without dead ends: 8093 [2022-01-11 07:40:36,769 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:36,770 INFO L933 BasicCegarLoop]: 857 mSDtfsCounter, 766 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:36,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [766 Valid, 1598 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:36,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8093 states. [2022-01-11 07:40:37,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8093 to 7751. [2022-01-11 07:40:37,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7751 states, 7750 states have (on average 1.273548387096774) internal successors, (9870), 7750 states have internal predecessors, (9870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:37,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7751 states to 7751 states and 9870 transitions. [2022-01-11 07:40:37,296 INFO L78 Accepts]: Start accepts. Automaton has 7751 states and 9870 transitions. Word has length 160 [2022-01-11 07:40:37,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:37,296 INFO L470 AbstractCegarLoop]: Abstraction has 7751 states and 9870 transitions. [2022-01-11 07:40:37,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:37,297 INFO L276 IsEmpty]: Start isEmpty. Operand 7751 states and 9870 transitions. [2022-01-11 07:40:37,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-01-11 07:40:37,299 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:37,299 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] [2022-01-11 07:40:37,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-11 07:40:37,299 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:37,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:37,300 INFO L85 PathProgramCache]: Analyzing trace with hash 926897746, now seen corresponding path program 1 times [2022-01-11 07:40:37,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:37,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344208674] [2022-01-11 07:40:37,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:37,300 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:37,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:37,333 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:37,333 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:37,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344208674] [2022-01-11 07:40:37,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344208674] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:37,333 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:37,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:40:37,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775643387] [2022-01-11 07:40:37,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:37,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:37,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:37,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:37,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:37,334 INFO L87 Difference]: Start difference. First operand 7751 states and 9870 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:38,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:38,392 INFO L93 Difference]: Finished difference Result 22753 states and 28792 transitions. [2022-01-11 07:40:38,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:38,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 160 [2022-01-11 07:40:38,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:38,409 INFO L225 Difference]: With dead ends: 22753 [2022-01-11 07:40:38,409 INFO L226 Difference]: Without dead ends: 15091 [2022-01-11 07:40:38,417 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:38,418 INFO L933 BasicCegarLoop]: 1024 mSDtfsCounter, 766 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 1863 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:38,418 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [766 Valid, 1863 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:38,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15091 states. [2022-01-11 07:40:39,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15091 to 14781. [2022-01-11 07:40:39,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14781 states, 14780 states have (on average 1.2569688768606224) internal successors, (18578), 14780 states have internal predecessors, (18578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:39,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14781 states to 14781 states and 18578 transitions. [2022-01-11 07:40:39,444 INFO L78 Accepts]: Start accepts. Automaton has 14781 states and 18578 transitions. Word has length 160 [2022-01-11 07:40:39,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:39,444 INFO L470 AbstractCegarLoop]: Abstraction has 14781 states and 18578 transitions. [2022-01-11 07:40:39,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:39,444 INFO L276 IsEmpty]: Start isEmpty. Operand 14781 states and 18578 transitions. [2022-01-11 07:40:39,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-01-11 07:40:39,449 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:39,449 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] [2022-01-11 07:40:39,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-11 07:40:39,463 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:39,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:39,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1782254865, now seen corresponding path program 1 times [2022-01-11 07:40:39,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:39,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699294406] [2022-01-11 07:40:39,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:39,464 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:39,516 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-11 07:40:39,517 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:39,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699294406] [2022-01-11 07:40:39,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699294406] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:39,517 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:39,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:40:39,517 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878212721] [2022-01-11 07:40:39,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:39,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:39,518 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:39,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:39,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:39,518 INFO L87 Difference]: Start difference. First operand 14781 states and 18578 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:40,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:40,524 INFO L93 Difference]: Finished difference Result 29441 states and 37013 transitions. [2022-01-11 07:40:40,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:40,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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 160 [2022-01-11 07:40:40,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:40,540 INFO L225 Difference]: With dead ends: 29441 [2022-01-11 07:40:40,541 INFO L226 Difference]: Without dead ends: 14699 [2022-01-11 07:40:40,552 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:40,553 INFO L933 BasicCegarLoop]: 867 mSDtfsCounter, 862 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:40,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [862 Valid, 868 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:40,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14699 states. [2022-01-11 07:40:41,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14699 to 14699. [2022-01-11 07:40:41,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14699 states, 14698 states have (on average 1.2573819567288067) internal successors, (18481), 14698 states have internal predecessors, (18481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:41,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14699 states to 14699 states and 18481 transitions. [2022-01-11 07:40:41,569 INFO L78 Accepts]: Start accepts. Automaton has 14699 states and 18481 transitions. Word has length 160 [2022-01-11 07:40:41,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:41,570 INFO L470 AbstractCegarLoop]: Abstraction has 14699 states and 18481 transitions. [2022-01-11 07:40:41,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:41,570 INFO L276 IsEmpty]: Start isEmpty. Operand 14699 states and 18481 transitions. [2022-01-11 07:40:41,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-01-11 07:40:41,574 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:41,574 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] [2022-01-11 07:40:41,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-11 07:40:41,574 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:41,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:41,575 INFO L85 PathProgramCache]: Analyzing trace with hash -105740519, now seen corresponding path program 1 times [2022-01-11 07:40:41,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:41,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590490223] [2022-01-11 07:40:41,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:41,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:41,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:41,606 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:41,606 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:41,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590490223] [2022-01-11 07:40:41,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590490223] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:41,606 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:41,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:40:41,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96026723] [2022-01-11 07:40:41,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:41,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:41,607 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:41,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:41,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:41,607 INFO L87 Difference]: Start difference. First operand 14699 states and 18481 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:43,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:43,646 INFO L93 Difference]: Finished difference Result 43040 states and 53953 transitions. [2022-01-11 07:40:43,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:43,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2022-01-11 07:40:43,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:43,679 INFO L225 Difference]: With dead ends: 43040 [2022-01-11 07:40:43,679 INFO L226 Difference]: Without dead ends: 28430 [2022-01-11 07:40:43,695 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:43,695 INFO L933 BasicCegarLoop]: 1062 mSDtfsCounter, 765 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 1899 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:43,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [765 Valid, 1899 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:43,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28430 states. [2022-01-11 07:40:45,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28430 to 27324. [2022-01-11 07:40:45,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27324 states, 27323 states have (on average 1.2487281777257255) internal successors, (34119), 27323 states have internal predecessors, (34119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:45,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27324 states to 27324 states and 34119 transitions. [2022-01-11 07:40:45,933 INFO L78 Accepts]: Start accepts. Automaton has 27324 states and 34119 transitions. Word has length 161 [2022-01-11 07:40:45,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:45,934 INFO L470 AbstractCegarLoop]: Abstraction has 27324 states and 34119 transitions. [2022-01-11 07:40:45,934 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:45,934 INFO L276 IsEmpty]: Start isEmpty. Operand 27324 states and 34119 transitions. [2022-01-11 07:40:45,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-01-11 07:40:45,942 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:45,942 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] [2022-01-11 07:40:45,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-11 07:40:45,943 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:45,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:45,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1559564409, now seen corresponding path program 1 times [2022-01-11 07:40:45,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:45,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977438761] [2022-01-11 07:40:45,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:45,943 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:45,974 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-11 07:40:45,974 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:45,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977438761] [2022-01-11 07:40:45,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977438761] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:45,975 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:45,975 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:40:45,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71186891] [2022-01-11 07:40:45,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:45,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:45,975 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:45,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:45,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:45,976 INFO L87 Difference]: Start difference. First operand 27324 states and 34119 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:48,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:48,070 INFO L93 Difference]: Finished difference Result 54521 states and 68089 transitions. [2022-01-11 07:40:48,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:48,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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 161 [2022-01-11 07:40:48,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:48,105 INFO L225 Difference]: With dead ends: 54521 [2022-01-11 07:40:48,105 INFO L226 Difference]: Without dead ends: 27243 [2022-01-11 07:40:48,123 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:48,124 INFO L933 BasicCegarLoop]: 866 mSDtfsCounter, 860 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:48,124 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [860 Valid, 867 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:48,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27243 states. [2022-01-11 07:40:50,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27243 to 27243. [2022-01-11 07:40:50,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27243 states, 27242 states have (on average 1.2489538213053373) internal successors, (34024), 27242 states have internal predecessors, (34024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:50,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27243 states to 27243 states and 34024 transitions. [2022-01-11 07:40:50,394 INFO L78 Accepts]: Start accepts. Automaton has 27243 states and 34024 transitions. Word has length 161 [2022-01-11 07:40:50,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:50,394 INFO L470 AbstractCegarLoop]: Abstraction has 27243 states and 34024 transitions. [2022-01-11 07:40:50,395 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:50,395 INFO L276 IsEmpty]: Start isEmpty. Operand 27243 states and 34024 transitions. [2022-01-11 07:40:50,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-01-11 07:40:50,402 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:50,402 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] [2022-01-11 07:40:50,402 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-11 07:40:50,402 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:50,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:50,402 INFO L85 PathProgramCache]: Analyzing trace with hash 813824287, now seen corresponding path program 1 times [2022-01-11 07:40:50,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:50,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255734630] [2022-01-11 07:40:50,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:50,403 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:50,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:50,438 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:50,438 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:50,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255734630] [2022-01-11 07:40:50,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255734630] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:50,438 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:50,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:40:50,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819459514] [2022-01-11 07:40:50,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:50,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:50,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:50,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:50,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:50,439 INFO L87 Difference]: Start difference. First operand 27243 states and 34024 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:54,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:54,434 INFO L93 Difference]: Finished difference Result 77935 states and 97222 transitions. [2022-01-11 07:40:54,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:54,435 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2022-01-11 07:40:54,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:54,517 INFO L225 Difference]: With dead ends: 77935 [2022-01-11 07:40:54,517 INFO L226 Difference]: Without dead ends: 50781 [2022-01-11 07:40:54,544 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:54,545 INFO L933 BasicCegarLoop]: 1193 mSDtfsCounter, 629 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 2037 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:54,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [629 Valid, 2037 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:54,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50781 states. [2022-01-11 07:40:58,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50781 to 50779. [2022-01-11 07:40:58,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50779 states, 50778 states have (on average 1.244397179881051) internal successors, (63188), 50778 states have internal predecessors, (63188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:58,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50779 states to 50779 states and 63188 transitions. [2022-01-11 07:40:58,736 INFO L78 Accepts]: Start accepts. Automaton has 50779 states and 63188 transitions. Word has length 162 [2022-01-11 07:40:58,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:58,737 INFO L470 AbstractCegarLoop]: Abstraction has 50779 states and 63188 transitions. [2022-01-11 07:40:58,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:58,737 INFO L276 IsEmpty]: Start isEmpty. Operand 50779 states and 63188 transitions. [2022-01-11 07:40:58,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-01-11 07:40:58,751 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:58,751 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] [2022-01-11 07:40:58,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-11 07:40:58,752 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:58,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:58,752 INFO L85 PathProgramCache]: Analyzing trace with hash 508189758, now seen corresponding path program 1 times [2022-01-11 07:40:58,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:58,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633196172] [2022-01-11 07:40:58,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:58,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:58,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:58,774 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-11 07:40:58,774 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:58,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633196172] [2022-01-11 07:40:58,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633196172] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:58,775 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:58,775 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:40:58,775 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561350565] [2022-01-11 07:40:58,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:58,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:58,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:58,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:58,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:58,776 INFO L87 Difference]: Start difference. First operand 50779 states and 63188 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:02,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:02,799 INFO L93 Difference]: Finished difference Result 101389 states and 126181 transitions. [2022-01-11 07:41:02,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:41:02,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 162 [2022-01-11 07:41:02,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:02,873 INFO L225 Difference]: With dead ends: 101389 [2022-01-11 07:41:02,874 INFO L226 Difference]: Without dead ends: 50699 [2022-01-11 07:41:02,910 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:02,910 INFO L933 BasicCegarLoop]: 865 mSDtfsCounter, 858 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:02,911 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [858 Valid, 866 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:02,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50699 states. [2022-01-11 07:41:06,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50699 to 50699. [2022-01-11 07:41:06,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50699 states, 50698 states have (on average 1.2445264112982761) internal successors, (63095), 50698 states have internal predecessors, (63095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:07,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50699 states to 50699 states and 63095 transitions. [2022-01-11 07:41:07,061 INFO L78 Accepts]: Start accepts. Automaton has 50699 states and 63095 transitions. Word has length 162 [2022-01-11 07:41:07,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:07,061 INFO L470 AbstractCegarLoop]: Abstraction has 50699 states and 63095 transitions. [2022-01-11 07:41:07,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:07,062 INFO L276 IsEmpty]: Start isEmpty. Operand 50699 states and 63095 transitions. [2022-01-11 07:41:07,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-01-11 07:41:07,073 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:07,073 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] [2022-01-11 07:41:07,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-01-11 07:41:07,073 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:07,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:07,074 INFO L85 PathProgramCache]: Analyzing trace with hash 543721482, now seen corresponding path program 1 times [2022-01-11 07:41:07,074 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:07,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029131723] [2022-01-11 07:41:07,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:07,074 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:07,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:07,104 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:41:07,104 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:07,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029131723] [2022-01-11 07:41:07,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029131723] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:07,104 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:07,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:41:07,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469705524] [2022-01-11 07:41:07,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:07,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:41:07,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:07,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:41:07,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:07,105 INFO L87 Difference]: Start difference. First operand 50699 states and 63095 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:14,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:14,673 INFO L93 Difference]: Finished difference Result 149342 states and 185715 transitions. [2022-01-11 07:41:14,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:41:14,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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 163 [2022-01-11 07:41:14,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:14,842 INFO L225 Difference]: With dead ends: 149342 [2022-01-11 07:41:14,842 INFO L226 Difference]: Without dead ends: 98732 [2022-01-11 07:41:14,883 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:14,884 INFO L933 BasicCegarLoop]: 1052 mSDtfsCounter, 766 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 1885 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:14,884 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [766 Valid, 1885 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:14,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98732 states.