/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf -i ../../../trunk/examples/svcomp/combinations/pc_sfifo_3.cil+token_ring.06.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 14:14:29,538 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 14:14:29,540 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 14:14:29,573 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 14:14:29,574 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 14:14:29,575 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 14:14:29,576 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 14:14:29,593 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 14:14:29,595 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 14:14:29,596 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 14:14:29,597 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 14:14:29,598 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 14:14:29,598 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 14:14:29,599 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 14:14:29,601 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 14:14:29,601 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 14:14:29,602 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 14:14:29,603 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 14:14:29,604 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 14:14:29,605 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 14:14:29,606 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 14:14:29,606 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 14:14:29,607 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 14:14:29,608 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 14:14:29,609 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 14:14:29,610 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 14:14:29,610 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 14:14:29,610 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 14:14:29,610 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 14:14:29,611 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 14:14:29,611 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 14:14:29,612 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 14:14:29,612 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 14:14:29,613 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 14:14:29,613 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 14:14:29,613 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 14:14:29,614 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 14:14:29,614 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 14:14:29,614 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 14:14:29,615 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 14:14:29,619 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 14:14:29,621 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf [2022-01-10 14:14:29,648 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 14:14:29,648 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 14:14:29,648 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 14:14:29,648 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 14:14:29,649 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 14:14:29,649 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 14:14:29,649 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 14:14:29,649 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 14:14:29,650 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 14:14:29,650 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 14:14:29,650 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 14:14:29,650 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 14:14:29,650 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 14:14:29,650 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 14:14:29,651 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 14:14:29,651 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 14:14:29,651 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 14:14:29,651 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 14:14:29,651 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 14:14:29,651 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 14:14:29,651 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 14:14:29,651 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 14:14:29,651 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 14:14:29,651 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 14:14:29,651 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 14:14:29,651 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 14:14:29,652 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 14:14:29,652 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 14:14:29,652 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 14:14:29,652 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 14:14:29,652 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 14:14:29,652 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 14:14:29,653 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 14:14:29,653 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_BITWISE WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 14:14:29,821 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 14:14:29,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 14:14:29,840 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 14:14:29,840 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 14:14:29,841 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 14:14:29,841 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pc_sfifo_3.cil+token_ring.06.cil-1.c [2022-01-10 14:14:29,906 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b763ea59/21909adb152a47318871c4d93044e5ce/FLAGcc198fe2d [2022-01-10 14:14:30,281 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 14:14:30,282 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_3.cil+token_ring.06.cil-1.c [2022-01-10 14:14:30,290 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b763ea59/21909adb152a47318871c4d93044e5ce/FLAGcc198fe2d [2022-01-10 14:14:30,298 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b763ea59/21909adb152a47318871c4d93044e5ce [2022-01-10 14:14:30,317 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 14:14:30,318 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 14:14:30,319 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 14:14:30,319 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 14:14:30,321 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 14:14:30,322 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:14:30" (1/1) ... [2022-01-10 14:14:30,323 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60b0de5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:14:30, skipping insertion in model container [2022-01-10 14:14:30,323 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:14:30" (1/1) ... [2022-01-10 14:14:30,327 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 14:14:30,373 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 14:14:30,508 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_3.cil+token_ring.06.cil-1.c[911,924] [2022-01-10 14:14:30,545 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_3.cil+token_ring.06.cil-1.c[8416,8429] [2022-01-10 14:14:30,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 14:14:30,618 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 14:14:30,626 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_3.cil+token_ring.06.cil-1.c[911,924] [2022-01-10 14:14:30,640 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_3.cil+token_ring.06.cil-1.c[8416,8429] [2022-01-10 14:14:30,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 14:14:30,694 INFO L208 MainTranslator]: Completed translation [2022-01-10 14:14:30,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:14:30 WrapperNode [2022-01-10 14:14:30,694 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 14:14:30,695 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 14:14:30,695 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 14:14:30,695 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 14:14:30,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:14:30" (1/1) ... [2022-01-10 14:14:30,716 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:14:30" (1/1) ... [2022-01-10 14:14:30,767 INFO L137 Inliner]: procedures = 68, calls = 80, calls flagged for inlining = 75, calls inlined = 147, statements flattened = 2066 [2022-01-10 14:14:30,767 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 14:14:30,768 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 14:14:30,768 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 14:14:30,768 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 14:14:30,778 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:14:30" (1/1) ... [2022-01-10 14:14:30,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:14:30" (1/1) ... [2022-01-10 14:14:30,788 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:14:30" (1/1) ... [2022-01-10 14:14:30,788 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:14:30" (1/1) ... [2022-01-10 14:14:30,810 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:14:30" (1/1) ... [2022-01-10 14:14:30,853 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:14:30" (1/1) ... [2022-01-10 14:14:30,856 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:14:30" (1/1) ... [2022-01-10 14:14:30,862 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 14:14:30,863 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 14:14:30,863 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 14:14:30,863 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 14:14:30,871 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:14:30" (1/1) ... [2022-01-10 14:14:30,877 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 14:14:30,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 14:14:30,896 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 14:14:30,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 14:14:30,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 14:14:30,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 14:14:30,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 14:14:30,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 14:14:31,039 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 14:14:31,040 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 14:14:32,061 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##107: assume !(1bv32 == ~q_free~0); [2022-01-10 14:14:32,061 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##106: assume 1bv32 == ~q_free~0;~c_dr_st~0 := 2bv32;~c_dr_pc~0 := 2bv32;~a_t~0 := do_read_c_~a~0#1; [2022-01-10 14:14:32,061 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 14:14:32,075 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 14:14:32,075 INFO L299 CfgBuilder]: Removed 13 assume(true) statements. [2022-01-10 14:14:32,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:14:32 BoogieIcfgContainer [2022-01-10 14:14:32,077 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 14:14:32,078 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 14:14:32,078 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 14:14:32,079 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 14:14:32,081 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:14:32" (1/1) ... [2022-01-10 14:14:32,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 02:14:32 BasicIcfg [2022-01-10 14:14:32,308 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 14:14:32,309 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 14:14:32,310 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 14:14:32,311 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 14:14:32,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:14:30" (1/4) ... [2022-01-10 14:14:32,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63c41129 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:14:32, skipping insertion in model container [2022-01-10 14:14:32,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:14:30" (2/4) ... [2022-01-10 14:14:32,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63c41129 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:14:32, skipping insertion in model container [2022-01-10 14:14:32,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:14:32" (3/4) ... [2022-01-10 14:14:32,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63c41129 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 02:14:32, skipping insertion in model container [2022-01-10 14:14:32,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 02:14:32" (4/4) ... [2022-01-10 14:14:32,313 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.06.cil-1.cTransformedIcfg [2022-01-10 14:14:32,319 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 14:14:32,319 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-01-10 14:14:32,362 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 14:14:32,368 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 14:14:32,368 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-10 14:14:32,391 INFO L276 IsEmpty]: Start isEmpty. Operand has 838 states, 833 states have (on average 1.5378151260504203) internal successors, (1281), 837 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:14:32,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 14:14:32,398 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:14:32,398 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-10 14:14:32,398 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:14:32,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:14:32,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1688287340, now seen corresponding path program 1 times [2022-01-10 14:14:32,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:14:32,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288210186] [2022-01-10 14:14:32,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:14:32,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:14:32,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:14:32,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:14:32,658 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:14:32,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288210186] [2022-01-10 14:14:32,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288210186] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:14:32,658 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:14:32,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:14:32,660 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768907476] [2022-01-10 14:14:32,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:14:32,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:14:32,663 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:14:32,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:14:32,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:32,690 INFO L87 Difference]: Start difference. First operand has 838 states, 833 states have (on average 1.5378151260504203) internal successors, (1281), 837 states have internal predecessors, (1281), 0 states have call successors, (0), 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-10 14:14:32,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:14:32,775 INFO L93 Difference]: Finished difference Result 1575 states and 2399 transitions. [2022-01-10 14:14:32,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:14:32,785 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-10 14:14:32,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:14:32,797 INFO L225 Difference]: With dead ends: 1575 [2022-01-10 14:14:32,797 INFO L226 Difference]: Without dead ends: 827 [2022-01-10 14:14:32,822 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:32,824 INFO L933 BasicCegarLoop]: 1245 mSDtfsCounter, 205 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 2283 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:14:32,825 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 2283 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:14:32,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2022-01-10 14:14:32,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 827. [2022-01-10 14:14:32,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 823 states have (on average 1.5042527339003646) internal successors, (1238), 826 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:14:32,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1238 transitions. [2022-01-10 14:14:32,905 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1238 transitions. Word has length 44 [2022-01-10 14:14:32,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:14:32,906 INFO L470 AbstractCegarLoop]: Abstraction has 827 states and 1238 transitions. [2022-01-10 14:14:32,906 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-10 14:14:32,906 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1238 transitions. [2022-01-10 14:14:32,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 14:14:32,907 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:14:32,907 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-10 14:14:32,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 14:14:32,908 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:14:32,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:14:32,909 INFO L85 PathProgramCache]: Analyzing trace with hash 973875957, now seen corresponding path program 1 times [2022-01-10 14:14:32,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:14:32,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975300880] [2022-01-10 14:14:32,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:14:32,909 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:14:32,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:14:33,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:14:33,020 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:14:33,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975300880] [2022-01-10 14:14:33,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975300880] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:14:33,020 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:14:33,020 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:14:33,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116334006] [2022-01-10 14:14:33,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:14:33,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:14:33,022 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:14:33,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:14:33,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:33,022 INFO L87 Difference]: Start difference. First operand 827 states and 1238 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-10 14:14:33,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:14:33,114 INFO L93 Difference]: Finished difference Result 1085 states and 1623 transitions. [2022-01-10 14:14:33,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:14:33,115 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-10 14:14:33,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:14:33,119 INFO L225 Difference]: With dead ends: 1085 [2022-01-10 14:14:33,119 INFO L226 Difference]: Without dead ends: 960 [2022-01-10 14:14:33,121 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:33,122 INFO L933 BasicCegarLoop]: 1232 mSDtfsCounter, 179 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 2432 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:14:33,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 2432 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:14:33,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2022-01-10 14:14:33,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 956. [2022-01-10 14:14:33,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 952 states have (on average 1.4915966386554622) internal successors, (1420), 955 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:14:33,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1420 transitions. [2022-01-10 14:14:33,151 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1420 transitions. Word has length 44 [2022-01-10 14:14:33,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:14:33,152 INFO L470 AbstractCegarLoop]: Abstraction has 956 states and 1420 transitions. [2022-01-10 14:14:33,152 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-10 14:14:33,154 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1420 transitions. [2022-01-10 14:14:33,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 14:14:33,163 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:14:33,163 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-10 14:14:33,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 14:14:33,163 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:14:33,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:14:33,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1823414539, now seen corresponding path program 1 times [2022-01-10 14:14:33,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:14:33,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847049353] [2022-01-10 14:14:33,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:14:33,164 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:14:33,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:14:33,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:14:33,225 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:14:33,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847049353] [2022-01-10 14:14:33,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847049353] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:14:33,226 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:14:33,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:14:33,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906594035] [2022-01-10 14:14:33,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:14:33,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:14:33,226 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:14:33,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:14:33,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:33,227 INFO L87 Difference]: Start difference. First operand 956 states and 1420 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-10 14:14:33,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:14:33,278 INFO L93 Difference]: Finished difference Result 1374 states and 2025 transitions. [2022-01-10 14:14:33,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:14:33,279 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-10 14:14:33,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:14:33,282 INFO L225 Difference]: With dead ends: 1374 [2022-01-10 14:14:33,282 INFO L226 Difference]: Without dead ends: 1134 [2022-01-10 14:14:33,285 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:33,288 INFO L933 BasicCegarLoop]: 1225 mSDtfsCounter, 1199 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1199 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:14:33,288 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1199 Valid, 1360 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:14:33,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2022-01-10 14:14:33,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 1126. [2022-01-10 14:14:33,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 1122 states have (on average 1.4750445632798574) internal successors, (1655), 1125 states have internal predecessors, (1655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:14:33,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1655 transitions. [2022-01-10 14:14:33,313 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1655 transitions. Word has length 44 [2022-01-10 14:14:33,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:14:33,313 INFO L470 AbstractCegarLoop]: Abstraction has 1126 states and 1655 transitions. [2022-01-10 14:14:33,313 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-10 14:14:33,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1655 transitions. [2022-01-10 14:14:33,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-10 14:14:33,314 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:14:33,315 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-10 14:14:33,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 14:14:33,315 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:14:33,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:14:33,315 INFO L85 PathProgramCache]: Analyzing trace with hash -391221704, now seen corresponding path program 1 times [2022-01-10 14:14:33,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:14:33,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904452897] [2022-01-10 14:14:33,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:14:33,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:14:33,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:14:33,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:14:33,364 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:14:33,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904452897] [2022-01-10 14:14:33,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904452897] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:14:33,364 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:14:33,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:14:33,365 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025208693] [2022-01-10 14:14:33,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:14:33,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:14:33,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:14:33,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:14:33,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:33,366 INFO L87 Difference]: Start difference. First operand 1126 states and 1655 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-10 14:14:33,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:14:33,419 INFO L93 Difference]: Finished difference Result 1848 states and 2689 transitions. [2022-01-10 14:14:33,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:14:33,419 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-10 14:14:33,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:14:33,423 INFO L225 Difference]: With dead ends: 1848 [2022-01-10 14:14:33,423 INFO L226 Difference]: Without dead ends: 1452 [2022-01-10 14:14:33,426 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:33,430 INFO L933 BasicCegarLoop]: 1219 mSDtfsCounter, 1183 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1183 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:14:33,431 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1183 Valid, 1357 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:14:33,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2022-01-10 14:14:33,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 1444. [2022-01-10 14:14:33,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1444 states, 1440 states have (on average 1.45) internal successors, (2088), 1443 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:14:33,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 2088 transitions. [2022-01-10 14:14:33,491 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 2088 transitions. Word has length 45 [2022-01-10 14:14:33,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:14:33,491 INFO L470 AbstractCegarLoop]: Abstraction has 1444 states and 2088 transitions. [2022-01-10 14:14:33,491 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-10 14:14:33,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 2088 transitions. [2022-01-10 14:14:33,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-10 14:14:33,493 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:14:33,493 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:14:33,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 14:14:33,493 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:14:33,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:14:33,494 INFO L85 PathProgramCache]: Analyzing trace with hash 2035598721, now seen corresponding path program 1 times [2022-01-10 14:14:33,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:14:33,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530671534] [2022-01-10 14:14:33,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:14:33,494 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:14:33,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:14:33,545 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 14:14:33,545 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:14:33,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530671534] [2022-01-10 14:14:33,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530671534] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:14:33,545 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:14:33,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:14:33,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024898666] [2022-01-10 14:14:33,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:14:33,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:14:33,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:14:33,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:14:33,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:33,546 INFO L87 Difference]: Start difference. First operand 1444 states and 2088 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:14:33,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:14:33,617 INFO L93 Difference]: Finished difference Result 2452 states and 3502 transitions. [2022-01-10 14:14:33,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:14:33,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 59 [2022-01-10 14:14:33,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:14:33,624 INFO L225 Difference]: With dead ends: 2452 [2022-01-10 14:14:33,624 INFO L226 Difference]: Without dead ends: 1756 [2022-01-10 14:14:33,626 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:33,626 INFO L933 BasicCegarLoop]: 1222 mSDtfsCounter, 1179 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1179 SdHoareTripleChecker+Valid, 1359 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:14:33,626 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1179 Valid, 1359 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:14:33,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2022-01-10 14:14:33,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 1752. [2022-01-10 14:14:33,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1752 states, 1748 states have (on average 1.4221967963386728) internal successors, (2486), 1751 states have internal predecessors, (2486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:14:33,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 2486 transitions. [2022-01-10 14:14:33,679 INFO L78 Accepts]: Start accepts. Automaton has 1752 states and 2486 transitions. Word has length 59 [2022-01-10 14:14:33,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:14:33,680 INFO L470 AbstractCegarLoop]: Abstraction has 1752 states and 2486 transitions. [2022-01-10 14:14:33,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:14:33,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 2486 transitions. [2022-01-10 14:14:33,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-01-10 14:14:33,681 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:14:33,682 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, 1] [2022-01-10 14:14:33,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 14:14:33,682 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:14:33,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:14:33,682 INFO L85 PathProgramCache]: Analyzing trace with hash 422419805, now seen corresponding path program 1 times [2022-01-10 14:14:33,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:14:33,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795222962] [2022-01-10 14:14:33,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:14:33,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:14:33,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:14:33,748 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:14:33,748 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:14:33,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795222962] [2022-01-10 14:14:33,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795222962] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:14:33,748 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:14:33,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:14:33,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199484258] [2022-01-10 14:14:33,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:14:33,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:14:33,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:14:33,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:14:33,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:33,750 INFO L87 Difference]: Start difference. First operand 1752 states and 2486 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:14:33,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:14:33,866 INFO L93 Difference]: Finished difference Result 3726 states and 5186 transitions. [2022-01-10 14:14:33,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:14:33,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2022-01-10 14:14:33,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:14:33,874 INFO L225 Difference]: With dead ends: 3726 [2022-01-10 14:14:33,874 INFO L226 Difference]: Without dead ends: 2722 [2022-01-10 14:14:33,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:33,877 INFO L933 BasicCegarLoop]: 1373 mSDtfsCounter, 146 mSDsluCounter, 1209 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 2582 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:14:33,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 2582 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:14:33,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2722 states. [2022-01-10 14:14:33,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2722 to 2722. [2022-01-10 14:14:33,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2722 states, 2718 states have (on average 1.3914643119941132) internal successors, (3782), 2721 states have internal predecessors, (3782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:14:33,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2722 states to 2722 states and 3782 transitions. [2022-01-10 14:14:33,991 INFO L78 Accepts]: Start accepts. Automaton has 2722 states and 3782 transitions. Word has length 61 [2022-01-10 14:14:33,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:14:33,993 INFO L470 AbstractCegarLoop]: Abstraction has 2722 states and 3782 transitions. [2022-01-10 14:14:33,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:14:33,993 INFO L276 IsEmpty]: Start isEmpty. Operand 2722 states and 3782 transitions. [2022-01-10 14:14:34,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 14:14:34,013 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:14:34,013 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-10 14:14:34,013 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 14:14:34,013 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:14:34,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:14:34,014 INFO L85 PathProgramCache]: Analyzing trace with hash 542368070, now seen corresponding path program 1 times [2022-01-10 14:14:34,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:14:34,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982995035] [2022-01-10 14:14:34,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:14:34,014 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:14:34,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:14:34,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:14:34,065 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:14:34,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982995035] [2022-01-10 14:14:34,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982995035] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:14:34,066 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:14:34,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:14:34,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614184197] [2022-01-10 14:14:34,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:14:34,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:14:34,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:14:34,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:14:34,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:34,067 INFO L87 Difference]: Start difference. First operand 2722 states and 3782 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-10 14:14:34,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:14:34,159 INFO L93 Difference]: Finished difference Result 3947 states and 5607 transitions. [2022-01-10 14:14:34,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:14:34,159 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-10 14:14:34,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:14:34,168 INFO L225 Difference]: With dead ends: 3947 [2022-01-10 14:14:34,168 INFO L226 Difference]: Without dead ends: 3270 [2022-01-10 14:14:34,170 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:34,170 INFO L933 BasicCegarLoop]: 1220 mSDtfsCounter, 1135 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1135 SdHoareTripleChecker+Valid, 2099 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:14:34,171 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1135 Valid, 2099 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:14:34,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3270 states. [2022-01-10 14:14:34,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3270 to 3266. [2022-01-10 14:14:34,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3266 states, 3262 states have (on average 1.4068056407112202) internal successors, (4589), 3265 states have internal predecessors, (4589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:14:34,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3266 states to 3266 states and 4589 transitions. [2022-01-10 14:14:34,285 INFO L78 Accepts]: Start accepts. Automaton has 3266 states and 4589 transitions. Word has length 99 [2022-01-10 14:14:34,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:14:34,285 INFO L470 AbstractCegarLoop]: Abstraction has 3266 states and 4589 transitions. [2022-01-10 14:14:34,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-10 14:14:34,286 INFO L276 IsEmpty]: Start isEmpty. Operand 3266 states and 4589 transitions. [2022-01-10 14:14:34,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 14:14:34,288 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:14:34,289 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-10 14:14:34,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 14:14:34,289 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:14:34,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:14:34,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1891301274, now seen corresponding path program 1 times [2022-01-10 14:14:34,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:14:34,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41175093] [2022-01-10 14:14:34,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:14:34,290 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:14:34,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:14:34,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:14:34,314 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:14:34,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41175093] [2022-01-10 14:14:34,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41175093] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:14:34,314 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:14:34,314 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:14:34,314 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004914456] [2022-01-10 14:14:34,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:14:34,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:14:34,315 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:14:34,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:14:34,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:34,315 INFO L87 Difference]: Start difference. First operand 3266 states and 4589 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-10 14:14:34,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:14:34,393 INFO L93 Difference]: Finished difference Result 4486 states and 6407 transitions. [2022-01-10 14:14:34,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:14:34,393 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-10 14:14:34,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:14:34,401 INFO L225 Difference]: With dead ends: 4486 [2022-01-10 14:14:34,402 INFO L226 Difference]: Without dead ends: 3266 [2022-01-10 14:14:34,404 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:34,404 INFO L933 BasicCegarLoop]: 1214 mSDtfsCounter, 1205 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1205 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:14:34,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1205 Valid, 1214 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:14:34,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3266 states. [2022-01-10 14:14:34,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3266 to 3266. [2022-01-10 14:14:34,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3266 states, 3262 states have (on average 1.4043531575720416) internal successors, (4581), 3265 states have internal predecessors, (4581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:14:34,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3266 states to 3266 states and 4581 transitions. [2022-01-10 14:14:34,490 INFO L78 Accepts]: Start accepts. Automaton has 3266 states and 4581 transitions. Word has length 99 [2022-01-10 14:14:34,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:14:34,490 INFO L470 AbstractCegarLoop]: Abstraction has 3266 states and 4581 transitions. [2022-01-10 14:14:34,491 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-10 14:14:34,491 INFO L276 IsEmpty]: Start isEmpty. Operand 3266 states and 4581 transitions. [2022-01-10 14:14:34,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 14:14:34,494 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:14:34,494 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-10 14:14:34,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 14:14:34,494 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:14:34,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:14:34,494 INFO L85 PathProgramCache]: Analyzing trace with hash 939687238, now seen corresponding path program 1 times [2022-01-10 14:14:34,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:14:34,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707150062] [2022-01-10 14:14:34,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:14:34,495 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:14:34,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:14:34,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:14:34,522 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:14:34,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707150062] [2022-01-10 14:14:34,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707150062] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:14:34,522 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:14:34,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:14:34,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145408111] [2022-01-10 14:14:34,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:14:34,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:14:34,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:14:34,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:14:34,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:34,523 INFO L87 Difference]: Start difference. First operand 3266 states and 4581 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-10 14:14:34,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:14:34,622 INFO L93 Difference]: Finished difference Result 4485 states and 6390 transitions. [2022-01-10 14:14:34,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:14:34,622 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-10 14:14:34,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:14:34,630 INFO L225 Difference]: With dead ends: 4485 [2022-01-10 14:14:34,630 INFO L226 Difference]: Without dead ends: 3266 [2022-01-10 14:14:34,632 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:34,632 INFO L933 BasicCegarLoop]: 1209 mSDtfsCounter, 1199 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1199 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:14:34,633 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1199 Valid, 1209 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:14:34,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3266 states. [2022-01-10 14:14:34,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3266 to 3266. [2022-01-10 14:14:34,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3266 states, 3262 states have (on average 1.4019006744328633) internal successors, (4573), 3265 states have internal predecessors, (4573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:14:34,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3266 states to 3266 states and 4573 transitions. [2022-01-10 14:14:34,721 INFO L78 Accepts]: Start accepts. Automaton has 3266 states and 4573 transitions. Word has length 99 [2022-01-10 14:14:34,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:14:34,721 INFO L470 AbstractCegarLoop]: Abstraction has 3266 states and 4573 transitions. [2022-01-10 14:14:34,721 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-10 14:14:34,722 INFO L276 IsEmpty]: Start isEmpty. Operand 3266 states and 4573 transitions. [2022-01-10 14:14:34,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 14:14:34,724 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:14:34,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-10 14:14:34,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 14:14:34,725 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:14:34,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:14:34,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1185747866, now seen corresponding path program 1 times [2022-01-10 14:14:34,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:14:34,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178465274] [2022-01-10 14:14:34,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:14:34,725 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:14:34,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:14:34,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:14:34,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:14:34,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178465274] [2022-01-10 14:14:34,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178465274] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:14:34,750 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:14:34,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:14:34,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13902061] [2022-01-10 14:14:34,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:14:34,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:14:34,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:14:34,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:14:34,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:34,751 INFO L87 Difference]: Start difference. First operand 3266 states and 4573 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-10 14:14:34,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:14:34,848 INFO L93 Difference]: Finished difference Result 4484 states and 6373 transitions. [2022-01-10 14:14:34,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:14:34,849 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-10 14:14:34,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:14:34,857 INFO L225 Difference]: With dead ends: 4484 [2022-01-10 14:14:34,857 INFO L226 Difference]: Without dead ends: 3266 [2022-01-10 14:14:34,860 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:34,860 INFO L933 BasicCegarLoop]: 1204 mSDtfsCounter, 1193 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1193 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:14:34,860 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1193 Valid, 1204 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:14:34,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3266 states. [2022-01-10 14:14:34,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3266 to 3266. [2022-01-10 14:14:34,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3266 states, 3262 states have (on average 1.399448191293685) internal successors, (4565), 3265 states have internal predecessors, (4565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:14:34,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3266 states to 3266 states and 4565 transitions. [2022-01-10 14:14:34,959 INFO L78 Accepts]: Start accepts. Automaton has 3266 states and 4565 transitions. Word has length 99 [2022-01-10 14:14:34,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:14:34,959 INFO L470 AbstractCegarLoop]: Abstraction has 3266 states and 4565 transitions. [2022-01-10 14:14:34,959 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-10 14:14:34,959 INFO L276 IsEmpty]: Start isEmpty. Operand 3266 states and 4565 transitions. [2022-01-10 14:14:34,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 14:14:34,962 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:14:34,962 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-10 14:14:34,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 14:14:34,963 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:14:34,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:14:34,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1655183686, now seen corresponding path program 1 times [2022-01-10 14:14:34,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:14:34,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717383040] [2022-01-10 14:14:34,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:14:34,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:14:34,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:14:34,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:14:34,998 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:14:34,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717383040] [2022-01-10 14:14:34,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717383040] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:14:34,999 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:14:34,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:14:34,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173551984] [2022-01-10 14:14:34,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:14:34,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:14:34,999 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:14:35,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:14:35,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:35,000 INFO L87 Difference]: Start difference. First operand 3266 states and 4565 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-10 14:14:35,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:14:35,108 INFO L93 Difference]: Finished difference Result 4483 states and 6356 transitions. [2022-01-10 14:14:35,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:14:35,109 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-10 14:14:35,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:14:35,131 INFO L225 Difference]: With dead ends: 4483 [2022-01-10 14:14:35,131 INFO L226 Difference]: Without dead ends: 3266 [2022-01-10 14:14:35,134 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:35,134 INFO L933 BasicCegarLoop]: 1199 mSDtfsCounter, 1187 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1187 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:14:35,134 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1187 Valid, 1199 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:14:35,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3266 states. [2022-01-10 14:14:35,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3266 to 3266. [2022-01-10 14:14:35,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3266 states, 3262 states have (on average 1.3969957081545064) internal successors, (4557), 3265 states have internal predecessors, (4557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:14:35,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3266 states to 3266 states and 4557 transitions. [2022-01-10 14:14:35,263 INFO L78 Accepts]: Start accepts. Automaton has 3266 states and 4557 transitions. Word has length 99 [2022-01-10 14:14:35,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:14:35,263 INFO L470 AbstractCegarLoop]: Abstraction has 3266 states and 4557 transitions. [2022-01-10 14:14:35,264 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-10 14:14:35,264 INFO L276 IsEmpty]: Start isEmpty. Operand 3266 states and 4557 transitions. [2022-01-10 14:14:35,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 14:14:35,270 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:14:35,270 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-10 14:14:35,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 14:14:35,270 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:14:35,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:14:35,271 INFO L85 PathProgramCache]: Analyzing trace with hash 361353318, now seen corresponding path program 1 times [2022-01-10 14:14:35,271 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:14:35,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930137570] [2022-01-10 14:14:35,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:14:35,271 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:14:35,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:14:35,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:14:35,295 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:14:35,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930137570] [2022-01-10 14:14:35,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930137570] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:14:35,295 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:14:35,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:14:35,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418718173] [2022-01-10 14:14:35,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:14:35,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:14:35,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:14:35,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:14:35,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:35,296 INFO L87 Difference]: Start difference. First operand 3266 states and 4557 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-10 14:14:35,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:14:35,383 INFO L93 Difference]: Finished difference Result 4482 states and 6339 transitions. [2022-01-10 14:14:35,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:14:35,383 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-10 14:14:35,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:14:35,388 INFO L225 Difference]: With dead ends: 4482 [2022-01-10 14:14:35,388 INFO L226 Difference]: Without dead ends: 3266 [2022-01-10 14:14:35,390 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:35,391 INFO L933 BasicCegarLoop]: 1194 mSDtfsCounter, 1181 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1181 SdHoareTripleChecker+Valid, 1194 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:14:35,391 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1181 Valid, 1194 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:14:35,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3266 states. [2022-01-10 14:14:35,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3266 to 3266. [2022-01-10 14:14:35,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3266 states, 3262 states have (on average 1.394543225015328) internal successors, (4549), 3265 states have internal predecessors, (4549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:14:35,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3266 states to 3266 states and 4549 transitions. [2022-01-10 14:14:35,509 INFO L78 Accepts]: Start accepts. Automaton has 3266 states and 4549 transitions. Word has length 99 [2022-01-10 14:14:35,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:14:35,510 INFO L470 AbstractCegarLoop]: Abstraction has 3266 states and 4549 transitions. [2022-01-10 14:14:35,510 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-10 14:14:35,510 INFO L276 IsEmpty]: Start isEmpty. Operand 3266 states and 4549 transitions. [2022-01-10 14:14:35,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 14:14:35,513 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:14:35,513 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:14:35,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 14:14:35,513 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:14:35,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:14:35,515 INFO L85 PathProgramCache]: Analyzing trace with hash -234572474, now seen corresponding path program 1 times [2022-01-10 14:14:35,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:14:35,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835785041] [2022-01-10 14:14:35,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:14:35,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:14:35,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:14:35,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:14:35,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:14:35,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835785041] [2022-01-10 14:14:35,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835785041] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:14:35,542 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:14:35,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:14:35,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009211422] [2022-01-10 14:14:35,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:14:35,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:14:35,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:14:35,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:14:35,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:35,543 INFO L87 Difference]: Start difference. First operand 3266 states and 4549 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-10 14:14:35,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:14:35,630 INFO L93 Difference]: Finished difference Result 4481 states and 6322 transitions. [2022-01-10 14:14:35,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:14:35,630 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-10 14:14:35,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:14:35,636 INFO L225 Difference]: With dead ends: 4481 [2022-01-10 14:14:35,636 INFO L226 Difference]: Without dead ends: 3266 [2022-01-10 14:14:35,637 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:35,638 INFO L933 BasicCegarLoop]: 1189 mSDtfsCounter, 1175 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1175 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:14:35,638 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1175 Valid, 1189 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:14:35,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3266 states. [2022-01-10 14:14:35,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3266 to 3266. [2022-01-10 14:14:35,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3266 states, 3262 states have (on average 1.3920907418761497) internal successors, (4541), 3265 states have internal predecessors, (4541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:14:35,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3266 states to 3266 states and 4541 transitions. [2022-01-10 14:14:35,752 INFO L78 Accepts]: Start accepts. Automaton has 3266 states and 4541 transitions. Word has length 99 [2022-01-10 14:14:35,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:14:35,753 INFO L470 AbstractCegarLoop]: Abstraction has 3266 states and 4541 transitions. [2022-01-10 14:14:35,753 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-10 14:14:35,753 INFO L276 IsEmpty]: Start isEmpty. Operand 3266 states and 4541 transitions. [2022-01-10 14:14:35,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 14:14:35,756 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:14:35,756 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-10 14:14:35,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 14:14:35,756 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:14:35,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:14:35,757 INFO L85 PathProgramCache]: Analyzing trace with hash 438940774, now seen corresponding path program 1 times [2022-01-10 14:14:35,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:14:35,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388092905] [2022-01-10 14:14:35,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:14:35,757 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:14:35,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:14:35,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:14:35,786 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:14:35,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388092905] [2022-01-10 14:14:35,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388092905] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:14:35,786 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:14:35,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:14:35,787 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963288670] [2022-01-10 14:14:35,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:14:35,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:14:35,787 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:14:35,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:14:35,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:35,787 INFO L87 Difference]: Start difference. First operand 3266 states and 4541 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-10 14:14:35,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:14:35,905 INFO L93 Difference]: Finished difference Result 4480 states and 6305 transitions. [2022-01-10 14:14:35,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:14:35,906 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-10 14:14:35,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:14:35,911 INFO L225 Difference]: With dead ends: 4480 [2022-01-10 14:14:35,911 INFO L226 Difference]: Without dead ends: 3266 [2022-01-10 14:14:35,913 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:35,914 INFO L933 BasicCegarLoop]: 1166 mSDtfsCounter, 1088 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1088 SdHoareTripleChecker+Valid, 1234 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-10 14:14:35,914 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1088 Valid, 1234 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:14:35,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3266 states. [2022-01-10 14:14:36,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3266 to 3266. [2022-01-10 14:14:36,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3266 states, 3262 states have (on average 1.3847332924586144) internal successors, (4517), 3265 states have internal predecessors, (4517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:14:36,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3266 states to 3266 states and 4517 transitions. [2022-01-10 14:14:36,052 INFO L78 Accepts]: Start accepts. Automaton has 3266 states and 4517 transitions. Word has length 99 [2022-01-10 14:14:36,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:14:36,052 INFO L470 AbstractCegarLoop]: Abstraction has 3266 states and 4517 transitions. [2022-01-10 14:14:36,052 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-10 14:14:36,052 INFO L276 IsEmpty]: Start isEmpty. Operand 3266 states and 4517 transitions. [2022-01-10 14:14:36,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 14:14:36,055 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:14:36,055 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-10 14:14:36,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 14:14:36,055 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:14:36,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:14:36,056 INFO L85 PathProgramCache]: Analyzing trace with hash -54213179, now seen corresponding path program 1 times [2022-01-10 14:14:36,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:14:36,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787332847] [2022-01-10 14:14:36,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:14:36,056 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:14:36,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:14:36,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:14:36,087 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:14:36,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787332847] [2022-01-10 14:14:36,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787332847] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:14:36,088 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:14:36,088 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:14:36,088 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105599442] [2022-01-10 14:14:36,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:14:36,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:14:36,088 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:14:36,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:14:36,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:36,089 INFO L87 Difference]: Start difference. First operand 3266 states and 4517 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-10 14:14:36,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:14:36,198 INFO L93 Difference]: Finished difference Result 4479 states and 6256 transitions. [2022-01-10 14:14:36,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:14:36,199 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-10 14:14:36,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:14:36,203 INFO L225 Difference]: With dead ends: 4479 [2022-01-10 14:14:36,203 INFO L226 Difference]: Without dead ends: 3266 [2022-01-10 14:14:36,206 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:36,207 INFO L933 BasicCegarLoop]: 1152 mSDtfsCounter, 1074 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1074 SdHoareTripleChecker+Valid, 1219 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-10 14:14:36,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1074 Valid, 1219 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:14:36,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3266 states. [2022-01-10 14:14:36,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3266 to 3266. [2022-01-10 14:14:36,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3266 states, 3262 states have (on average 1.3773758430410792) internal successors, (4493), 3265 states have internal predecessors, (4493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:14:36,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3266 states to 3266 states and 4493 transitions. [2022-01-10 14:14:36,362 INFO L78 Accepts]: Start accepts. Automaton has 3266 states and 4493 transitions. Word has length 99 [2022-01-10 14:14:36,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:14:36,363 INFO L470 AbstractCegarLoop]: Abstraction has 3266 states and 4493 transitions. [2022-01-10 14:14:36,363 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-10 14:14:36,363 INFO L276 IsEmpty]: Start isEmpty. Operand 3266 states and 4493 transitions. [2022-01-10 14:14:36,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 14:14:36,366 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:14:36,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:14:36,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 14:14:36,366 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:14:36,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:14:36,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1826655396, now seen corresponding path program 1 times [2022-01-10 14:14:36,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:14:36,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198900205] [2022-01-10 14:14:36,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:14:36,367 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:14:36,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:14:36,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:14:36,392 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:14:36,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198900205] [2022-01-10 14:14:36,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198900205] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:14:36,392 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:14:36,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:14:36,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849010155] [2022-01-10 14:14:36,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:14:36,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:14:36,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:14:36,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:14:36,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:36,394 INFO L87 Difference]: Start difference. First operand 3266 states and 4493 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-10 14:14:36,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:14:36,545 INFO L93 Difference]: Finished difference Result 4478 states and 6207 transitions. [2022-01-10 14:14:36,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:14:36,546 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-10 14:14:36,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:14:36,552 INFO L225 Difference]: With dead ends: 4478 [2022-01-10 14:14:36,552 INFO L226 Difference]: Without dead ends: 3266 [2022-01-10 14:14:36,554 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:36,554 INFO L933 BasicCegarLoop]: 1138 mSDtfsCounter, 1060 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1060 SdHoareTripleChecker+Valid, 1204 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-10 14:14:36,555 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1060 Valid, 1204 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:14:36,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3266 states. [2022-01-10 14:14:36,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3266 to 3266. [2022-01-10 14:14:36,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3266 states, 3262 states have (on average 1.370018393623544) internal successors, (4469), 3265 states have internal predecessors, (4469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:14:36,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3266 states to 3266 states and 4469 transitions. [2022-01-10 14:14:36,700 INFO L78 Accepts]: Start accepts. Automaton has 3266 states and 4469 transitions. Word has length 99 [2022-01-10 14:14:36,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:14:36,701 INFO L470 AbstractCegarLoop]: Abstraction has 3266 states and 4469 transitions. [2022-01-10 14:14:36,701 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-10 14:14:36,701 INFO L276 IsEmpty]: Start isEmpty. Operand 3266 states and 4469 transitions. [2022-01-10 14:14:36,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 14:14:36,704 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:14:36,704 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-10 14:14:36,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 14:14:36,704 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:14:36,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:14:36,704 INFO L85 PathProgramCache]: Analyzing trace with hash 2145442947, now seen corresponding path program 1 times [2022-01-10 14:14:36,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:14:36,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395393507] [2022-01-10 14:14:36,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:14:36,705 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:14:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:14:36,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:14:36,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:14:36,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395393507] [2022-01-10 14:14:36,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395393507] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:14:36,729 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:14:36,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:14:36,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484411309] [2022-01-10 14:14:36,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:14:36,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:14:36,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:14:36,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:14:36,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:36,730 INFO L87 Difference]: Start difference. First operand 3266 states and 4469 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-10 14:14:36,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:14:36,855 INFO L93 Difference]: Finished difference Result 4477 states and 6158 transitions. [2022-01-10 14:14:36,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:14:36,856 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-10 14:14:36,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:14:36,860 INFO L225 Difference]: With dead ends: 4477 [2022-01-10 14:14:36,861 INFO L226 Difference]: Without dead ends: 3266 [2022-01-10 14:14:36,862 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:36,863 INFO L933 BasicCegarLoop]: 1124 mSDtfsCounter, 1046 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1046 SdHoareTripleChecker+Valid, 1189 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-10 14:14:36,863 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1046 Valid, 1189 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:14:36,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3266 states. [2022-01-10 14:14:36,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3266 to 3266. [2022-01-10 14:14:36,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3266 states, 3262 states have (on average 1.3626609442060085) internal successors, (4445), 3265 states have internal predecessors, (4445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:14:36,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3266 states to 3266 states and 4445 transitions. [2022-01-10 14:14:36,971 INFO L78 Accepts]: Start accepts. Automaton has 3266 states and 4445 transitions. Word has length 99 [2022-01-10 14:14:36,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:14:36,972 INFO L470 AbstractCegarLoop]: Abstraction has 3266 states and 4445 transitions. [2022-01-10 14:14:36,972 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-10 14:14:36,972 INFO L276 IsEmpty]: Start isEmpty. Operand 3266 states and 4445 transitions. [2022-01-10 14:14:36,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 14:14:36,974 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:14:36,975 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-10 14:14:36,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 14:14:36,975 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:14:36,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:14:36,975 INFO L85 PathProgramCache]: Analyzing trace with hash 2022592994, now seen corresponding path program 1 times [2022-01-10 14:14:36,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:14:36,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074906035] [2022-01-10 14:14:36,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:14:36,976 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:14:36,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:14:36,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:14:36,998 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:14:36,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074906035] [2022-01-10 14:14:36,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074906035] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:14:36,998 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:14:36,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:14:36,998 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563893193] [2022-01-10 14:14:36,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:14:36,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:14:36,999 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:14:36,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:14:36,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:36,999 INFO L87 Difference]: Start difference. First operand 3266 states and 4445 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-10 14:14:37,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:14:37,124 INFO L93 Difference]: Finished difference Result 4476 states and 6109 transitions. [2022-01-10 14:14:37,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:14:37,125 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-10 14:14:37,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:14:37,129 INFO L225 Difference]: With dead ends: 4476 [2022-01-10 14:14:37,129 INFO L226 Difference]: Without dead ends: 3266 [2022-01-10 14:14:37,131 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:37,131 INFO L933 BasicCegarLoop]: 1110 mSDtfsCounter, 1032 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1032 SdHoareTripleChecker+Valid, 1174 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-10 14:14:37,131 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1032 Valid, 1174 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:14:37,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3266 states. [2022-01-10 14:14:37,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3266 to 3266. [2022-01-10 14:14:37,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3266 states, 3262 states have (on average 1.3553034947884732) internal successors, (4421), 3265 states have internal predecessors, (4421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:14:37,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3266 states to 3266 states and 4421 transitions. [2022-01-10 14:14:37,241 INFO L78 Accepts]: Start accepts. Automaton has 3266 states and 4421 transitions. Word has length 99 [2022-01-10 14:14:37,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:14:37,241 INFO L470 AbstractCegarLoop]: Abstraction has 3266 states and 4421 transitions. [2022-01-10 14:14:37,241 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-10 14:14:37,241 INFO L276 IsEmpty]: Start isEmpty. Operand 3266 states and 4421 transitions. [2022-01-10 14:14:37,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 14:14:37,244 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:14:37,244 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:14:37,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 14:14:37,245 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:14:37,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:14:37,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1496817729, now seen corresponding path program 1 times [2022-01-10 14:14:37,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:14:37,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838619078] [2022-01-10 14:14:37,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:14:37,245 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:14:37,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:14:37,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:14:37,269 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:14:37,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838619078] [2022-01-10 14:14:37,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838619078] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:14:37,269 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:14:37,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:14:37,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153328095] [2022-01-10 14:14:37,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:14:37,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:14:37,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:14:37,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:14:37,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:37,270 INFO L87 Difference]: Start difference. First operand 3266 states and 4421 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-10 14:14:37,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:14:37,404 INFO L93 Difference]: Finished difference Result 4475 states and 6060 transitions. [2022-01-10 14:14:37,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:14:37,405 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-10 14:14:37,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:14:37,410 INFO L225 Difference]: With dead ends: 4475 [2022-01-10 14:14:37,410 INFO L226 Difference]: Without dead ends: 3266 [2022-01-10 14:14:37,412 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:37,412 INFO L933 BasicCegarLoop]: 1096 mSDtfsCounter, 1018 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1018 SdHoareTripleChecker+Valid, 1159 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-10 14:14:37,413 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1018 Valid, 1159 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:14:37,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3266 states. [2022-01-10 14:14:37,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3266 to 3266. [2022-01-10 14:14:37,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3266 states, 3262 states have (on average 1.347946045370938) internal successors, (4397), 3265 states have internal predecessors, (4397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:14:37,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3266 states to 3266 states and 4397 transitions. [2022-01-10 14:14:37,527 INFO L78 Accepts]: Start accepts. Automaton has 3266 states and 4397 transitions. Word has length 99 [2022-01-10 14:14:37,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:14:37,527 INFO L470 AbstractCegarLoop]: Abstraction has 3266 states and 4397 transitions. [2022-01-10 14:14:37,527 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-10 14:14:37,527 INFO L276 IsEmpty]: Start isEmpty. Operand 3266 states and 4397 transitions. [2022-01-10 14:14:37,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 14:14:37,534 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:14:37,534 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-10 14:14:37,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 14:14:37,534 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:14:37,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:14:37,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1001228447, now seen corresponding path program 1 times [2022-01-10 14:14:37,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:14:37,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108473135] [2022-01-10 14:14:37,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:14:37,535 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:14:37,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:14:37,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:14:37,563 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:14:37,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108473135] [2022-01-10 14:14:37,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108473135] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:14:37,563 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:14:37,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:14:37,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451255913] [2022-01-10 14:14:37,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:14:37,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:14:37,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:14:37,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:14:37,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:37,564 INFO L87 Difference]: Start difference. First operand 3266 states and 4397 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-10 14:14:37,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:14:37,714 INFO L93 Difference]: Finished difference Result 4474 states and 6011 transitions. [2022-01-10 14:14:37,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:14:37,714 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-10 14:14:37,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:14:37,718 INFO L225 Difference]: With dead ends: 4474 [2022-01-10 14:14:37,718 INFO L226 Difference]: Without dead ends: 3266 [2022-01-10 14:14:37,720 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:37,721 INFO L933 BasicCegarLoop]: 1082 mSDtfsCounter, 1004 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1004 SdHoareTripleChecker+Valid, 1144 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-10 14:14:37,721 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1004 Valid, 1144 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:14:37,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3266 states. [2022-01-10 14:14:37,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3266 to 3266. [2022-01-10 14:14:37,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3266 states, 3262 states have (on average 1.3405885959534027) internal successors, (4373), 3265 states have internal predecessors, (4373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:14:37,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3266 states to 3266 states and 4373 transitions. [2022-01-10 14:14:37,903 INFO L78 Accepts]: Start accepts. Automaton has 3266 states and 4373 transitions. Word has length 99 [2022-01-10 14:14:37,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:14:37,903 INFO L470 AbstractCegarLoop]: Abstraction has 3266 states and 4373 transitions. [2022-01-10 14:14:37,903 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-10 14:14:37,903 INFO L276 IsEmpty]: Start isEmpty. Operand 3266 states and 4373 transitions. [2022-01-10 14:14:37,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 14:14:37,906 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:14:37,906 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:14:37,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 14:14:37,907 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:14:37,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:14:37,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1309180992, now seen corresponding path program 1 times [2022-01-10 14:14:37,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:14:37,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609924494] [2022-01-10 14:14:37,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:14:37,907 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:14:37,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:14:37,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:14:37,951 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:14:37,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609924494] [2022-01-10 14:14:37,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609924494] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:14:37,951 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:14:37,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 14:14:37,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348546660] [2022-01-10 14:14:37,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:14:37,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 14:14:37,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:14:37,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 14:14:37,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 14:14:37,952 INFO L87 Difference]: Start difference. First operand 3266 states and 4373 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-10 14:14:38,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:14:38,203 INFO L93 Difference]: Finished difference Result 5013 states and 6717 transitions. [2022-01-10 14:14:38,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 14:14:38,204 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-10 14:14:38,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:14:38,210 INFO L225 Difference]: With dead ends: 5013 [2022-01-10 14:14:38,210 INFO L226 Difference]: Without dead ends: 3812 [2022-01-10 14:14:38,212 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 14:14:38,212 INFO L933 BasicCegarLoop]: 1172 mSDtfsCounter, 2522 mSDsluCounter, 1706 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2522 SdHoareTripleChecker+Valid, 2878 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-10 14:14:38,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2522 Valid, 2878 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:14:38,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3812 states. [2022-01-10 14:14:38,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3812 to 3272. [2022-01-10 14:14:38,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3272 states, 3268 states have (on average 1.3350673194614444) internal successors, (4363), 3271 states have internal predecessors, (4363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:14:38,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3272 states to 3272 states and 4363 transitions. [2022-01-10 14:14:38,388 INFO L78 Accepts]: Start accepts. Automaton has 3272 states and 4363 transitions. Word has length 99 [2022-01-10 14:14:38,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:14:38,388 INFO L470 AbstractCegarLoop]: Abstraction has 3272 states and 4363 transitions. [2022-01-10 14:14:38,388 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-10 14:14:38,388 INFO L276 IsEmpty]: Start isEmpty. Operand 3272 states and 4363 transitions. [2022-01-10 14:14:38,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 14:14:38,391 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:14:38,391 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-10 14:14:38,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-10 14:14:38,391 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:14:38,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:14:38,392 INFO L85 PathProgramCache]: Analyzing trace with hash 701104129, now seen corresponding path program 1 times [2022-01-10 14:14:38,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:14:38,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290669847] [2022-01-10 14:14:38,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:14:38,392 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:14:38,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:14:38,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:14:38,425 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:14:38,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290669847] [2022-01-10 14:14:38,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290669847] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:14:38,425 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:14:38,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 14:14:38,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620996386] [2022-01-10 14:14:38,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:14:38,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 14:14:38,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:14:38,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 14:14:38,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 14:14:38,426 INFO L87 Difference]: Start difference. First operand 3272 states and 4363 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-10 14:14:38,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:14:38,646 INFO L93 Difference]: Finished difference Result 5185 states and 6892 transitions. [2022-01-10 14:14:38,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 14:14:38,648 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-10 14:14:38,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:14:38,654 INFO L225 Difference]: With dead ends: 5185 [2022-01-10 14:14:38,654 INFO L226 Difference]: Without dead ends: 3992 [2022-01-10 14:14:38,656 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 14:14:38,656 INFO L933 BasicCegarLoop]: 1127 mSDtfsCounter, 2288 mSDsluCounter, 2117 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2288 SdHoareTripleChecker+Valid, 3244 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-10 14:14:38,656 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2288 Valid, 3244 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:14:38,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3992 states. [2022-01-10 14:14:38,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3992 to 3278. [2022-01-10 14:14:38,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3278 states, 3274 states have (on average 1.3295662797800856) internal successors, (4353), 3277 states have internal predecessors, (4353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:14:38,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3278 states to 3278 states and 4353 transitions. [2022-01-10 14:14:38,805 INFO L78 Accepts]: Start accepts. Automaton has 3278 states and 4353 transitions. Word has length 99 [2022-01-10 14:14:38,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:14:38,805 INFO L470 AbstractCegarLoop]: Abstraction has 3278 states and 4353 transitions. [2022-01-10 14:14:38,805 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-10 14:14:38,806 INFO L276 IsEmpty]: Start isEmpty. Operand 3278 states and 4353 transitions. [2022-01-10 14:14:38,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 14:14:38,808 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:14:38,808 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-10 14:14:38,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-10 14:14:38,808 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:14:38,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:14:38,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1394496834, now seen corresponding path program 1 times [2022-01-10 14:14:38,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:14:38,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132469993] [2022-01-10 14:14:38,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:14:38,809 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:14:38,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:14:38,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:14:38,846 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:14:38,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132469993] [2022-01-10 14:14:38,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132469993] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:14:38,847 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:14:38,847 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 14:14:38,847 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210991970] [2022-01-10 14:14:38,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:14:38,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 14:14:38,847 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:14:38,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 14:14:38,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 14:14:38,848 INFO L87 Difference]: Start difference. First operand 3278 states and 4353 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-10 14:14:39,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:14:39,101 INFO L93 Difference]: Finished difference Result 5280 states and 6966 transitions. [2022-01-10 14:14:39,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 14:14:39,102 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-10 14:14:39,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:14:39,107 INFO L225 Difference]: With dead ends: 5280 [2022-01-10 14:14:39,108 INFO L226 Difference]: Without dead ends: 4088 [2022-01-10 14:14:39,110 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 14:14:39,110 INFO L933 BasicCegarLoop]: 1100 mSDtfsCounter, 2163 mSDsluCounter, 2302 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2163 SdHoareTripleChecker+Valid, 3402 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-10 14:14:39,110 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2163 Valid, 3402 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:14:39,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4088 states. [2022-01-10 14:14:39,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4088 to 3284. [2022-01-10 14:14:39,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3284 states, 3280 states have (on average 1.3240853658536584) internal successors, (4343), 3283 states have internal predecessors, (4343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:14:39,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3284 states to 3284 states and 4343 transitions. [2022-01-10 14:14:39,327 INFO L78 Accepts]: Start accepts. Automaton has 3284 states and 4343 transitions. Word has length 99 [2022-01-10 14:14:39,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:14:39,327 INFO L470 AbstractCegarLoop]: Abstraction has 3284 states and 4343 transitions. [2022-01-10 14:14:39,327 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-10 14:14:39,327 INFO L276 IsEmpty]: Start isEmpty. Operand 3284 states and 4343 transitions. [2022-01-10 14:14:39,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 14:14:39,330 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:14:39,330 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-10 14:14:39,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-10 14:14:39,330 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:14:39,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:14:39,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1386737475, now seen corresponding path program 1 times [2022-01-10 14:14:39,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:14:39,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264625419] [2022-01-10 14:14:39,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:14:39,331 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:14:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:14:39,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:14:39,365 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:14:39,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264625419] [2022-01-10 14:14:39,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264625419] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:14:39,365 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:14:39,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:14:39,365 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540704365] [2022-01-10 14:14:39,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:14:39,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:14:39,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:14:39,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:14:39,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:39,366 INFO L87 Difference]: Start difference. First operand 3284 states and 4343 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-10 14:14:39,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:14:39,606 INFO L93 Difference]: Finished difference Result 5625 states and 7326 transitions. [2022-01-10 14:14:39,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:14:39,607 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-10 14:14:39,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:14:39,615 INFO L225 Difference]: With dead ends: 5625 [2022-01-10 14:14:39,615 INFO L226 Difference]: Without dead ends: 4401 [2022-01-10 14:14:39,617 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:39,618 INFO L933 BasicCegarLoop]: 1056 mSDtfsCounter, 933 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 933 SdHoareTripleChecker+Valid, 1800 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-10 14:14:39,618 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [933 Valid, 1800 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:14:39,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4401 states. [2022-01-10 14:14:39,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4401 to 4305. [2022-01-10 14:14:39,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4305 states, 4301 states have (on average 1.3089979074633806) internal successors, (5630), 4304 states have internal predecessors, (5630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:14:39,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4305 states to 4305 states and 5630 transitions. [2022-01-10 14:14:39,820 INFO L78 Accepts]: Start accepts. Automaton has 4305 states and 5630 transitions. Word has length 99 [2022-01-10 14:14:39,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:14:39,820 INFO L470 AbstractCegarLoop]: Abstraction has 4305 states and 5630 transitions. [2022-01-10 14:14:39,820 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-10 14:14:39,820 INFO L276 IsEmpty]: Start isEmpty. Operand 4305 states and 5630 transitions. [2022-01-10 14:14:39,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-01-10 14:14:39,823 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:14:39,824 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, 1, 1, 1] [2022-01-10 14:14:39,824 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-10 14:14:39,824 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:14:39,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:14:39,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1503269970, now seen corresponding path program 1 times [2022-01-10 14:14:39,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:14:39,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79720890] [2022-01-10 14:14:39,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:14:39,825 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:14:39,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:14:39,855 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 14:14:39,855 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:14:39,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79720890] [2022-01-10 14:14:39,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79720890] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:14:39,855 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:14:39,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:14:39,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894886964] [2022-01-10 14:14:39,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:14:39,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:14:39,856 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:14:39,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:14:39,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:39,856 INFO L87 Difference]: Start difference. First operand 4305 states and 5630 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:14:40,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:14:40,201 INFO L93 Difference]: Finished difference Result 8169 states and 10882 transitions. [2022-01-10 14:14:40,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:14:40,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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 103 [2022-01-10 14:14:40,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:14:40,212 INFO L225 Difference]: With dead ends: 8169 [2022-01-10 14:14:40,212 INFO L226 Difference]: Without dead ends: 6237 [2022-01-10 14:14:40,216 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:40,216 INFO L933 BasicCegarLoop]: 1064 mSDtfsCounter, 130 mSDsluCounter, 1018 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 2082 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:14:40,216 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 2082 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:14:40,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6237 states. [2022-01-10 14:14:40,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6237 to 6233. [2022-01-10 14:14:40,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6233 states, 6229 states have (on average 1.3173864183657087) internal successors, (8206), 6232 states have internal predecessors, (8206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:14:40,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6233 states to 6233 states and 8206 transitions. [2022-01-10 14:14:40,519 INFO L78 Accepts]: Start accepts. Automaton has 6233 states and 8206 transitions. Word has length 103 [2022-01-10 14:14:40,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:14:40,519 INFO L470 AbstractCegarLoop]: Abstraction has 6233 states and 8206 transitions. [2022-01-10 14:14:40,520 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:14:40,520 INFO L276 IsEmpty]: Start isEmpty. Operand 6233 states and 8206 transitions. [2022-01-10 14:14:40,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-01-10 14:14:40,524 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:14:40,524 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, 1, 1, 1, 1] [2022-01-10 14:14:40,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-10 14:14:40,525 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:14:40,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:14:40,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1559782950, now seen corresponding path program 1 times [2022-01-10 14:14:40,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:14:40,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768747925] [2022-01-10 14:14:40,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:14:40,525 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:14:40,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:14:40,557 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:14:40,557 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:14:40,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768747925] [2022-01-10 14:14:40,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768747925] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:14:40,557 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:14:40,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:14:40,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124611379] [2022-01-10 14:14:40,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:14:40,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:14:40,558 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:14:40,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:14:40,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:40,559 INFO L87 Difference]: Start difference. First operand 6233 states and 8206 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:14:40,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:14:40,844 INFO L93 Difference]: Finished difference Result 8185 states and 10878 transitions. [2022-01-10 14:14:40,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:14:40,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2022-01-10 14:14:40,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:14:40,847 INFO L225 Difference]: With dead ends: 8185 [2022-01-10 14:14:40,848 INFO L226 Difference]: Without dead ends: 2274 [2022-01-10 14:14:40,852 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:40,853 INFO L933 BasicCegarLoop]: 1170 mSDtfsCounter, 112 mSDsluCounter, 1033 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 2203 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:14:40,853 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 2203 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:14:40,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2274 states. [2022-01-10 14:14:40,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2274 to 2274. [2022-01-10 14:14:40,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2274 states, 2272 states have (on average 1.2684859154929577) internal successors, (2882), 2273 states have internal predecessors, (2882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:14:40,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2274 states to 2274 states and 2882 transitions. [2022-01-10 14:14:40,967 INFO L78 Accepts]: Start accepts. Automaton has 2274 states and 2882 transitions. Word has length 104 [2022-01-10 14:14:40,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:14:40,967 INFO L470 AbstractCegarLoop]: Abstraction has 2274 states and 2882 transitions. [2022-01-10 14:14:40,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:14:40,967 INFO L276 IsEmpty]: Start isEmpty. Operand 2274 states and 2882 transitions. [2022-01-10 14:14:40,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-01-10 14:14:40,968 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:14:40,968 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-10 14:14:40,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-10 14:14:40,969 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:14:40,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:14:40,969 INFO L85 PathProgramCache]: Analyzing trace with hash 850624236, now seen corresponding path program 1 times [2022-01-10 14:14:40,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:14:40,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152209823] [2022-01-10 14:14:40,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:14:40,970 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:14:40,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:14:41,015 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:14:41,015 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:14:41,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152209823] [2022-01-10 14:14:41,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152209823] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:14:41,015 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:14:41,015 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:14:41,015 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775933525] [2022-01-10 14:14:41,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:14:41,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:14:41,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:14:41,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:14:41,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:41,016 INFO L87 Difference]: Start difference. First operand 2274 states and 2882 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-10 14:14:41,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:14:41,263 INFO L93 Difference]: Finished difference Result 6625 states and 8416 transitions. [2022-01-10 14:14:41,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:14:41,264 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-10 14:14:41,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:14:41,270 INFO L225 Difference]: With dead ends: 6625 [2022-01-10 14:14:41,270 INFO L226 Difference]: Without dead ends: 4386 [2022-01-10 14:14:41,272 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:41,273 INFO L933 BasicCegarLoop]: 861 mSDtfsCounter, 770 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 1605 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-10 14:14:41,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [770 Valid, 1605 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:14:41,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4386 states. [2022-01-10 14:14:41,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4386 to 4198. [2022-01-10 14:14:41,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4198 states, 4196 states have (on average 1.2664442326024785) internal successors, (5314), 4197 states have internal predecessors, (5314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:14:41,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4198 states to 4198 states and 5314 transitions. [2022-01-10 14:14:41,500 INFO L78 Accepts]: Start accepts. Automaton has 4198 states and 5314 transitions. Word has length 160 [2022-01-10 14:14:41,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:14:41,500 INFO L470 AbstractCegarLoop]: Abstraction has 4198 states and 5314 transitions. [2022-01-10 14:14:41,501 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-10 14:14:41,501 INFO L276 IsEmpty]: Start isEmpty. Operand 4198 states and 5314 transitions. [2022-01-10 14:14:41,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-01-10 14:14:41,502 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:14:41,502 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-10 14:14:41,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-10 14:14:41,503 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:14:41,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:14:41,503 INFO L85 PathProgramCache]: Analyzing trace with hash -2037220275, now seen corresponding path program 1 times [2022-01-10 14:14:41,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:14:41,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698974339] [2022-01-10 14:14:41,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:14:41,503 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:14:41,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:14:41,539 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:14:41,539 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:14:41,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698974339] [2022-01-10 14:14:41,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698974339] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:14:41,539 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:14:41,540 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:14:41,540 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583490698] [2022-01-10 14:14:41,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:14:41,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:14:41,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:14:41,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:14:41,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:41,540 INFO L87 Difference]: Start difference. First operand 4198 states and 5314 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-10 14:14:41,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:14:41,991 INFO L93 Difference]: Finished difference Result 12295 states and 15475 transitions. [2022-01-10 14:14:41,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:14:41,992 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-10 14:14:41,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:14:41,998 INFO L225 Difference]: With dead ends: 12295 [2022-01-10 14:14:41,998 INFO L226 Difference]: Without dead ends: 8187 [2022-01-10 14:14:42,001 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:42,001 INFO L933 BasicCegarLoop]: 1039 mSDtfsCounter, 770 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 1882 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-10 14:14:42,001 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [770 Valid, 1882 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:14:42,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8187 states. [2022-01-10 14:14:42,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8187 to 8015. [2022-01-10 14:14:42,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8015 states, 8013 states have (on average 1.2510919755397478) internal successors, (10025), 8014 states have internal predecessors, (10025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:14:42,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8015 states to 8015 states and 10025 transitions. [2022-01-10 14:14:42,411 INFO L78 Accepts]: Start accepts. Automaton has 8015 states and 10025 transitions. Word has length 160 [2022-01-10 14:14:42,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:14:42,412 INFO L470 AbstractCegarLoop]: Abstraction has 8015 states and 10025 transitions. [2022-01-10 14:14:42,412 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-10 14:14:42,412 INFO L276 IsEmpty]: Start isEmpty. Operand 8015 states and 10025 transitions. [2022-01-10 14:14:42,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-01-10 14:14:42,415 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:14:42,415 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-10 14:14:42,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-10 14:14:42,415 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:14:42,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:14:42,416 INFO L85 PathProgramCache]: Analyzing trace with hash -451405590, now seen corresponding path program 1 times [2022-01-10 14:14:42,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:14:42,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177073134] [2022-01-10 14:14:42,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:14:42,416 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:14:42,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:14:42,439 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 14:14:42,439 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:14:42,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177073134] [2022-01-10 14:14:42,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177073134] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:14:42,439 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:14:42,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:14:42,439 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340382590] [2022-01-10 14:14:42,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:14:42,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:14:42,440 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:14:42,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:14:42,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:42,440 INFO L87 Difference]: Start difference. First operand 8015 states and 10025 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-10 14:14:42,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:14:42,920 INFO L93 Difference]: Finished difference Result 15908 states and 19906 transitions. [2022-01-10 14:14:42,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:14:42,920 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-10 14:14:42,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:14:42,929 INFO L225 Difference]: With dead ends: 15908 [2022-01-10 14:14:42,929 INFO L226 Difference]: Without dead ends: 7932 [2022-01-10 14:14:42,939 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:42,939 INFO L933 BasicCegarLoop]: 871 mSDtfsCounter, 866 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:14:42,939 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [866 Valid, 872 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:14:42,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7932 states. [2022-01-10 14:14:43,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7932 to 7932. [2022-01-10 14:14:43,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7932 states, 7930 states have (on average 1.251828499369483) internal successors, (9927), 7931 states have internal predecessors, (9927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:14:43,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7932 states to 7932 states and 9927 transitions. [2022-01-10 14:14:43,408 INFO L78 Accepts]: Start accepts. Automaton has 7932 states and 9927 transitions. Word has length 160 [2022-01-10 14:14:43,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:14:43,409 INFO L470 AbstractCegarLoop]: Abstraction has 7932 states and 9927 transitions. [2022-01-10 14:14:43,409 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-10 14:14:43,409 INFO L276 IsEmpty]: Start isEmpty. Operand 7932 states and 9927 transitions. [2022-01-10 14:14:43,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-01-10 14:14:43,411 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:14:43,412 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-10 14:14:43,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-10 14:14:43,412 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:14:43,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:14:43,413 INFO L85 PathProgramCache]: Analyzing trace with hash -257405558, now seen corresponding path program 1 times [2022-01-10 14:14:43,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:14:43,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855323684] [2022-01-10 14:14:43,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:14:43,413 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:14:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:14:43,454 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:14:43,454 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:14:43,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855323684] [2022-01-10 14:14:43,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855323684] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:14:43,454 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:14:43,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:14:43,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631178766] [2022-01-10 14:14:43,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:14:43,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:14:43,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:14:43,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:14:43,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:43,455 INFO L87 Difference]: Start difference. First operand 7932 states and 9927 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-10 14:14:44,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:14:44,251 INFO L93 Difference]: Finished difference Result 22658 states and 28290 transitions. [2022-01-10 14:14:44,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:14:44,251 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-10 14:14:44,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:14:44,269 INFO L225 Difference]: With dead ends: 22658 [2022-01-10 14:14:44,270 INFO L226 Difference]: Without dead ends: 14816 [2022-01-10 14:14:44,278 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:44,278 INFO L933 BasicCegarLoop]: 1230 mSDtfsCounter, 629 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 2080 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:14:44,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [629 Valid, 2080 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:14:44,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14816 states. [2022-01-10 14:14:45,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14816 to 14812. [2022-01-10 14:14:45,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14812 states, 14810 states have (on average 1.2441593517893315) internal successors, (18426), 14811 states have internal predecessors, (18426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:14:45,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14812 states to 14812 states and 18426 transitions. [2022-01-10 14:14:45,086 INFO L78 Accepts]: Start accepts. Automaton has 14812 states and 18426 transitions. Word has length 161 [2022-01-10 14:14:45,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:14:45,087 INFO L470 AbstractCegarLoop]: Abstraction has 14812 states and 18426 transitions. [2022-01-10 14:14:45,087 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-10 14:14:45,087 INFO L276 IsEmpty]: Start isEmpty. Operand 14812 states and 18426 transitions. [2022-01-10 14:14:45,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-01-10 14:14:45,092 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:14:45,092 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-10 14:14:45,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-10 14:14:45,092 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:14:45,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:14:45,092 INFO L85 PathProgramCache]: Analyzing trace with hash -563040087, now seen corresponding path program 1 times [2022-01-10 14:14:45,093 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:14:45,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054291932] [2022-01-10 14:14:45,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:14:45,093 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:14:45,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:14:45,116 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 14:14:45,116 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:14:45,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054291932] [2022-01-10 14:14:45,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054291932] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:14:45,116 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:14:45,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:14:45,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956658787] [2022-01-10 14:14:45,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:14:45,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:14:45,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:14:45,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:14:45,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:45,117 INFO L87 Difference]: Start difference. First operand 14812 states and 18426 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-10 14:14:46,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:14:46,061 INFO L93 Difference]: Finished difference Result 29452 states and 36652 transitions. [2022-01-10 14:14:46,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:14:46,061 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-10 14:14:46,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:14:46,078 INFO L225 Difference]: With dead ends: 29452 [2022-01-10 14:14:46,078 INFO L226 Difference]: Without dead ends: 14730 [2022-01-10 14:14:46,094 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:46,094 INFO L933 BasicCegarLoop]: 870 mSDtfsCounter, 864 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:14:46,094 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [864 Valid, 871 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:14:46,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14730 states. [2022-01-10 14:14:46,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14730 to 14730. [2022-01-10 14:14:46,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14730 states, 14728 states have (on average 1.2445681694731123) internal successors, (18330), 14729 states have internal predecessors, (18330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:14:46,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14730 states to 14730 states and 18330 transitions. [2022-01-10 14:14:46,964 INFO L78 Accepts]: Start accepts. Automaton has 14730 states and 18330 transitions. Word has length 161 [2022-01-10 14:14:46,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:14:46,964 INFO L470 AbstractCegarLoop]: Abstraction has 14730 states and 18330 transitions. [2022-01-10 14:14:46,964 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-10 14:14:46,964 INFO L276 IsEmpty]: Start isEmpty. Operand 14730 states and 18330 transitions. [2022-01-10 14:14:46,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-01-10 14:14:46,970 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:14:46,971 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-10 14:14:46,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-10 14:14:46,971 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:14:46,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:14:46,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1948855770, now seen corresponding path program 1 times [2022-01-10 14:14:46,971 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:14:46,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305349158] [2022-01-10 14:14:46,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:14:46,971 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:14:46,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:14:47,029 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:14:47,029 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:14:47,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305349158] [2022-01-10 14:14:47,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305349158] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:14:47,030 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:14:47,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:14:47,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404044235] [2022-01-10 14:14:47,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:14:47,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:14:47,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:14:47,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:14:47,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:47,031 INFO L87 Difference]: Start difference. First operand 14730 states and 18330 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-10 14:14:48,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:14:48,511 INFO L93 Difference]: Finished difference Result 42227 states and 52491 transitions. [2022-01-10 14:14:48,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:14:48,512 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-10 14:14:48,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:14:48,549 INFO L225 Difference]: With dead ends: 42227 [2022-01-10 14:14:48,549 INFO L226 Difference]: Without dead ends: 27587 [2022-01-10 14:14:48,565 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:48,565 INFO L933 BasicCegarLoop]: 1199 mSDtfsCounter, 634 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 2047 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-10 14:14:48,566 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [634 Valid, 2047 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:14:48,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27587 states. [2022-01-10 14:14:50,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27587 to 27583. [2022-01-10 14:14:50,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27583 states, 27581 states have (on average 1.2402378448932236) internal successors, (34207), 27582 states have internal predecessors, (34207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:14:50,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27583 states to 27583 states and 34207 transitions. [2022-01-10 14:14:50,495 INFO L78 Accepts]: Start accepts. Automaton has 27583 states and 34207 transitions. Word has length 162 [2022-01-10 14:14:50,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:14:50,495 INFO L470 AbstractCegarLoop]: Abstraction has 27583 states and 34207 transitions. [2022-01-10 14:14:50,495 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-10 14:14:50,495 INFO L276 IsEmpty]: Start isEmpty. Operand 27583 states and 34207 transitions. [2022-01-10 14:14:50,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-01-10 14:14:50,506 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:14:50,507 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-10 14:14:50,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-10 14:14:50,507 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:14:50,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:14:50,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1643221241, now seen corresponding path program 1 times [2022-01-10 14:14:50,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:14:50,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081002164] [2022-01-10 14:14:50,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:14:50,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:14:50,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:14:50,533 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 14:14:50,534 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:14:50,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081002164] [2022-01-10 14:14:50,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081002164] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:14:50,534 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:14:50,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:14:50,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243811332] [2022-01-10 14:14:50,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:14:50,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:14:50,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:14:50,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:14:50,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:50,535 INFO L87 Difference]: Start difference. First operand 27583 states and 34207 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-10 14:14:52,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:14:52,223 INFO L93 Difference]: Finished difference Result 54995 states and 68217 transitions. [2022-01-10 14:14:52,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:14:52,223 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-10 14:14:52,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:14:52,257 INFO L225 Difference]: With dead ends: 54995 [2022-01-10 14:14:52,257 INFO L226 Difference]: Without dead ends: 27502 [2022-01-10 14:14:52,278 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:52,279 INFO L933 BasicCegarLoop]: 869 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, 870 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:14:52,279 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [862 Valid, 870 Invalid, 2 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:14:52,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27502 states. [2022-01-10 14:14:54,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27502 to 27502. [2022-01-10 14:14:54,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27502 states, 27500 states have (on average 1.2404727272727272) internal successors, (34113), 27501 states have internal predecessors, (34113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:14:54,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27502 states to 27502 states and 34113 transitions. [2022-01-10 14:14:54,159 INFO L78 Accepts]: Start accepts. Automaton has 27502 states and 34113 transitions. Word has length 162 [2022-01-10 14:14:54,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:14:54,160 INFO L470 AbstractCegarLoop]: Abstraction has 27502 states and 34113 transitions. [2022-01-10 14:14:54,160 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-10 14:14:54,160 INFO L276 IsEmpty]: Start isEmpty. Operand 27502 states and 34113 transitions. [2022-01-10 14:14:54,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-01-10 14:14:54,168 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:14:54,168 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-10 14:14:54,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-10 14:14:54,168 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:14:54,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:14:54,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1383327813, now seen corresponding path program 1 times [2022-01-10 14:14:54,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:14:54,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333609846] [2022-01-10 14:14:54,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:14:54,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:14:54,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:14:54,216 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:14:54,216 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:14:54,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333609846] [2022-01-10 14:14:54,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333609846] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:14:54,216 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:14:54,216 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:14:54,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700608303] [2022-01-10 14:14:54,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:14:54,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:14:54,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:14:54,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:14:54,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:54,217 INFO L87 Difference]: Start difference. First operand 27502 states and 34113 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-10 14:14:57,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:14:57,497 INFO L93 Difference]: Finished difference Result 79926 states and 99120 transitions. [2022-01-10 14:14:57,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:14:57,497 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-10 14:14:57,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:14:57,573 INFO L225 Difference]: With dead ends: 79926 [2022-01-10 14:14:57,573 INFO L226 Difference]: Without dead ends: 52514 [2022-01-10 14:14:57,599 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:14:57,600 INFO L933 BasicCegarLoop]: 1056 mSDtfsCounter, 771 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 1893 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.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:14:57,600 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [771 Valid, 1893 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:14:57,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52514 states. [2022-01-10 14:15:01,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52514 to 51358. [2022-01-10 14:15:01,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51358 states, 51356 states have (on average 1.2374016667964796) internal successors, (63548), 51357 states have internal predecessors, (63548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:15:01,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51358 states to 51358 states and 63548 transitions. [2022-01-10 14:15:01,252 INFO L78 Accepts]: Start accepts. Automaton has 51358 states and 63548 transitions. Word has length 163 [2022-01-10 14:15:01,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:15:01,252 INFO L470 AbstractCegarLoop]: Abstraction has 51358 states and 63548 transitions. [2022-01-10 14:15:01,252 INFO L471 AbstractCegarLoop]: INTERPOLANT 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) [2022-01-10 14:15:01,253 INFO L276 IsEmpty]: Start isEmpty. Operand 51358 states and 63548 transitions. [2022-01-10 14:15:01,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-01-10 14:15:01,266 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:15:01,266 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-10 14:15:01,266 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-10 14:15:01,266 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:15:01,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:15:01,267 INFO L85 PathProgramCache]: Analyzing trace with hash -282643172, now seen corresponding path program 1 times [2022-01-10 14:15:01,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:15:01,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955048378] [2022-01-10 14:15:01,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:15:01,267 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:15:01,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:15:01,303 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 14:15:01,303 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:15:01,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955048378] [2022-01-10 14:15:01,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955048378] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:15:01,303 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:15:01,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:15:01,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795683112] [2022-01-10 14:15:01,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:15:01,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:15:01,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:15:01,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:15:01,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:15:01,304 INFO L87 Difference]: Start difference. First operand 51358 states and 63548 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:15:04,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:15:04,797 INFO L93 Difference]: Finished difference Result 102576 states and 126936 transitions. [2022-01-10 14:15:04,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:15:04,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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-10 14:15:04,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:15:04,878 INFO L225 Difference]: With dead ends: 102576 [2022-01-10 14:15:04,879 INFO L226 Difference]: Without dead ends: 51278 [2022-01-10 14:15:04,915 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:15:04,915 INFO L933 BasicCegarLoop]: 868 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, 869 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:15:04,915 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [860 Valid, 869 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:15:04,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51278 states. [2022-01-10 14:15:08,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51278 to 51278. [2022-01-10 14:15:08,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51278 states, 51276 states have (on average 1.2375380294874796) internal successors, (63456), 51277 states have internal predecessors, (63456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:15:08,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51278 states to 51278 states and 63456 transitions. [2022-01-10 14:15:08,266 INFO L78 Accepts]: Start accepts. Automaton has 51278 states and 63456 transitions. Word has length 163 [2022-01-10 14:15:08,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:15:08,267 INFO L470 AbstractCegarLoop]: Abstraction has 51278 states and 63456 transitions. [2022-01-10 14:15:08,267 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:15:08,267 INFO L276 IsEmpty]: Start isEmpty. Operand 51278 states and 63456 transitions. [2022-01-10 14:15:08,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-01-10 14:15:08,280 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:15:08,280 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:15:08,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-10 14:15:08,280 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:15:08,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:15:08,281 INFO L85 PathProgramCache]: Analyzing trace with hash -672763154, now seen corresponding path program 1 times [2022-01-10 14:15:08,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:15:08,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488655406] [2022-01-10 14:15:08,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:15:08,281 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:15:08,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:15:08,332 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:15:08,332 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:15:08,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488655406] [2022-01-10 14:15:08,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488655406] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:15:08,332 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:15:08,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:15:08,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562004610] [2022-01-10 14:15:08,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:15:08,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:15:08,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:15:08,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:15:08,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:15:08,334 INFO L87 Difference]: Start difference. First operand 51278 states and 63456 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:15:14,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:15:14,419 INFO L93 Difference]: Finished difference Result 147949 states and 183037 transitions. [2022-01-10 14:15:14,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:15:14,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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 164 [2022-01-10 14:15:14,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:15:14,583 INFO L225 Difference]: With dead ends: 147949 [2022-01-10 14:15:14,583 INFO L226 Difference]: Without dead ends: 96761 [2022-01-10 14:15:14,634 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:15:14,634 INFO L933 BasicCegarLoop]: 1023 mSDtfsCounter, 771 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 1858 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:15:14,634 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [771 Valid, 1858 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:15:14,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96761 states. [2022-01-10 14:15:20,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96761 to 95349. [2022-01-10 14:15:20,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95349 states, 95347 states have (on average 1.23482647592478) internal successors, (117737), 95348 states have internal predecessors, (117737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:15:21,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95349 states to 95349 states and 117737 transitions. [2022-01-10 14:15:21,044 INFO L78 Accepts]: Start accepts. Automaton has 95349 states and 117737 transitions. Word has length 164 [2022-01-10 14:15:21,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:15:21,044 INFO L470 AbstractCegarLoop]: Abstraction has 95349 states and 117737 transitions. [2022-01-10 14:15:21,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:15:21,044 INFO L276 IsEmpty]: Start isEmpty. Operand 95349 states and 117737 transitions. [2022-01-10 14:15:21,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-01-10 14:15:21,068 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:15:21,068 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:15:21,068 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-10 14:15:21,068 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:15:21,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:15:21,069 INFO L85 PathProgramCache]: Analyzing trace with hash 373111435, now seen corresponding path program 1 times [2022-01-10 14:15:21,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:15:21,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310522957] [2022-01-10 14:15:21,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:15:21,069 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:15:21,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:15:21,091 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 14:15:21,092 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:15:21,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310522957] [2022-01-10 14:15:21,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310522957] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:15:21,092 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:15:21,092 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:15:21,092 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283175850] [2022-01-10 14:15:21,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:15:21,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:15:21,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:15:21,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:15:21,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:15:21,093 INFO L87 Difference]: Start difference. First operand 95349 states and 117737 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:15:27,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:15:27,325 INFO L93 Difference]: Finished difference Result 190552 states and 235308 transitions. [2022-01-10 14:15:27,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:15:27,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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 164 [2022-01-10 14:15:27,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:15:27,473 INFO L225 Difference]: With dead ends: 190552 [2022-01-10 14:15:27,474 INFO L226 Difference]: Without dead ends: 95270 [2022-01-10 14:15:27,536 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:15:27,536 INFO L933 BasicCegarLoop]: 867 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, 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-10 14:15:27,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [858 Valid, 868 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:15:27,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95270 states. [2022-01-10 14:15:33,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95270 to 95270. [2022-01-10 14:15:33,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95270 states, 95268 states have (on average 1.2349057395977663) internal successors, (117647), 95269 states have internal predecessors, (117647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:15:34,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95270 states to 95270 states and 117647 transitions. [2022-01-10 14:15:34,154 INFO L78 Accepts]: Start accepts. Automaton has 95270 states and 117647 transitions. Word has length 164 [2022-01-10 14:15:34,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:15:34,155 INFO L470 AbstractCegarLoop]: Abstraction has 95270 states and 117647 transitions. [2022-01-10 14:15:34,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:15:34,155 INFO L276 IsEmpty]: Start isEmpty. Operand 95270 states and 117647 transitions. [2022-01-10 14:15:34,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 14:15:34,180 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:15:34,180 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:15:34,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-10 14:15:34,181 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:15:34,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:15:34,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1628417315, now seen corresponding path program 1 times [2022-01-10 14:15:34,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:15:34,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324436748] [2022-01-10 14:15:34,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:15:34,181 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:15:34,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:15:34,226 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:15:34,226 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:15:34,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324436748] [2022-01-10 14:15:34,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324436748] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:15:34,226 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:15:34,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:15:34,227 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422888356] [2022-01-10 14:15:34,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:15:34,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:15:34,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:15:34,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:15:34,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:15:34,228 INFO L87 Difference]: Start difference. First operand 95270 states and 117647 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)